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:2010.00629 · Quantum Science and Technology

Adaptive pruning-based optimization of parameterized quantum circuits

Sukin Sim, Jonathan Romero, Jérôme F. Gonthier, Alexander A. Kunitsa

Published Jan 28, 2021• 76 citations
arXivHTMLPDF

Abstract

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

DOI
10.1088/2058-9565/abe107

Related papers

Quantum Circuit Architecture Optimization for Variational Quantum Eigensolver via Monto Carlo Tree Search

Fan‐Xu Meng, Ze‐Tong Li, Xutao Yu +1 more

The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•27 citations

Offline Quantum Circuit Pruning for Quantum Chemical Calculations

Satoshi Imamura, Akihiko Kasagi, Eiji Yoshida

A variational quantum eigensolver (VQE) designed for noisy intermediate-scale quantum (NISQ) computers is a promising hybrid quantum-classical algorithm for quantum chemical calculations (QCC). Its accuracy and computational cost strongly depend on an ansatz, and unitary coupled-cluster (UCC) ansatze are well-known chemistry-inspired ansatze that can achieve a high accuracy for QCC. However, UCC-based quantum circuits have a high depth and a lot of 2-qubit controlled NOT (CNOT) gates which are sensitive to noises, leading to the low accuracy of VQE running on NISQ computers. To address this issue, we propose a novel offline quantum circuit pruning technique that reduces the number of CNOT gates and depth of UCC-based quantum circuits by reducing the number of excitation operators per parameter to a user-specified value. It is applied only once before VQE is executed (i.e., offline), which is the advantage over state-of-the-art quantum circuit pruning techniques. The evaluation using a quantum computer simulator with a noise model based on a real NISQ device shows that our offline pruning technique improves the accuracy of UCCSD-VQE while sustaining the potential accuracy of the UCCSD ansatz and has a synergy with a well-known noise mitigation method called zero noise extrapolation (ZNE).

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

Thermal Noise Mitigation Algorithms for Quantum Enhanced Neural Network Training

P. Sagayaraj, Dr.G.H Kerinab Beenu, M Vinitha +1 more

Although quantum computers will not necessarily transform ML in general, they hold immense potential for specific uses, such as dealing with high-dimensional data and complex correlations that cannot be effectively modeled using classical systems. It is, however, difficult to design efficient quantum circuits, especially with the existing Noisy Intermediate-Scale Quantum (NISQ) hardware that has constraints including decoherence, a limited number of qubits, and gate fidelity limitations. The authors propose an Adaptive Quantum Circuit Architecture Search (AQCAS) framework whose structure and parameters are optimized dynamically to improve the performance of the task-specific ML. The framework integrates quantum circuit encoding, a hybrid search strategy that is based on reinforcement learning and evolutionary algorithms, and a task-specific adaptivity mechanism. Benchmark datasets were used for experimental evaluations of both simulation using Qiskit Aer and classical optimization using the Python frameworks TensorFlow and PennyLane. Fixed and standard variational quantum circuits were compared with performance measurements like the classification accuracy, circuit depth, convergence speed, and computational efficiency. The results show that the accuracy of AQCAS can be raised to 94.1%, and the circuit depth is lowered at the same time. It converged rapidly and is computationally efficient. Ablation studies show that both hybrid search and adaptivity mechanisms help to enhance generalization and stability under NISQ constraints. The results demonstrate the potential of AQCAS as a practical approach to using adaptive quantum circuits in specialized ML applications, and lay the groundwork for future development of scaling to larger devices, implementing noise-aware optimization, and integrating with hybrid quantum-classical ML pipelines.

International Journal of Artificial Intelligence and Machine Learning•May 24, 2026•0 citations

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Yi Fan, Changsu Cao, Xusheng Xu +3 more

Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.

arXiv:2106.15210•The Journal of Physical Chemistry Letters•Oct 20, 2023•38 citations

Variational Ansatz preparation to avoid CNOT-gates on noisy quantum devices for combinatorial optimizations

Tsukasa Miki, Ryo Okita, Moe Shimada +2 more

