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.08514

Recursive Variational Quantum Compiling

Stian D. Bilek, Kristian Wold

Published Mar 16, 2022• 11 citations
arXivHTMLPDF

Abstract

Variational quantum compiling (VQC) algorithms aim to approximate deep quantum circuits with shallow parameterized ansatzes, making them more suitable for NISQ hardware. In this article a variant of VQC named the recursive variational quantum compiling (RVQC) algorithm is proposed. Existing VQC algorithms typically require coherently executing the full circuit during compilation. Under the influence of noise, sufficiently deep target circuits make compiling unfeasible using ordinary VQC. Since the compiling is often accomplished using a gradient-based quantum-classical approach, the quantum noise manifest as a noisy gradient during optimization, making convergence hard to obtain. On the other hand, RVQC can compile a circuit by first dividing it into $N$ shorter sub-circuits, then evaluate one sub-circuit at a time. As a result, the circuit depth required to implement RVQC is not dependent on the depth of the target circuit, but on the depth of the sub-circuits. Choosing a high enough $N$ thus ensures sufficiently shallow sub-circuit which can be successfully compiled individually. We show mathematical evidence of this property. RVQC was compared with VQC on a noise model of the IBM Santiago device with the goal of compiling several randomly generated five-qubit circuits of approximately depth 1000. It was shown that VQC was not able to converge within 500 iterations of optimization. On the other hand, RVQC was able to converge to a fidelity of $0.90 \pm 0.05$ within a total of 500 iterations when splitting the target circuits into $N = 5$ parts. We argue that this comes as a result of the mitigation of noise-induced barren plateaus.

DOI
10.48550/arxiv.2203.08514

Related papers

Variational quantum compiling with double Q-learning

Zhimin He, Lvzhou Li, Shenggen Zheng +2 more

Abstract Quantum compiling aims to construct a quantum circuitVby quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitaryU. It is a crucial stage for the running of quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. However, the space for structure exploration of quantum circuit is enormous, resulting in the requirement of human expertise, hundreds of experimentations or modifications from existing quantum circuits. In this paper, we propose a variational quantum compiling (VQC) algorithm based on reinforcement learning, in order to automatically design the structure of quantum circuit for VQC with no human intervention. An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by doubleQ-learning withϵ-greedy exploration strategy and experience replay. At first, the agent randomly explores a number of quantum circuits with different structures, and then iteratively discovers structures with higher performance on the learning task. Simulation results show that the proposed method can make exact compilations with less quantum gates compared to previous VQC algorithms. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices, and enable quantum algorithms especially for complex algorithms to be executed within coherence time.

arXiv:2103.11611•New Journal of Physics•Mar 1, 2021•53 citations

Error-Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis

Sharu Theresa Jose, Osvaldo Simeone

Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy intermediate-scale quantum (NISQ) processors. Such systems leverage classical optimization to tune the parameters of a parameterized quantum circuit (PQC). The goal is minimizing a cost function that depends on measurement outputs obtained from the PQC. Optimization is typically implemented via stochastic gradient descent (SGD). On NISQ computers, gate noise due to imperfections and decoherence affects the stochastic gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits, but they in turn cause an increase in the variance of the gradient estimates. This work studies the impact of quantum gate noise on the convergence of SGD for the variational eigensolver (VQE), a fundamental instance of VQAs. The main goal is ascertaining conditions under which QEM can enhance the performance of SGD for VQEs. It is shown that quantum gate noise induces a nonzero error-floor on the convergence error of SGD (evaluated with respect to a reference noiseless PQC), which depends on the number of noisy gates, the strength of the noise, as well as the eigenspectrum of the observable being measured and minimized. In contrast, with QEM, any arbitrarily small error can be obtained. Furthermore, for error levels attainable with or without QEM, QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently large, and a sufficiently large number of measurements is allowed at each SGD iteration. Numerical examples for a max-cut problem corroborate the main theoretical findings.

arXiv:2209.11514•IEEE Transactions on Quantum Engineering•Jan 1, 2022•21 citations

Adaptive Quantum Circuit Compilation for Variational Quantum Algorithms

Jincheng Zhang

