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

arXiv:2203.04426

Efficient quantum gate decomposition via adaptive circuit compression

Péter Rakyta, Zoltán Zimborás

Published Mar 8, 2022• 31 citations
arXivHTMLPDF

Abstract

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform the discrete combinatorial problem of circuit synthesis into an optimization problem over continuous variables. The circuit is then compressed by a sequential removal of two-qubit gates from the design, while the remaining building blocks are continuously adapted to the reduced gate structure by iterated learning cycles. We implemented the developed algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools. Our numerical experiments revealed outstanding circuit compression capabilities of our compilation algorithm providing the most optimal gate count in the majority of the addressed quantum circuits.

DOI
10.48550/arxiv.2203.04426

Related papers

Adaptive Quantum Circuit Compilation with Bayesian Optimization

Jincheng Zhang

Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.

•Sep 6, 2026•0 citations

Efficient Circuit Transpilation of Commuting Gates on 2D Grids

Sabina Drăgoi, Daniel J. Egger

Combinatorial optimization problems are central to many applications but can be challenging to solve. Quantum approaches such as the Quantum Approximate Optimization Algorithm (QAOA) offer new tools with which to tackle such problems. However, QAOA circuits inherit the interaction structure of the target Hamiltonian, often resulting in deep circuits when compiled onto hardware with limited connectivity. Efficient transpilation is therefore critical to their practical performance. In this work, we propose a transpilation scheme for circuits consisting of blocks of commuting two-qubit gates on two-dimensional lattices. Unlike standard approaches based on random initial mappings and fixed routing, our method alternates between constructing problem-dependent SWAP-layer sequences and updating the qubit layout. By adapting the routing to the required interactions, this yields significantly shorter circuits for graphs with few edges. We benchmark our approach on QAOA instances for Maximum Cut (MC) on Random Regular graphs and Maximum Independent Set (MIS) on Erdős-Rényi graphs. Compared to standard methods, we reduce circuit depth and gate count by about a factor of two, enabling experiments with up to $80$ qubits and improving approximation ratios by up to $6.6\%$ for MC and $9.3\%$ for MIS.

quant-pharXiv:2607.10274•Jul 14, 2026•2 citations

Adaptive Quantum Circuit Compilation via Reinforcement Learning

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum algorithms on near-term quantum hardware. The process of translating high-level quantum algorithms into low-level gate sequences, while minimizing gate count and circuit depth, is often performed using deterministic algorithms that struggle to adapt to the diverse and often imperfect characteristics of available quantum devices. This paper proposes a novel approach to quantum circuit compilation utilizing reinforcement learning (RL). An RL agent is trained to dynamically adapt to hardware constraints, such as qubit connectivity and gate decomposition costs, optimizing circuit fidelity and execution time. The core claim is that RL can significantly improve quantum circuit compilation by introducing a dynamic and adaptive compilation process. The agent learns a policy that maps high-level quantum algorithms to optimized low-level gate sequences, effectively bridging the gap between theoretical algorithms and practical hardware execution. This work demonstrates the potential of RL to overcome the limitations of traditional deterministic compilation methods and paves the way for more efficient and robust quantum algorithm implementation.

•Aug 28, 2026•0 citations

Efficient variational synthesis of quantum circuits with coherent multi-start optimization

Nikita A. Nemkov, Evgeniy O. Kiktenko, I. A. Luchnikov +1 more

We consider the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates with the primary target being the minimization of the CNOT count. First we note that along with the discrete architecture search suffering from the combinatorial explosion of complexity, optimization over 1q gates can also be a crucial roadblock due to the omnipresence of local minimums (well known in the context of variational quantum algorithms but apparently underappreciated in the context of the variational compiling). Taking the issue seriously, we make an extensive search over the initial conditions an essential part of our approach. Another key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate, and allow a continuous relaxation of the discrete architecture search, which can be executed jointly with the optimization over 1q gates. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice, sometimes even outperforming optimization over 1q gates alone (for fixed optimal architectures). As illustrative examples and applications we derive 8 CNOT and T depth 3 decomposition of the 3q Toffoli gate on the nearest-neighbor topology, rediscover known best decompositions of the 4q Toffoli gate on all 4q topologies including a 1 CNOT gate improvement on the star-shaped topology, and propose decomposition of the 5q Toffoli gate on the nearest-neighbor topology with 48 CNOT gates. We also benchmark the performance of our approach on a number of 5q quantum circuits from the ibm_qx_mapping database showing that it is highly competitive with the existing software. The algorithm developed in this work is available as a Python package CPFlow.

