Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning

• URL: http://arxiv.org/abs/2405.13196v2
• Date: Wed, 26 Feb 2025 15:38:25 GMT
• Title: Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning
• Abstract summary: We integrate Reinforcement Learning into quantum transpiling, significantly enhancing synthesis and routing of quantum circuits.<n>We achieve near-optimal synthesis of Linear, Clifford, and Permutation circuits, up to 9, 11 and 65 qubits respectively.<n>We also achieve significant reductions in two-qubit gate depth and count for circuit routing up to 133 qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper demonstrates the integration of Reinforcement Learning (RL) into quantum transpiling workflows, significantly enhancing the synthesis and routing of quantum circuits. By employing RL, we achieve near-optimal synthesis of Linear Function, Clifford, and Permutation circuits, up to 9, 11 and 65 qubits respectively, while being compatible with native device instruction sets and connectivity constraints, and orders of magnitude faster than optimization methods such as SAT solvers. We also achieve significant reductions in two-qubit gate depth and count for circuit routing up to 133 qubits with respect to other routing heuristics such as SABRE. We find the method to be efficient enough to be useful in practice in typical quantum transpiling pipelines. Our results set the stage for further AI-powered enhancements of quantum computing workflows.

Related papers

• Application Scale Quantum Circuit Compilation with Controlled Error [1.5546281258530152]
  We develop a practical workflow for managing and optimizing tradeoffs in quantum circuit compilation and optimization.<n>We demonstrate our workflow on several benchmark algorithmic circuits acting on up to 380 qubits.
  arXiv  Detail & Related papers  (2025-10-20T18:29:02Z)
• Time-frequency Entangled Photon Mediated CCZ Gate [3.1094846943185677]
  We show a hardware-efficient scalable scheme for direct CCZ gate implementation based on two-photon absorption phenomenon.<n>We achieve a simulated fidelity over 99% within 194ns, surpassing the decomposed methods with single-qubit and two-qubit gates.
  arXiv  Detail & Related papers  (2025-09-08T09:59:26Z)
• Reinforcement Learning for Optimizing Large Qubit Array based Quantum Sensor Circuits [0.0]
  This paper presents an engineering integration of reinforcement learning with tensor-network-based simulation (MPS) for scalable circuit optimization.<n>Our reinforcement learning agent learns to restructure circuits to maximize Quantum Fisher Information (QFI) and entanglement entropy.<n> Experimental results show consistent improvements, with QFI values approaching 1, entanglement entropy in the 0.8-1.0 range, and up to 90% reduction in depth and gate count.
  arXiv  Detail & Related papers  (2025-08-28T22:51:28Z)
• CutQAS: Topology-aware quantum circuit cutting via reinforcement learning [0.0]
  We propose CutQAS, a framework that integrates quantum circuit cutting with quantum architecture search (QAS) to enhance quantum chemistry simulations. First, an RL agent explores all possible topologies to identify an optimal circuit structure. Subsequently, a second RL agent refines the selected topology by determining optimal circuit cuts, ensuring efficient execution on constrained hardware.
  arXiv  Detail & Related papers  (2025-04-05T13:13:50Z)
• Pauli Network Circuit Synthesis with Reinforcement Learning [0.0]
  We introduce a Reinforcement Learning-based method for re-synthesis of quantum circuits. We observe average improvements of 20% in two-qubit gate count and depth, reaching up to 60% for many instances. These results highlight the potential of RL-driven synthesis to significantly improve circuit quality in realistic, large-scale quantum transpilation workloads.
  arXiv  Detail & Related papers  (2025-03-18T17:27:50Z)
• ECDQC: Efficient Compilation for Distributed Quantum Computing with Linear Layout [6.382954852270525]
  We propose an efficient compilation method for distributed quantum computing (DQC) using the Linear Nearest Neighbor (LNN) architecture. Our approach significantly decreases compilation time, gate count, and circuit depth, improving robustness for large-scale quantum computations.
  arXiv  Detail & Related papers  (2024-10-31T12:07:46Z)
• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Quantum Fourier Transform using Dynamic Circuits [0.0]
  In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. In particular, the scaling of resource requirements is reduced from $O(n)$ two-qubit gates in a standard unitary formulation to $O(n)$ mid-circuit measurements in its dynamic counterpart.
  arXiv  Detail & Related papers  (2024-03-14T15:58:00Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus [0.0]
  We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams.<n>We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand.
  arXiv  Detail & Related papers  (2023-12-18T17:59:43Z)
• Characterization, synthesis, and optimization of quantum circuits over multiple-control $\textit{Z}$-rotation gates: A systematic study [4.385466953937176]
  We study quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives. We present a gate-exchange strategy together with a flexible iterative algorithm for effectively optimizing the depth of any MCZR circuit.
  arXiv  Detail & Related papers  (2023-04-18T06:34:18Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Effective non-local parity-dependent couplings in qubit chains [0.0]
  We harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations. The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions. We present numerical simulations of the gate operation in a superconducting quantum circuit architecture.
  arXiv  Detail & Related papers  (2022-03-14T17:33:40Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.