The variational quantum eigensolver (VQE), which is a quantum–classical hybrid approach, has latent powers to leverage near-term quantum devices by effectively managing a limited number of qubits with finite coherent lifetimes. While it is generally argued that the quantum approximate optimization algorithm (QAOA), which is a special case of VQE with a variational Ansatz based on the adiabatic theorem, may enable practical applications of noisy quantum devices for classical combinatorial optimizations, the strategy to improve the performance of this algorithm by increasing the circuit depth conflicts with the limited coherence time of near-term quantum devices. Here, we introduce strategies involving the VQE to reduce the circuit resources required for solving combinatorial optimizations. Our concept of a parameterized quantum circuit allows the Ansatz preparation to be achieved by only single-qubit operation. We find that the variational Ansatz without controlled X-gates leads to quick convergence in a classical subroutine used to determine the variational parameters. In addition, the variational Ansatz with optimized parameters maintains performance over the problem sizes both on the numerical simulation and IBM 27-qubit processor “ibm_kawasaki.” Therefore, the variational Ansatz introduced in this study has several advantages considering the total calculation time and performance scaling over the problem sizes. We also show that the variational Ansatz consisting of a lower number of gate operations than that of QAOA can approximate the eigenstates of diagonal Hamiltonians with high accuracy. We illustrate our ideas with a maximum-cut problem and show that near-term quantum applications may be feasible using short-depth circuits.

AIP Advances•Mar 1, 2022•16 citations

Efficient Optimization of Variational Quantum Algorithms via Gradient-Free Parameter Prediction

Satwik Kundu, Debarshi Kundu, Swaroop Ghosh

The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.

