scholarly journals Optimal ILP-Based Approach for Gate Location Assignment and Scheduling in Quantum Circuits

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Naser Mohammadzadeh ◽  
Tayebeh Bahreini ◽  
Hossein Badri
Keyword(s):  
Circuit Design ◽  
Design Methodology ◽  
Ion Trap ◽  
Quantum Circuit ◽  
Physical Design ◽  
Quantum Circuits ◽  
Mixed Integer ◽  
Routing And Scheduling ◽  
Design And Synthesis ◽  
Proposed Model

Physical design and synthesis are two key processes of quantum circuit design methodology. The physical design process itself decomposes into scheduling, mapping, routing, and placement. In this paper, a mathematical model is proposed for mapping, routing, and scheduling in ion-trap technology in order to minimize latency of the circuit. The proposed model which is a mixed integer linear programming (MILP) model gives the optimal locations for gates and the best sequence of operations in terms of latency. Experimental results show that our scheme outperforms the other schemes for the attempted benchmarks.

QUANTUM LOGIC CIRCUIT DESIGN OF MANY-VALUED GALOIS REVERSIBLE EXPANSIONS AND FAST TRANSFORMS

2007 ◽  
Vol 16 (05) ◽  
pp. 641-671
Author(s):  
ANAS N. AL-RABADI
Keyword(s):  
Circuit Design ◽  
Design Methodology ◽  
Structural Complexity ◽  
Cost Benefit ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Circuit Synthesis ◽  
Benefit Design ◽  
Fast Transforms ◽  
Future Technologies

Many-valued quantum circuit synthesis of many-valued reversible expansions and fast transforms is introduced in this paper. Since the reduction of power consumption is a major requirement for the circuit design in future technologies, such as in quantum computing, the main features of several future technologies will include reversibility. Consequently, the new quantum circuits can play an important task in the design of future circuits that consume minimal power. In addition, the new quantum circuit methodology is general and can be used to realize any multiple-valued function in the quantum space. It is also shown that the structural generality advantage that results from the new design methodology is opposed with the increased quantum structural complexity disadvantage which may be considered in any further cost-benefit design analysis.

scholarly journals QUANTUM SOFTWARE REUSABILITY

2003 ◽  
Vol 14 (05) ◽  
pp. 777-796 ◽  
Author(s):  
ANDREAS KLAPPENECKER ◽  
MARTIN RÖTTELER
Keyword(s):  
Circuit Design ◽  
Unique Feature ◽  
Fourier Transforms ◽  
Design Method ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Unitary Matrix ◽  
Mathematical Basis ◽  
Discrete Hartley Transform ◽  
Software Reusability

The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that has the following unique feature: It allows to construct efficient quantum circuits in a systematic way by reusing and combining a set of highly optimized quantum circuits. Specifically, the method realizes a quantum circuit for a given unitary matrix by implementing a linear combination of representing matrices of a group, which have known fast quantum circuits. We motivate and illustrate this method by deriving extremely efficient quantum circuits for the discrete Hartley transform and for the fractional Fourier transforms. The sound mathematical basis of this design method allows to give meaningful and natural interpretations of the resulting circuits. We demonstrate this aspect by giving a natural interpretation of known teleportation circuits.

Quantum circuit physical design methodology with emphasis on physical synthesis

2013 ◽  
Vol 13 (2) ◽  
pp. 445-465 ◽  
Author(s):  
Naser Mohammadzadeh ◽  
Morteza Saheb Zamani ◽  
Mehdi Sedighi
Keyword(s):  
Design Methodology ◽  
Quantum Circuit ◽  
Physical Design ◽  
Physical Synthesis

GATE LOCATION CHANGING: AN OPTIMIZATION TECHNIQUE FOR QUANTUM CIRCUITS

