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

ACM Great Lakes Symposium on VLSI (GLSVLSI)

Graph Neural Network Assisted Quantum Compilation for Qubit Allocation

Travis LeCompte, Fang Qi, Xu Yuan, Nian-Feng Tzeng, M. Hassan Najafi, Lu Peng

Published May 31, 2023• 7 citations
Publisher

Abstract

Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - size and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable at the current size of computers, requiring thousands of qubits, while NISQ systems have nearly one hundred at most. One common approach to improve reliability is to adjust the compilation process to create a more reliable final circuit, where the two most critical compilation decisions are the qubit allocation and qubit routing problems. We focus on solving the qubit allocation problem and identifying initial layouts that result in a reduction of error. To identify these layouts, we combine reinforcement learning with a graph neural network (GNN)-based Q-network to process the mesh topology of the quantum computer, known as the backend, and make mapping decisions, creating a Graph Neural Network Assisted Quantum Compilation (GNAQC) strategy. We train the architecture using a set of four backends and six circuits and find that GNAQC improves output fidelity by roughly 12.7% over pre-existing allocation methods.

DOI
10.1145/3583781.3590300

Related papers

Machine-Learning-Based Qubit Allocation for Error Reduction in Quantum Circuits

Travis LeCompte, Fang Qi, Xu Yuan +3 more

Quantum computing is a quickly growing field with great potential for future technology. Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - qubit count and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable to the current size of computers, requiring thousands of qubits, while current NISQ systems have hundreds at most. It is therefore imperative to improve the reliability of the circuits as much as possible to make them robust to the errors that will occur. One common approach is to adjust the compilation process of a circuit to create a final circuit with improved reliability. However, there are many decisions to be made when compiling that affect the final performance of the circuit, two of the most critical ones being the mapping of logical to physical qubits (the qubit allocation problem) and the movement of qubits to satisfy two-qubit gate adjacency requirements (the qubit routing problem). We focus on solving the qubit allocation problem and identifying initial layouts that reduce error. To identify these layouts, we combine reinforcement learning with a graph neural network (GNN)-based Q-network for analyzing both the connections and error rates of the graph-like backend of superconducting quantum computers to make mapping decisions, creating a Graph Neural Network Assisted Compilation (GNAQC) strategy. We provide both the circuit and the properties of the target backend as input to guide the decision-making process. We work with the IBM Qiskit API to compile and simulate our quantum circuits. We train the architecture using a set of four backends and six circuits and find that GNAQC generally outperforms pre-existing qubit allocation algorithms, increasing final relative output fidelity by roughly 12.7%.

IEEE Transactions on Quantum Engineering•Jan 1, 2023•22 citations

Compilation Optimizations to Enhance Resilience of Big Data Programs and Quantum Processors

Travis LeCompte

Modern computers can experience a variety of transient errors due to the surrounding environment, known as soft faults. Although the frequency of these faults is low enough to not be noticeable on personal computers, they become a considerable concern during large-scale distributed computations or systems in more vulnerable environments like satellites. These faults occur as a bit flip of some value in a register, operation, or memory during execution. They surface as either program crashes, hangs, or silent data corruption (SDC), each of which can waste time, money, and resources. Hardware methods, such as shielding or error correcting memory (ECM), exist, though they can be difficult to implement, expensive, and may be limited to only protecting against errors in specific locations. Researchers have been exploring software detection and correction methods as an alternative, commonly trading either overhead in execution time or memory usage to protect against faults. Quantum computers, a relatively recent advancement in computing technology, experience similar errors on a much more severe scale. The errors are more frequent, costly, and difficult to detect and correct. Error correction algorithms like Shor’s code promise to completely remove errors, but they cannot be implemented on current noisy intermediate-scale quantum (NISQ) systems due to the low number of available qubits. Until the physical systems become large enough to support error correction, researchers instead have been studying other methods to reduce and compensate for errors. In this work, we present two methods for improving the resilience of classical processes, both single- and multi-threaded. We then introduce quantum computing and compare the nature of errors and correction methods to previous classical methods. We further discuss two designs for improving compilation of quantum circuits. One method, focused on quantum neural networks (QNNs), takes advantage of partial compilation to avoid recompiling the entire circuit each time. The other method is a new approach to compiling quantum circuits using graph neural networks (GNNs) to improve the resilience of quantum circuits and increase fidelity. By using GNNs with reinforcement learning, we can train a compiler to provide improved qubit allocation that improves the success rate of quantum circuits.

