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

Nature

Noisy times ahead

Jan M. van Ruitenbeek

Published Mar 1, 2001• 2 citations
Publisher
DOI
10.1038/35068660

Related papers

What Lies Ahead?

David Herres

Springer eBooks•Jan 1, 2020•1 citation

THE FUTURE LIES AHEAD

Phil Anderson

Recent Progress in Many-Body Theories•Jul 1, 2006•0 citations

Blast from the future

Adam Becker

The New Scientist•Feb 1, 2018•0 citations

QM-DLA: an efficient qubit mapping method based on dynamic look-ahead strategy

Hui Liu, Bingjie Zhang, Yu Zhu +2 more

Quantum computing has already demonstrated great computational potential across multiple domains and has received more and more attention. However, due to the connectivity limitations of Noisy Intermediate-Scale Quantum (NISQ) devices, most of the quantum algorithms cannot be directly executed without the help of inserting SWAP gates. Nevertheless, more SWAP gates lead to a longer execution time and, inevitably, lower fidelity of the algorithm. To this end, this paper proposes an optimized qubit mapping algorithm based on a dynamic look-ahead strategy to minimize the number of SWAP gates inserted. Firstly, a heuristic algorithm is proposed based on maximizing physical qubit connectivity to generate the optimal initial qubit mapping, which reduces the need for logical qubit shifts during subsequent SWAP gate insertion. Secondly, in the form of directed acyclic graphs, we identify quantum gates that violate the constraints of physical coupling and insert SWAP gates to remap qubits, thereby overcoming the limitations of qubit interactions. Finally, the optimal SWAP gate insertion strategy is built by comparing the cost of different SWAP gate insertion strategies through a multi-window look-ahead strategy to reduce the number of SWAP gates inserted. The experimental results show that the strategy in this paper decreases the number of SWAP gate insertions and significantly reduces the depth of quantum circuits when performing qubit mapping compared with state-of-the-art methods.

Scientific Reports•Jun 7, 2024•5 citations

Future Prospects

Jungsang Kim, Seema Somani, Y. Yamamoto

Springer series in photonics•Jan 1, 2001•0 citations

A Graph-Based Deep Reinforcement Learning Framework for Quantum Circuit Mapping with Look-Ahead Rewards and Biased Exploration

Yueran Zhao, Kaiqi Li, Ziying Guo +1 more

Current quantum computing hardware imposes strict constraints on two-qubit gate operations, limiting their application to specific qubit pairs. This leads to a structural mismatch between quantum circuits and hardware limitations. Quantum circuit mapping addresses this issue by inserting SWAP gates to enable logical circuit equivalence. In the Noisy Intermediate-Scale Quantum (NISQ) era, minimizing the number of additional gates is crucial to reduce circuit error rates. We propose LARBE (Look-Ahead Rewards and Biased Exploration), a deep reinforcement learning framework utilizing graph neural networks to encode quantum circuits. The look-ahead reward mechanism enables intelligent trade-offs between immediate and future mapping benefits, while the biased exploration incorporates heuristic rules to accelerate training convergence. Benchmarking against the SABRE algorithm demonstrates performance improvements ranging from 5.83% to 17.57% on several common hardware topologies.

•Oct 26, 2025•0 citations
Quantum computing has already demonstrated great computational potential across multiple domains and has received more and more attention. However, due to the connectivity limitations of Noisy Intermediate-Scale Quantum (NISQ) devices, most of the quantum algorithms cannot be directly executed without the help of inserting SWAP gates. Nevertheless, more SWAP gates lead to a longer execution time and, inevitably, lower fidelity of the algorithm. To this end, this paper proposes an optimized qubit mapping algorithm based on a dynamic look-ahead strategy to minimize the number of SWAP gates inserted. Firstly, a heuristic algorithm is proposed based on maximizing physical qubit connectivity to generate the optimal initial qubit mapping, which reduces the need for logical qubit shifts during subsequent SWAP gate insertion. Secondly, in the form of directed acyclic graphs, we identify quantum gates that violate the constraints of physical coupling and insert SWAP gates to remap qubits, thereby overcoming the limitations of qubit interactions. Finally, the optimal SWAP gate insertion strategy is built by comparing the cost of different SWAP gate insertion strategies through a multi-window look-ahead strategy to reduce the number of SWAP gates inserted. The experimental results show that the strategy in this paper decreases the number of SWAP gate insertions and significantly reduces the depth of quantum circuits when performing qubit mapping compared with state-of-the-art methods.
Current quantum computing hardware imposes strict constraints on two-qubit gate operations, limiting their application to specific qubit pairs. This leads to a structural mismatch between quantum circuits and hardware limitations. Quantum circuit mapping addresses this issue by inserting SWAP gates to enable logical circuit equivalence. In the Noisy Intermediate-Scale Quantum (NISQ) era, minimizing the number of additional gates is crucial to reduce circuit error rates. We propose LARBE (Look-Ahead Rewards and Biased Exploration), a deep reinforcement learning framework utilizing graph neural networks to encode quantum circuits. The look-ahead reward mechanism enables intelligent trade-offs between immediate and future mapping benefits, while the biased exploration incorporates heuristic rules to accelerate training convergence. Benchmarking against the SABRE algorithm demonstrates performance improvements ranging from 5.83% to 17.57% on several common hardware topologies.