Variational quantum algorithms (VQAs) hold significant promise for solving complex problems across diverse fields. However, their practical implementation on near-term quantum devices is severely hampered by the pervasive effects of quantum noise. Traditional quantum circuit compilation techniques are largely static, failing to account for the unique noise profiles inherent in individual quantum hardware. This paper introduces a novel adaptive quantum circuit compilation framework designed to mitigate these limitations. The core concept centers around dynamically adjusting the circuit layout and gate decomposition in real-time, leveraging measurements of the quantum hardware's noise characteristics to optimize both the accuracy and circuit depth of the compiled quantum circuit. This approach represents a critical step towards unlocking the full potential of VQAs by enabling them to effectively operate within the constraints of noisy quantum computers. The framework incorporates feedback loops for continuous refinement, adapting to evolving noise conditions. The methodology is described, focusing on the key components: noise profiling, adaptive gate decomposition, and circuit re-optimization. Simulation results demonstrate the effectiveness of the adaptive approach in reducing circuit depth and improving the fidelity of VQA computations compared to static compilation methods. This work lays the foundation for robust and efficient VQA execution on future quantum hardware.

•Sep 2, 2026•0 citations

Implementation of Quantum Deep Reinforcement Learning Using Variational Quantum Circuits

S Lokes, C. Sakthi Jay Mahenthar, S Parvatha Kumaran +2 more

With the evolution of technology, the need to solve complex computational problems like machine learning and deep learning has shot up. However, even the most powerful classical supercomputers find it difficult to execute these tasks. Advancements in quantum computing are leading researchers and tech-giants who strive for better quantum circuits to do machine learning tasks. Current works on Quantum Machine Learning (QML) ensure less memory consumption and reduced model parameters. However, it is strenuous to simulate the classical deep learning approach on existing quantum computing devices due to the inflexibility of Deep quantum circuits. Consequently, designing viable quantum algorithms for QML for noisy intermediate-scale quantum (NISQ) devices is essential. The proposed work aims to explore Variational Quantum Circuits (VQC) for Deep Q network-based Reinforcement Learning by remodeling the target network and experience replay into a representation of VQC. In addition, to the reduction in model parameters, quantum information encoding schemes are used to achieve better results than classical neural networks. VQCs are employed for policyselection and decision-making reinforcement learning by approximating the deep Q-value function with target network and experience replay.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Oct 13, 2022•21 citations

Variational Quantum Circuits Design Principles, Applications, and Challenges Toward Practical: A Review

Dian Arif Rachman, Muhamad Akrom

Variational Quantum Circuits (VQCs) have emerged as a cornerstone of hybrid quantum–classical algorithms designed to harness the computational potential of near-term quantum devices. By combining parameterized quantum gates with classical optimization, VQCs provide a flexible framework for tackling machine learning, chemistry, and optimization problems intractable for classical methods. This review comprehensively overviews VQC design principles, ansatz structures, optimization strategies, and real-world applications. Furthermore, we discuss fundamental challenges such as barren plateaus, the expressibility–trainability trade-off, and current noisy intermediate-scale quantum (NISQ) hardware limitations. Finally, we highlight emerging directions that could enable scalable, noise-resilient, and physically interpretable variational quantum models for future quantum computing applications

Journal of Multiscale Materials Informatics•Nov 21, 2025•2 citations

Quantum-assisted quantum compiling

Sumeet Khatri, Ryan LaRose, Alexander Poremba +3 more

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap T r ( V † U ) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