Civil War Book Review•Oct 10, 2022•0 citations

Noise Adaptive Quantum Circuit Mapping Using Reinforcement Learning and Graph Neural Network

Vedika Saravanan, Samah Mohamed Saeed

To generate physical quantum circuits, quantum gates are often added to the quantum circuit to satisfy the hardware constraints. This process is called quantum circuit mapping. Noise-aware mapping techniques generate physical quantum circuits for noisy intermediate-scale quantum (NISQ) computers. However, the absence of an accurate noise model of the quantum hardware limits its performance. In this article, we propose a noise adaptive quantum circuit mapping approach using reinforcement learning (RL) and graph neural network (GNN)-based reliability predictor. Our RL agent learns a quantum circuit mapping policy that significantly improves the quantum circuit output fidelity by interacting with the environment, which adopts a GNN reliability model that acts as quantum hardware and estimates the physical quantum circuit fidelity. Furthermore, we propose a multi-GNN reliability model to speed up the inference while maintaining high accuracy. Our proposed RL framework fills the gap between the simplified reliability models of the quantum hardware and the realistic noise impact of the quantum hardware on the quantum circuits. We demonstrate the improvement in the output fidelity of quantum circuits generated using our approach compared to other quantum circuit mapping techniques across different real-world quantum hardware using multiple-seed experiments.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Dec 14, 2023•17 citations

A graph-based reinforcement-learning framework for logical qubit allocation in fault-tolerant quantum architectures

Tian Li, Tan Li, Wan‐Su Bao

Abstract Logical-qubit allocation is a central compilation problem for fault-tolerant quantum architectures, where circuit qubits must be assigned to feasible chip tiles while minimizing the ancilla-qubit cost (the number of extra workspace qubits consumed by the routing corridors required to execute the circuit) and preserving efficient access to magic-state resources. This hard combinatorial problem has resisted full automation: existing allocators struggle to jointly capture global circuit interactions, tile-level routing feasibility, and generalization across circuit families. We propose a graph-based reinforcement-learning framework in which a graph neural network is first pretrained to predict the ancilla-qubit cost of circuit-allocation pairs from allocation-aware circuit graphs (graphs that combine circuit structure with the current placement of each qubit), and the resulting encoder is transferred to a reinforcement learning agent that assigns tiles one at a time. As a result, the agent learns to utilize past experience to produce higher-quality solutions to new instances of the allocation problem. Evaluated on MQTBench circuits compiled to lattice-surgery instructions under leave-one-family-out cross-validation, our allocator reduces average ancilla-qubit cost by 36.7% compared to the state-of-the-art ECMAS+ baseline and achieves lower cost in 57 out of 64 qubit-size bins. The method further exhibits family-dependent scale extrapolation and responsive few-shot adaptation, establishing learned logical-qubit allocation as a scalable and transferable paradigm that outperforms ECMAS+ under the evaluated fixed-chip setting.

Quantum Science and Technology•Sep 8, 2026•0 citations

Data-Driven Reliability Models of Quantum Circuit: From Traditional ML to Graph Neural Network

Vedika Saravanan, Samah Mohamed Saeed

The current advancement in quantum computers has been focusing on increasing the number of qubits and enhancing their fidelity. However, the available quantum devices, known as intermediate scale quantum (NISQ) computers, still suffer from different sources of noise that impact their reliability. Thus, practical noise modeling is of great importance in the development of quantum error mitigation approaches. In this article, we propose a machine learning (ML)-based scheme to predict the output fidelity of the quantum circuit executed on NISQ devices. We show the benefit of using graph neural network (GNN)-based models compared to traditional ML-based models in capturing the quantum circuit structure in addition to its gates’ features, which enable characterizing unpredicted quantum circuit errors. We use different metrics to measure the fidelity of the quantum circuit output. Our experimental results using different quantum algorithms executed on IBM Q Guadalupe quantum computer show the high prediction accuracy of our ML reliability models. Our results also show that our models can guide the single-qubit gate rescheduling to improve the output fidelity of the quantum circuit without the need for prior execution of dedicated calibration circuits.

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems•Sep 5, 2022•24 citations

