Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures

Wakaki Hattori, Shigeru Yamashita

Published Jan 1, 2018• 46 citations
Publisher
DOI
10.1007/978-3-319-99498-7_16

Related papers

Design of Efficient Quantum Circuits Using Nearest Neighbor Constraint in 2D Architecture

Leniency Marbaniang, Abhoy Kole, Kamalika Datta +1 more

Lecture notes in computer science•Jan 1, 2017•8 citations

An improved heuristic technique for nearest neighbor realization of quantum circuits in 2D architecture

Anirban Bhattacharjee, Chandan Bandyopadhyay, Philipp Niemann +3 more

Integration•Sep 11, 2020•10 citations

Mapping a Quantum Circuit to 2D Nearest Neighbor Architecture by Changing the Gate Order

Wakaki Hattori, Shigeru Yamashita

This paper proposes a new approach to optimize the number of necessary SWAP gates when we perform a quantum circuit on a two-dimensional (2D) NNA. Our new idea is to change the order of quantum gates (if possible) so that each sub-circuit has only gates performing on adjacent qubits. For each sub-circuit, we utilize a SAT solver to find the best qubit placement such that the sub-circuit has only gates on adjacent qubits. Each sub-circuit may have a different qubit placement such that we do not need SWAP gates for the sub-circuit. Thus, we insert SWAP gates between two sub-circuits to change the qubit placement which is desirable for the following sub-circuit. To reduce the number of such SWAP gates between two sub-circuits, we utilize A* algorithm.

IEICE Transactions on Information and Systems•Oct 31, 2019•7 citations

An Efficient Nearest Neighbor Design for 2D Quantum Circuits

Anirban Bhattacharjee, Chandan Bandyopadhyay, Bappaditya Mondal +3 more

Lecture notes in electrical engineering•Jul 28, 2019•1 citation

Nearest Neighbor Transformation of Quantum Circuits in 2D Architecture

Xueyun Cheng, Zhijin Guan, Pengcheng Zhu

In recent years, quantum computing has received extensive attention for its superior efficiency and application potential. For some physical architecture, one qubit can only interact with its adjacent qubits, SWAP gates are inserted to make a quantum circuit nearest neighbor compliant. The initial qubit placement algorithm in a 2D grid structure is proposed based on the constructed interaction cost metric model, and the method of dynamic grid decision is given. In order to obtain a better way of inserting SWAP gates, the gate level and circuit level interaction routing policies are put forward, and a heuristic pruning of interaction routing records is employed so as to reduce the runtime and additional quantum cost. Experimental results show that our proposed methods can achieve better performance than existing methods, and the average optimization rate of quantum cost is 21.76% and 17.23% respectively.

IEEE Access•Jan 1, 2020•14 citations

Improving the Design of Nearest Neighbor Quantum Circuits in 2D Space

Neha Chaudhuri, Chandan Bandyopadhyay, Hafizur Rahaman

Communications in computer and information science•Jan 1, 2017•3 citations
This paper proposes a new approach to optimize the number of necessary SWAP gates when we perform a quantum circuit on a two-dimensional (2D) NNA. Our new idea is to change the order of quantum gates (if possible) so that each sub-circuit has only gates performing on adjacent qubits. For each sub-circuit, we utilize a SAT solver to find the best qubit placement such that the sub-circuit has only gates on adjacent qubits. Each sub-circuit may have a different qubit placement such that we do not need SWAP gates for the sub-circuit. Thus, we insert SWAP gates between two sub-circuits to change the qubit placement which is desirable for the following sub-circuit. To reduce the number of such SWAP gates between two sub-circuits, we utilize A* algorithm.
In recent years, quantum computing has received extensive attention for its superior efficiency and application potential. For some physical architecture, one qubit can only interact with its adjacent qubits, SWAP gates are inserted to make a quantum circuit nearest neighbor compliant. The initial qubit placement algorithm in a 2D grid structure is proposed based on the constructed interaction cost metric model, and the method of dynamic grid decision is given. In order to obtain a better way of inserting SWAP gates, the gate level and circuit level interaction routing policies are put forward, and a heuristic pruning of interaction routing records is employed so as to reduce the runtime and additional quantum cost. Experimental results show that our proposed methods can achieve better performance than existing methods, and the average optimization rate of quantum cost is 21.76% and 17.23% respectively.