Optimal SWAP gate insertion for nearest neighbor quantum circuits

Wille, Robert; Lye, Aaron; Drechsler, Rolf

doi:10.1109/aspdac.2014.6742939

Cited by 74 publications

(33 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While these approaches lead to heuristic solutions only, an exact approach guaranteeing the minimal number of SWAP insertions has recently been proposed in [8,9]. In [6] , another exact approach has been proposed which additionally allows for changing the order of the gates so that the results obtained there are not directly compara ble to the other solutions.…”

Section: A Related Work and Considered Problemmentioning

confidence: 99%

“…For 1D quantum circuits, this can been obtained in linear time using in version vectors [8,9] . For multi-dimensional circuits, this constitutes a more complex problem.…”

Section: B Costs Of Establishing An Arbitrary Permutationmentioning

confidence: 99%

“…More precisely, this con straint enumerates all possible adjacent positions for the 3Note that, in accordance to previous work (e.g. [5,7,8,9] ), we assume the primary input qubits can arbitrarily be permuted with no additional costs. 4 Adding the unit vector to a position, i.e.…”

Section: Optimal Swap Gate Insertionmentioning

confidence: 99%

“…In particular, reordering the qubit positions or considering SWAP gate insertion not only locally for each single gate but for the whole cascade may reduce the costs signifi cantly. Hence, several approaches on determining good SWAP gate insertions have been proposed in the past [4,5,6,7,8,9] .…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

Lye

Wille

Drechsler

2015

The 20th Asia and South Pacific Design Automation Conference

Self Cite

View full text Add to dashboard Cite

Motivated by the promises of significant speed-ups for certain problems, quantum computing received significant attention in the past. While much progress has been made in the development of synthesis methods for quantum cir cuits, new physical developments constantly lead to new constraints to be addressed. The limited interaction dis tance between the respective qubits (i.e. nearest neigh bor optimization) has already been considered intensely. But with the emerge of multi-dimensional quantum ar chitectures, new physical requirements came up for which only a few automatic synthesis solutions exist yet -all of them of heuristic nature. In this work, we propose an exact scheme for nearest neighbor optimization in multi dimensional quantum circuits. Although the complexity of the problem is a serious obstacle, our experimental eval uation shows that the proposed solution is sufficient to allow for a qualitative evaluation of the respective opti mization steps. Besides that, this enabled an exact com parison to heuristical results for the first time.978-1-4799-7792-5/15/$31.00 ©2015 IEEE

show abstract

Section: A Related Work and Considered Problemmentioning

confidence: 99%

“…For 1D quantum circuits, this can been obtained in linear time using in version vectors [8,9] . For multi-dimensional circuits, this constitutes a more complex problem.…”

Section: B Costs Of Establishing An Arbitrary Permutationmentioning

confidence: 99%

Section: Optimal Swap Gate Insertionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

Lye

Wille

Drechsler

2015

The 20th Asia and South Pacific Design Automation Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…be applied for nearest neighbor optimization (see e.g. [24][25][26][27]). Here, control and target line connections always have to be adjacent, i.e.…”

Section: The Revvis Toolmentioning

confidence: 99%

RevVis: Visualization of Structures and Properties in Reversible Circuits

Wille

Stoppe

Schönborn

et al. 2014

Reversible Computation

Self Cite

View full text Add to dashboard Cite

Abstract. The recent interest in reversible computation led to plenty of (automatic) approaches for the design of the corresponding circuits. While this automation is desired in order to provide a proper support for the design of complex functionality, often a manual consideration and human intuition enable improvements or provide new ideas for design solutions. However, this manual interaction requires a good understanding of the structure or the properties of a reversible cascade which, with increasing circuit size, becomes harder to grasp. Visualization techniques that abstract irrelevant details and focus on intuitively displaying important structures or properties provide a solution to this problem and have already successfully been applied in other domains such as design of conventional software, hardware debugging, or Boolean satisfiability. In this work, we introduce RevVis, a graphical interface which visualizes structures and properties of reversible circuits. RevVis collects relevant data of a given reversible cascade and presents it in a simple but intuitive fashion. By this, RevVis unveils information on characteristic structures and properties of reversible circuits that could be utilized for further optimization. A case study demonstrates this by considering circuits obtained from several synthesis approaches.

show abstract

Quantum circuit physical design flow for 2D nearest‐neighbor architectures

Farghadan

Mohammadzadeh

2017

Circuit Theory & Apps

View full text Add to dashboard Cite

Summary The physical design process takes a netlist generated by the logic synthesis process and places and routes the netlist on a physical platform. In some physical platforms, physical qubits must be placed on a 2D grid. Each node of the grid represents a qubit. In these platforms, performing quantum gates on non‐adjacent qubits is very error prone or hard to control. Therefore, quantum gates are limited to be performed on adjacent qubits. A communication channel of swap gates needs to be constructed if the qubits in the logical circuit are not adjacent. The algorithms used for mapping of qubits on the grid have important roles in reducing the number of swap gates and thus decreasing of the circuit latency. Focusing on this issue, in this paper, a flow for physical design of quantum circuits on a 2D grid is proposed. It contains three algorithms for finding the order of qubit placement, physical qubit placement, and routing. Simulation results show that the proposed flow not only decreases the average number of swap gates by about 16% compared with the best in the literature but also improves the average runtime by about 94% compared with it. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

Optimal SWAP gate insertion for nearest neighbor quantum circuits

Cited by 74 publications

References 24 publications

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits

RevVis: Visualization of Structures and Properties in Reversible Circuits

Quantum circuit physical design flow for 2D nearest‐neighbor architectures

Contact Info

Product

Resources

About