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

An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid

Atsushi Matsuo, Shigeru Yamashita

Published Jan 1, 2019• 19 citations
Publisher
DOI
10.1007/978-3-030-21500-2_10

Related papers

Qubit placement to minimize communication overhead in 2D quantum architectures

Alireza Shafaei, Mehdi Saeedi, Massoud Pedram

Regular, local-neighbor topologies of quantum architectures restrict interactions to adjacent qubits, which in turn increases the latency of quantum circuits mapped to these architectures. To alleviate this effect, optimization methods that consider qubit-to-qubit interactions in 2D grid architectures are presented in this paper. The proposed approaches benefit from Mixed Integer Programming (MIP) formulation for the qubit placement problem. Simulation results on various benchmarks show 27% on average reduction in communication overhead between qubits compared to best results of previous work.

Asia and South Pacific Design Automation Conference (ASP-DAC)•Jan 1, 2014•121 citations

A method to generate quantum circuits for 2D pattern matching problem

Shi Cheng

Journal of Computational Methods in Sciences and Engineering•Apr 24, 2026•0 citations

Automated generation of layout and control for quantum circuits

Mark Whitney, Nemanja Isailovic, Yatish Patel +1 more

We present a computer-aided design flow for quantum circuits, complete with automatic layout and control logic extraction. To motivate automated layout for quantum circuits, we investigate grid-based layouts and show a performance variance of four times as we vary grid structure and initial qubit placement. We then propose two polynomial-time design heuristics: a greedy algorithm suitable for small, congestion-free quantum circuits and a dataflow-based analysis approach to placement and routing with implicit initial placement of qubits. Finally, we show that our dataflow-based heuristic generates better layouts than the state-of-the-art automated grid-based layout and scheduling mechanism in terms of latency and potential pipelinability, but at the cost of some area.

arXiv:0704.0268•ACM International Conference on Computing Frontiers (CF)•May 7, 2007•69 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
Regular, local-neighbor topologies of quantum architectures restrict interactions to adjacent qubits, which in turn increases the latency of quantum circuits mapped to these architectures. To alleviate this effect, optimization methods that consider qubit-to-qubit interactions in 2D grid architectures are presented in this paper. The proposed approaches benefit from Mixed Integer Programming (MIP) formulation for the qubit placement problem. Simulation results on various benchmarks show 27% on average reduction in communication overhead between qubits compared to best results of previous work.
We present a computer-aided design flow for quantum circuits, complete with automatic layout and control logic extraction. To motivate automated layout for quantum circuits, we investigate grid-based layouts and show a performance variance of four times as we vary grid structure and initial qubit placement. We then propose two polynomial-time design heuristics: a greedy algorithm suitable for small, congestion-free quantum circuits and a dataflow-based analysis approach to placement and routing with implicit initial placement of qubits. Finally, we show that our dataflow-based heuristic generates better layouts than the state-of-the-art automated grid-based layout and scheduling mechanism in terms of latency and potential pipelinability, but at the cost of some area.
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.