arXiv:2307.12449•IEEE Access•Jan 1, 2026•2 citations
Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).
The advent of Noisy Intermediate-Scale Quantum (NISQ) devices provides crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous Variational Quantum Eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish the task. However, VQE also suffers from some serious challenges, which are training difficulty and accuracy reduction due to deep quantum circuit and hardware noise. To be motivated by these issues, we propose a runtime and resource efficient scheme, monto-carlo tree (MCT) search based quantum circuit architecture optimization, where the ansatz is built in the variable form. Our approach first models the search space with a MCT and regards it as a supernet, where we make use of layers dependence to reduce the size of the search space . Second, a two-stage scheme is proposed for the search space training where weight sharing and warm-up strategies are employed to avoid huge computation cost. Training results are stored in nodes of the MCT for future decisions and a hierarchical node selection is presented to obtain an optimal ansatz. As a proof of principle, we carry out a series of numerical experiments for condensed matter and quantum chemistry in the quantum simulator with and without noise. Consequently, our scheme can be efficient to mitigate trainability and accuracy issues by minimizing the ansatz depth and the number of entanglement gates.
A variational quantum eigensolver (VQE) designed for noisy intermediate-scale quantum (NISQ) computers is a promising hybrid quantum-classical algorithm for quantum chemical calculations (QCC). Its accuracy and computational cost strongly depend on an ansatz, and unitary coupled-cluster (UCC) ansatze are well-known chemistry-inspired ansatze that can achieve a high accuracy for QCC. However, UCC-based quantum circuits have a high depth and a lot of 2-qubit controlled NOT (CNOT) gates which are sensitive to noises, leading to the low accuracy of VQE running on NISQ computers. To address this issue, we propose a novel offline quantum circuit pruning technique that reduces the number of CNOT gates and depth of UCC-based quantum circuits by reducing the number of excitation operators per parameter to a user-specified value. It is applied only once before VQE is executed (i.e., offline), which is the advantage over state-of-the-art quantum circuit pruning techniques. The evaluation using a quantum computer simulator with a noise model based on a real NISQ device shows that our offline pruning technique improves the accuracy of UCCSD-VQE while sustaining the potential accuracy of the UCCSD ansatz and has a synergy with a well-known noise mitigation method called zero noise extrapolation (ZNE).
Although quantum computers will not necessarily transform ML in general, they hold immense potential for specific uses, such as dealing with high-dimensional data and complex correlations that cannot be effectively modeled using classical systems. It is, however, difficult to design efficient quantum circuits, especially with the existing Noisy Intermediate-Scale Quantum (NISQ) hardware that has constraints including decoherence, a limited number of qubits, and gate fidelity limitations. The authors propose an Adaptive Quantum Circuit Architecture Search (AQCAS) framework whose structure and parameters are optimized dynamically to improve the performance of the task-specific ML. The framework integrates quantum circuit encoding, a hybrid search strategy that is based on reinforcement learning and evolutionary algorithms, and a task-specific adaptivity mechanism. Benchmark datasets were used for experimental evaluations of both simulation using Qiskit Aer and classical optimization using the Python frameworks TensorFlow and PennyLane. Fixed and standard variational quantum circuits were compared with performance measurements like the classification accuracy, circuit depth, convergence speed, and computational efficiency. The results show that the accuracy of AQCAS can be raised to 94.1%, and the circuit depth is lowered at the same time. It converged rapidly and is computationally efficient. Ablation studies show that both hybrid search and adaptivity mechanisms help to enhance generalization and stability under NISQ constraints. The results demonstrate the potential of AQCAS as a practical approach to using adaptive quantum circuits in specialized ML applications, and lay the groundwork for future development of scaling to larger devices, implementing noise-aware optimization, and integrating with hybrid quantum-classical ML pipelines.
Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.
The variational quantum eigensolver (VQE), which is a quantum–classical hybrid approach, has latent powers to leverage near-term quantum devices by effectively managing a limited number of qubits with finite coherent lifetimes. While it is generally argued that the quantum approximate optimization algorithm (QAOA), which is a special case of VQE with a variational Ansatz based on the adiabatic theorem, may enable practical applications of noisy quantum devices for classical combinatorial optimizations, the strategy to improve the performance of this algorithm by increasing the circuit depth conflicts with the limited coherence time of near-term quantum devices. Here, we introduce strategies involving the VQE to reduce the circuit resources required for solving combinatorial optimizations. Our concept of a parameterized quantum circuit allows the Ansatz preparation to be achieved by only single-qubit operation. We find that the variational Ansatz without controlled X-gates leads to quick convergence in a classical subroutine used to determine the variational parameters. In addition, the variational Ansatz with optimized parameters maintains performance over the problem sizes both on the numerical simulation and IBM 27-qubit processor “ibm_kawasaki.” Therefore, the variational Ansatz introduced in this study has several advantages considering the total calculation time and performance scaling over the problem sizes. We also show that the variational Ansatz consisting of a lower number of gate operations than that of QAOA can approximate the eigenstates of diagonal Hamiltonians with high accuracy. We illustrate our ideas with a maximum-cut problem and show that near-term quantum applications may be feasible using short-depth circuits.
The exponential runtime of quantum simulators on classical machines, along with long queue times and high costs associated with real quantum devices, presents significant challenges for the efficient optimization of Variational Quantum Algorithms (VQAs) such as the Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Quantum Neural Networks (QNNs). To address these limitations, we propose a novel approach, DyPP (Dynamic Parameter Prediction), which accelerates the convergence of VQAs by leveraging regular trends in the parameter weights to update parameters efficiently. We introduce two techniques for optimal prediction performance: Naive Prediction (NaP) and Adaptive Prediction (AdaP). Through extensive experimentation and training of multiple QNN models on various datasets, we demonstrate that DyPP achieves a speedup of approximately 2.25×compared to standard training methods, while also providing improved accuracy (up to 2.3% higher) and lower loss (up to 6.1% reduction) with minimal storage and computational overhead. We further evaluate DyPP’s effectiveness in VQE for molecular ground-state energy estimation and in QAOA for graph MaxCut. Our results show that, on average, DyPP leads to a speedup of up to 3.1× for VQE and 2.91× for QAOA compared to traditional optimization, while requiring up to 3.3× fewer shots (i.e., repeated circuit executions). Even in the presence of hardware noise, DyPP outperforms existing optimization techniques, delivering up to 3.33× speedup and requiring 2.5× fewer shots, thereby enhancing the efficiency of VQAs.