arXiv:1807.00800•Quantum•May 13, 2019•413 citations
Variational quantum compiling (VQC) algorithms aim to approximate deep quantum circuits with shallow parameterized ansatzes, making them more suitable for NISQ hardware. In this article a variant of VQC named the recursive variational quantum compiling (RVQC) algorithm is proposed. Existing VQC algorithms typically require coherently executing the full circuit during compilation. Under the influence of noise, sufficiently deep target circuits make compiling unfeasible using ordinary VQC. Since the compiling is often accomplished using a gradient-based quantum-classical approach, the quantum noise manifest as a noisy gradient during optimization, making convergence hard to obtain. On the other hand, RVQC can compile a circuit by first dividing it into NNN shorter sub-circuits, then evaluate one sub-circuit at a time. As a result, the circuit depth required to implement RVQC is not dependent on the depth of the target circuit, but on the depth of the sub-circuits. Choosing a high enough NNN thus ensures sufficiently shallow sub-circuit which can be successfully compiled individually. We show mathematical evidence of this property. RVQC was compared with VQC on a noise model of the IBM Santiago device with the goal of compiling several randomly generated five-qubit circuits of approximately depth 1000. It was shown that VQC was not able to converge within 500 iterations of optimization. On the other hand, RVQC was able to converge to a fidelity of 0.90±0.050.90 \pm 0.050.90±0.05 within a total of 500 iterations when splitting the target circuits into N=5N = 5N=5 parts. We argue that this comes as a result of the mitigation of noise-induced barren plateaus.
Abstract Quantum compiling aims to construct a quantum circuitVby quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitaryU. It is a crucial stage for the running of quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. However, the space for structure exploration of quantum circuit is enormous, resulting in the requirement of human expertise, hundreds of experimentations or modifications from existing quantum circuits. In this paper, we propose a variational quantum compiling (VQC) algorithm based on reinforcement learning, in order to automatically design the structure of quantum circuit for VQC with no human intervention. An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by doubleQ-learning withϵ-greedy exploration strategy and experience replay. At first, the agent randomly explores a number of quantum circuits with different structures, and then iteratively discovers structures with higher performance on the learning task. Simulation results show that the proposed method can make exact compilations with less quantum gates compared to previous VQC algorithms. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices, and enable quantum algorithms especially for complex algorithms to be executed within coherence time.
Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy intermediate-scale quantum (NISQ) processors. Such systems leverage classical optimization to tune the parameters of a parameterized quantum circuit (PQC). The goal is minimizing a cost function that depends on measurement outputs obtained from the PQC. Optimization is typically implemented via stochastic gradient descent (SGD). On NISQ computers, gate noise due to imperfections and decoherence affects the stochastic gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits, but they in turn cause an increase in the variance of the gradient estimates. This work studies the impact of quantum gate noise on the convergence of SGD for the variational eigensolver (VQE), a fundamental instance of VQAs. The main goal is ascertaining conditions under which QEM can enhance the performance of SGD for VQEs. It is shown that quantum gate noise induces a nonzero error-floor on the convergence error of SGD (evaluated with respect to a reference noiseless PQC), which depends on the number of noisy gates, the strength of the noise, as well as the eigenspectrum of the observable being measured and minimized. In contrast, with QEM, any arbitrarily small error can be obtained. Furthermore, for error levels attainable with or without QEM, QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently large, and a sufficiently large number of measurements is allowed at each SGD iteration. Numerical examples for a max-cut problem corroborate the main theoretical findings.
Variational quantum algorithms (VQAs) hold significant promise for solving complex problems across diverse fields. However, their practical implementation on near-term quantum devices is severely hampered by the pervasive effects of quantum noise. Traditional quantum circuit compilation techniques are largely static, failing to account for the unique noise profiles inherent in individual quantum hardware. This paper introduces a novel adaptive quantum circuit compilation framework designed to mitigate these limitations. The core concept centers around dynamically adjusting the circuit layout and gate decomposition in real-time, leveraging measurements of the quantum hardware's noise characteristics to optimize both the accuracy and circuit depth of the compiled quantum circuit. This approach represents a critical step towards unlocking the full potential of VQAs by enabling them to effectively operate within the constraints of noisy quantum computers. The framework incorporates feedback loops for continuous refinement, adapting to evolving noise conditions. The methodology is described, focusing on the key components: noise profiling, adaptive gate decomposition, and circuit re-optimization. Simulation results demonstrate the effectiveness of the adaptive approach in reducing circuit depth and improving the fidelity of VQA computations compared to static compilation methods. This work lays the foundation for robust and efficient VQA execution on future quantum hardware.
With the evolution of technology, the need to solve complex computational problems like machine learning and deep learning has shot up. However, even the most powerful classical supercomputers find it difficult to execute these tasks. Advancements in quantum computing are leading researchers and tech-giants who strive for better quantum circuits to do machine learning tasks. Current works on Quantum Machine Learning (QML) ensure less memory consumption and reduced model parameters. However, it is strenuous to simulate the classical deep learning approach on existing quantum computing devices due to the inflexibility of Deep quantum circuits. Consequently, designing viable quantum algorithms for QML for noisy intermediate-scale quantum (NISQ) devices is essential. The proposed work aims to explore Variational Quantum Circuits (VQC) for Deep Q network-based Reinforcement Learning by remodeling the target network and experience replay into a representation of VQC. In addition, to the reduction in model parameters, quantum information encoding schemes are used to achieve better results than classical neural networks. VQCs are employed for policyselection and decision-making reinforcement learning by approximating the deep Q-value function with target network and experience replay.
Variational Quantum Circuits (VQCs) have emerged as a cornerstone of hybrid quantum–classical algorithms designed to harness the computational potential of near-term quantum devices. By combining parameterized quantum gates with classical optimization, VQCs provide a flexible framework for tackling machine learning, chemistry, and optimization problems intractable for classical methods. This review comprehensively overviews VQC design principles, ansatz structures, optimization strategies, and real-world applications. Furthermore, we discuss fundamental challenges such as barren plateaus, the expressibility–trainability trade-off, and current noisy intermediate-scale quantum (NISQ) hardware limitations. Finally, we highlight emerging directions that could enable scalable, noise-resilient, and physically interpretable variational quantum models for future quantum computing applications
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitary U and a trainable unitary V as the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlap T r ( V † U ) but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.