arXiv:2205.01121•Quantum•May 4, 2023•27 citations

Dynamic Quantum Circuit Compilation via Tensor Networks

Jincheng Zhang

Quantum circuit compilation is a crucial step in realizing quantum algorithms on near-term quantum hardware. Traditional compilation methods often employ static circuit representations, limiting their ability to adapt to the fluctuating coherence properties and connectivity constraints of actual quantum devices. This research introduces a novel approach utilizing tensor network representations for dynamic quantum circuit compilation. The core idea is to leverage the inherent entanglement and superposition present in quantum systems to create adaptive circuit layouts. Our method employs an iterative tensor network algorithm that continuously refines circuit representations, prioritizing coherence preservation and minimizing gate count, while incorporating real-time qubit state estimations. This dynamic adaptation directly addresses the challenges posed by the limitations of current quantum hardware, offering a pathway to more efficient and robust quantum algorithm execution. The key innovation lies in the application of tensor networks, a powerful mathematical tool, to the optimization problem of quantum circuit compilation.

•Sep 4, 2026•0 citations

Adapting Developing Quantum Circuit Synthesis with a Multi -objective Quantum- inspired Optimization

Yao–Hsin Chou, Cheng-Yen Hua, Huan-Pu Chen +3 more

It is important to construct quantum algorithms within shallow-depth quantum circuits due to the current imperfections and decoherence in quantum devices. Efficient quantum circuit synthesis and optimization are critical tasks that generate relatively small quantum circuits tailored to specific requirements. However, an efficient circuit may vary depending on the physical realization platforms of quantum computers. For example, the Clifford+T gate library has recently gained prominence for its superior fault tolerance and error correction capabilities, but the T gate dominates circuit execution time. Therefore, the objectives of synthesis algorithms in this gate set include reducing T-depth and T-count, as well as overall circuit depth and gate count. Most traditional synthesis methods produce a single optimized circuit. In contrast, this study introduces a multi-objective quantum-inspired tabu search algorithm in quantum circuit synthesis to construct a diverse set of optimized circuits based on four distinct metrics. The values of these metrics in the optimized circuit display the entanglement relationship, and the proposed method simulates the formula to assist in building the entangled optimal circuit. Results show that the construction of the Pareto front can flexibly offer a variety of functionally equivalent circuits that adapt to advancements in quantum technology. Providing multiple optimized circuit structures facilitates circuit replacement and further simplification, thereby enhancing the development of quantum computing.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•4 citations
In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to transform the discrete combinatorial problem of circuit synthesis into an optimization problem over continuous variables. The circuit is then compressed by a sequential removal of two-qubit gates from the design, while the remaining building blocks are continuously adapted to the reduced gate structure by iterated learning cycles. We implemented the developed algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools. Our numerical experiments revealed outstanding circuit compression capabilities of our compilation algorithm providing the most optimal gate count in the majority of the addressed quantum circuits.
Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.
Combinatorial optimization problems are central to many applications but can be challenging to solve. Quantum approaches such as the Quantum Approximate Optimization Algorithm (QAOA) offer new tools with which to tackle such problems. However, QAOA circuits inherit the interaction structure of the target Hamiltonian, often resulting in deep circuits when compiled onto hardware with limited connectivity. Efficient transpilation is therefore critical to their practical performance. In this work, we propose a transpilation scheme for circuits consisting of blocks of commuting two-qubit gates on two-dimensional lattices. Unlike standard approaches based on random initial mappings and fixed routing, our method alternates between constructing problem-dependent SWAP-layer sequences and updating the qubit layout. By adapting the routing to the required interactions, this yields significantly shorter circuits for graphs with few edges. We benchmark our approach on QAOA instances for Maximum Cut (MC) on Random Regular graphs and Maximum Independent Set (MIS) on Erdős-Rényi graphs. Compared to standard methods, we reduce circuit depth and gate count by about a factor of two, enabling experiments with up to 808080 qubits and improving approximation ratios by up to 6.6%6.6\%6.6% for MC and 9.3%9.3\%9.3% for MIS.
Quantum circuit compilation is a critical step in realizing quantum algorithms on near-term quantum hardware. The process of translating high-level quantum algorithms into low-level gate sequences, while minimizing gate count and circuit depth, is often performed using deterministic algorithms that struggle to adapt to the diverse and often imperfect characteristics of available quantum devices. This paper proposes a novel approach to quantum circuit compilation utilizing reinforcement learning (RL). An RL agent is trained to dynamically adapt to hardware constraints, such as qubit connectivity and gate decomposition costs, optimizing circuit fidelity and execution time. The core claim is that RL can significantly improve quantum circuit compilation by introducing a dynamic and adaptive compilation process. The agent learns a policy that maps high-level quantum algorithms to optimized low-level gate sequences, effectively bridging the gap between theoretical algorithms and practical hardware execution. This work demonstrates the potential of RL to overcome the limitations of traditional deterministic compilation methods and paves the way for more efficient and robust quantum algorithm implementation.
We consider the problem of the variational quantum circuit synthesis into a gate set consisting of the CNOT gate and arbitrary single-qubit (1q) gates with the primary target being the minimization of the CNOT count. First we note that along with the discrete architecture search suffering from the combinatorial explosion of complexity, optimization over 1q gates can also be a crucial roadblock due to the omnipresence of local minimums (well known in the context of variational quantum algorithms but apparently underappreciated in the context of the variational compiling). Taking the issue seriously, we make an extensive search over the initial conditions an essential part of our approach. Another key idea we propose is to use parametrized two-qubit (2q) controlled phase gates, which can interpolate between the identity gate and the CNOT gate, and allow a continuous relaxation of the discrete architecture search, which can be executed jointly with the optimization over 1q gates. This coherent optimization of the architecture together with 1q gates appears to work surprisingly well in practice, sometimes even outperforming optimization over 1q gates alone (for fixed optimal architectures). As illustrative examples and applications we derive 8 CNOT and T depth 3 decomposition of the 3q Toffoli gate on the nearest-neighbor topology, rediscover known best decompositions of the 4q Toffoli gate on all 4q topologies including a 1 CNOT gate improvement on the star-shaped topology, and propose decomposition of the 5q Toffoli gate on the nearest-neighbor topology with 48 CNOT gates. We also benchmark the performance of our approach on a number of 5q quantum circuits from the ibm_qx_mapping database showing that it is highly competitive with the existing software. The algorithm developed in this work is available as a Python package CPFlow.
Quantum circuit compilation is a crucial step in realizing quantum algorithms on near-term quantum hardware. Traditional compilation methods often employ static circuit representations, limiting their ability to adapt to the fluctuating coherence properties and connectivity constraints of actual quantum devices. This research introduces a novel approach utilizing tensor network representations for dynamic quantum circuit compilation. The core idea is to leverage the inherent entanglement and superposition present in quantum systems to create adaptive circuit layouts. Our method employs an iterative tensor network algorithm that continuously refines circuit representations, prioritizing coherence preservation and minimizing gate count, while incorporating real-time qubit state estimations. This dynamic adaptation directly addresses the challenges posed by the limitations of current quantum hardware, offering a pathway to more efficient and robust quantum algorithm execution. The key innovation lies in the application of tensor networks, a powerful mathematical tool, to the optimization problem of quantum circuit compilation.
It is important to construct quantum algorithms within shallow-depth quantum circuits due to the current imperfections and decoherence in quantum devices. Efficient quantum circuit synthesis and optimization are critical tasks that generate relatively small quantum circuits tailored to specific requirements. However, an efficient circuit may vary depending on the physical realization platforms of quantum computers. For example, the Clifford+T gate library has recently gained prominence for its superior fault tolerance and error correction capabilities, but the T gate dominates circuit execution time. Therefore, the objectives of synthesis algorithms in this gate set include reducing T-depth and T-count, as well as overall circuit depth and gate count. Most traditional synthesis methods produce a single optimized circuit. In contrast, this study introduces a multi-objective quantum-inspired tabu search algorithm in quantum circuit synthesis to construct a diverse set of optimized circuits based on four distinct metrics. The values of these metrics in the optimized circuit display the entanglement relationship, and the proposed method simulates the formula to assist in building the entangled optimal circuit. Results show that the construction of the Pareto front can flexibly offer a variety of functionally equivalent circuits that adapt to advancements in quantum technology. Providing multiple optimized circuit structures facilitates circuit replacement and further simplification, thereby enhancing the development of quantum computing.