2012 ◽  
Vol 10 (03) ◽  
pp. 1250037 ◽  
Author(s):  
NASER MOHAMMADZADEH ◽  
MEHDI SEDIGHI ◽  
MORTEZA SAHEB ZAMANI
Keyword(s):  
Circuit Design ◽  
Optimization Technique ◽  
Quantum Circuit ◽  
Optimization Techniques ◽  
Design Flow ◽  
Quantum Circuits ◽  
Design Constraints ◽  
Gate Location ◽  
Layout Generation ◽  
Critical Paths

During the physical design process, the second process of the quantum circuit design flow, using some optimization techniques after layout generation might be useful to improve the metrics or meet the design constraints. Focusing on this issue, this paper proposes an optimization technique using gate location changing to improve the latency of quantum circuits. The proposed technique uses layout and scheduling information to find critical paths and improve their latency by changing locations of the gates on the critical paths. Experimental results show that the proposed technique decreases the latency of quantum circuits up to 26% for the attempted benchmarks.

scholarly journals Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study

2017 ◽  
Vol 5 (2) ◽  
pp. 45 ◽  
Author(s):  
Alireza Rashidi Komijan ◽  
Danial Delavari
Keyword(s):  
Vehicle Routing ◽  
Time Window ◽  
Programming Model ◽  
Transportation Costs ◽  
Mixed Integer ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Routing And Scheduling ◽  
Perishable Product ◽  
Proposed Model

<div data-canvas-width="542.172"><p>The well-known Vehicle Routing Problem (VRP) is to find proper sequence of routes in order to minimize transportation costs. In this paper, a mixed-integer programming model is presented for a food distributer company and the model outputs are to determine the optimal routes and amount of pickup and delivery. In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. The proposed model with respect to real conditions is multi-period and has two different time periods: one for dispatching vehicles to customers and suppliers and the other for receiving  customers’ orders. Time window and split pickup and delivery are considered for perishable products. The proposed model is  nonlinear and will be linearized using exact techniques. At the end, model is solved using GAMS and the sensitivity analysis  is performed. The results indicate that the trend of changes in holding and transportation costs in compared to tardiness and  earliness costs are closed together and are not so sensitive to demand changes.</p></div>

scholarly journals Quantum circuit design methodology for multiple linear regression

2020 ◽  
Vol 1 (2) ◽  
pp. 55-61
Author(s):  
Sanchayan Dutta ◽  
Adrien Suau ◽  
Sagnik Dutta ◽  
Suvadeep Roy ◽  
Bikash K. Behera ◽  
...  
Keyword(s):  
Linear Regression ◽  
Multiple Linear Regression ◽  
Circuit Design ◽  
Design Methodology ◽  
Quantum Circuit

scholarly journals Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Ismail Ghodsollahee ◽  
Zohreh Davarzani ◽  
Mariam Zomorodi ◽  
Paweł Pławiak ◽  
Monireh Houshmand ◽  
...  
Keyword(s):  
Quantum Computation ◽  
Quantum Computer ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Connectivity Matrix ◽  
Circuit Optimization ◽  
Novel Approach ◽  
The Matrix ◽  
Minimum Number ◽  
Two Phases

AbstractAs quantum computation grows, the number of qubits involved in a given quantum computer increases. But due to the physical limitations in the number of qubits of a single quantum device, the computation should be performed in a distributed system. In this paper, a new model of quantum computation based on the matrix representation of quantum circuits is proposed. Then, using this model, we propose a novel approach for reducing the number of teleportations in a distributed quantum circuit. The proposed method consists of two phases: the pre-processing phase and the optimization phase. In the pre-processing phase, it considers the bi-partitioning of quantum circuits by Non-Dominated Sorting Genetic Algorithm (NSGA-III) to minimize the number of global gates and to distribute the quantum circuit into two balanced parts with equal number of qubits and minimum number of global gates. In the optimization phase, two heuristics named Heuristic I and Heuristic II are proposed to optimize the number of teleportations according to the partitioning obtained from the pre-processing phase. Finally, the proposed approach is evaluated on many benchmark quantum circuits. The results of these evaluations show an average of 22.16% improvement in the teleportation cost of the proposed approach compared to the existing works in the literature.

Sign in / Sign up

Export Citation Format

Share Document