Integration of Machine Learning with Quantum Computing: Compilation of Quantum Circuit for Efficacy on Noisy Intermediate-Scale Quantum Devices

M. Praba, Ahmad Abdelhafiz Ali Samhan, V. Samuthira Pandi +3 more

Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.

Asian Conference on Innovation in Technology (ASIANCON)•Aug 22, 2025•1 citation
Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - size and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable at the current size of computers, requiring thousands of qubits, while NISQ systems have nearly one hundred at most. One common approach to improve reliability is to adjust the compilation process to create a more reliable final circuit, where the two most critical compilation decisions are the qubit allocation and qubit routing problems. We focus on solving the qubit allocation problem and identifying initial layouts that result in a reduction of error. To identify these layouts, we combine reinforcement learning with a graph neural network (GNN)-based Q-network to process the mesh topology of the quantum computer, known as the backend, and make mapping decisions, creating a Graph Neural Network Assisted Quantum Compilation (GNAQC) strategy. We train the architecture using a set of four backends and six circuits and find that GNAQC improves output fidelity by roughly 12.7% over pre-existing allocation methods.
Quantum computing is a quickly growing field with great potential for future technology. Quantum computers in the current noisy intermediate-scale quantum (NISQ) era face two major limitations - qubit count and error vulnerability. Although quantum error correction (QEC) methods exist, they are not applicable to the current size of computers, requiring thousands of qubits, while current NISQ systems have hundreds at most. It is therefore imperative to improve the reliability of the circuits as much as possible to make them robust to the errors that will occur. One common approach is to adjust the compilation process of a circuit to create a final circuit with improved reliability. However, there are many decisions to be made when compiling that affect the final performance of the circuit, two of the most critical ones being the mapping of logical to physical qubits (the qubit allocation problem) and the movement of qubits to satisfy two-qubit gate adjacency requirements (the qubit routing problem). We focus on solving the qubit allocation problem and identifying initial layouts that reduce error. To identify these layouts, we combine reinforcement learning with a graph neural network (GNN)-based Q-network for analyzing both the connections and error rates of the graph-like backend of superconducting quantum computers to make mapping decisions, creating a Graph Neural Network Assisted Compilation (GNAQC) strategy. We provide both the circuit and the properties of the target backend as input to guide the decision-making process. We work with the IBM Qiskit API to compile and simulate our quantum circuits. We train the architecture using a set of four backends and six circuits and find that GNAQC generally outperforms pre-existing qubit allocation algorithms, increasing final relative output fidelity by roughly 12.7%.
Modern computers can experience a variety of transient errors due to the surrounding environment, known as soft faults. Although the frequency of these faults is low enough to not be noticeable on personal computers, they become a considerable concern during large-scale distributed computations or systems in more vulnerable environments like satellites. These faults occur as a bit flip of some value in a register, operation, or memory during execution. They surface as either program crashes, hangs, or silent data corruption (SDC), each of which can waste time, money, and resources. Hardware methods, such as shielding or error correcting memory (ECM), exist, though they can be difficult to implement, expensive, and may be limited to only protecting against errors in specific locations. Researchers have been exploring software detection and correction methods as an alternative, commonly trading either overhead in execution time or memory usage to protect against faults. Quantum computers, a relatively recent advancement in computing technology, experience similar errors on a much more severe scale. The errors are more frequent, costly, and difficult to detect and correct. Error correction algorithms like Shor’s code promise to completely remove errors, but they cannot be implemented on current noisy intermediate-scale quantum (NISQ) systems due to the low number of available qubits. Until the physical systems become large enough to support error correction, researchers instead have been studying other methods to reduce and compensate for errors. In this work, we present two methods for improving the resilience of classical processes, both single- and multi-threaded. We then introduce quantum computing and compare the nature of errors and correction methods to previous classical methods. We further discuss two designs for improving compilation of quantum circuits. One method, focused on quantum neural networks (QNNs), takes advantage of partial compilation to avoid recompiling the entire circuit each time. The other method is a new approach to compiling quantum circuits using graph neural networks (GNNs) to improve the resilience of quantum circuits and increase fidelity. By using GNNs with reinforcement learning, we can train a compiler to provide improved qubit allocation that improves the success rate of quantum circuits.
To generate physical quantum circuits, quantum gates are often added to the quantum circuit to satisfy the hardware constraints. This process is called quantum circuit mapping. Noise-aware mapping techniques generate physical quantum circuits for noisy intermediate-scale quantum (NISQ) computers. However, the absence of an accurate noise model of the quantum hardware limits its performance. In this article, we propose a noise adaptive quantum circuit mapping approach using reinforcement learning (RL) and graph neural network (GNN)-based reliability predictor. Our RL agent learns a quantum circuit mapping policy that significantly improves the quantum circuit output fidelity by interacting with the environment, which adopts a GNN reliability model that acts as quantum hardware and estimates the physical quantum circuit fidelity. Furthermore, we propose a multi-GNN reliability model to speed up the inference while maintaining high accuracy. Our proposed RL framework fills the gap between the simplified reliability models of the quantum hardware and the realistic noise impact of the quantum hardware on the quantum circuits. We demonstrate the improvement in the output fidelity of quantum circuits generated using our approach compared to other quantum circuit mapping techniques across different real-world quantum hardware using multiple-seed experiments.
Abstract Logical-qubit allocation is a central compilation problem for fault-tolerant quantum architectures, where circuit qubits must be assigned to feasible chip tiles while minimizing the ancilla-qubit cost (the number of extra workspace qubits consumed by the routing corridors required to execute the circuit) and preserving efficient access to magic-state resources. This hard combinatorial problem has resisted full automation: existing allocators struggle to jointly capture global circuit interactions, tile-level routing feasibility, and generalization across circuit families. We propose a graph-based reinforcement-learning framework in which a graph neural network is first pretrained to predict the ancilla-qubit cost of circuit-allocation pairs from allocation-aware circuit graphs (graphs that combine circuit structure with the current placement of each qubit), and the resulting encoder is transferred to a reinforcement learning agent that assigns tiles one at a time. As a result, the agent learns to utilize past experience to produce higher-quality solutions to new instances of the allocation problem. Evaluated on MQTBench circuits compiled to lattice-surgery instructions under leave-one-family-out cross-validation, our allocator reduces average ancilla-qubit cost by 36.7% compared to the state-of-the-art ECMAS+ baseline and achieves lower cost in 57 out of 64 qubit-size bins. The method further exhibits family-dependent scale extrapolation and responsive few-shot adaptation, establishing learned logical-qubit allocation as a scalable and transferable paradigm that outperforms ECMAS+ under the evaluated fixed-chip setting.
The current advancement in quantum computers has been focusing on increasing the number of qubits and enhancing their fidelity. However, the available quantum devices, known as intermediate scale quantum (NISQ) computers, still suffer from different sources of noise that impact their reliability. Thus, practical noise modeling is of great importance in the development of quantum error mitigation approaches. In this article, we propose a machine learning (ML)-based scheme to predict the output fidelity of the quantum circuit executed on NISQ devices. We show the benefit of using graph neural network (GNN)-based models compared to traditional ML-based models in capturing the quantum circuit structure in addition to its gates’ features, which enable characterizing unpredicted quantum circuit errors. We use different metrics to measure the fidelity of the quantum circuit output. Our experimental results using different quantum algorithms executed on IBM Q Guadalupe quantum computer show the high prediction accuracy of our ML reliability models. Our results also show that our models can guide the single-qubit gate rescheduling to improve the output fidelity of the quantum circuit without the need for prior execution of dedicated calibration circuits.
Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.