Enhancing Hybrid Methods in Parameterized Quantum Circuit Optimization

• URL: http://arxiv.org/abs/2510.08142v1
• Date: Thu, 09 Oct 2025 12:24:57 GMT
• Title: Enhancing Hybrid Methods in Parameterized Quantum Circuit Optimization
• Authors: Joona V. Pankkonen, Matti Raasakka, Andrea Marchesin, Ilkka Tittonen,
• Abstract summary: Quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy quantum devices.<n>We introduce two new hybrid algorithms that are more robust and scalable.<n>We find that they are feasible for NISQ devices with different noise profiles.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.

Related papers

• Quantum Random Feature Method for Solving Partial Differential Equations [36.58357595906332]
  Quantum computing holds promise for scientific computing due to its potential for exponential speedups over classical methods.<n>In this work, we introduce a quantum random method (QRFM) that leverages advantages from both numerical analysis and neural analysis.
  arXiv  Detail & Related papers  (2025-10-09T08:42:09Z)
• Improving Variational Quantum Circuit Optimization via Hybrid Algorithms and Random Axis Initialization [0.0]
  Variational quantum circuits (VQCs) are an essential tool in applying noisy intermediate-scale quantum computers to practical problems.<n>We enhance the performance of the Rotosolve method, a gradient-free optimization algorithm specifically designed for VQCs.<n>We construct hybrid algorithms that benefit from the rapid initial convergence of Rotosolve while leveraging the superior expressivity of FQS.
  arXiv  Detail & Related papers  (2025-03-26T17:10:19Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• TopGen: Topology-Aware Bottom-Up Generator for Variational Quantum Circuits [26.735857677349628]
  Variational Quantum Algorithms (VQA) are promising to demonstrate quantum advantages on near-term devices. Designing ansatz, a variational circuit with parameterized gates, is of paramount importance for VQA. We propose a bottom-up approach to generate topology-specific ansatz.
  arXiv  Detail & Related papers  (2022-10-15T04:18:41Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Meta-Learning Digitized-Counterdiabatic Quantum Optimization [3.0638256603183054]
  We tackle the problem of finding suitable initial parameters for variational optimization by employing a meta-learning technique using recurrent neural networks. We investigate this technique with the recently proposed digitized-counterdiabatic quantum approximate optimization algorithm (DC-QAOA) The combination of meta learning and DC-QAOA enables us to find optimal initial parameters for different models, such as MaxCut problem and the Sherrington-Kirkpatrick model.
  arXiv  Detail & Related papers  (2022-06-20T18:57:50Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Performance comparison of optimization methods on variational quantum algorithms [2.690135599539986]
  Variational quantum algorithms (VQAs) offer a promising path towards using near-term quantum hardware for applications in academic and industrial research. We study the performance of four commonly used gradient-free optimization methods: SLSQP, COBYLA, CMA-ES, and SPSA.
  arXiv  Detail & Related papers  (2021-11-26T12:13:20Z)
• A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver [0.0]
  Variational Hybrid Quantum Classical Algorithms (VHQCAs) are a class of quantum algorithms intended to run on noisy quantum devices. These algorithms employ a parameterized quantum circuit (ansatz) and a quantum-classical feedback loop. A classical device is used to optimize the parameters in order to minimize a cost function that can be computed far more efficiently on a quantum device.
  arXiv  Detail & Related papers  (2021-06-16T10:40:00Z)
• Classically optimal variational quantum algorithms [0.0]
  Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQA), are suitable for implementation on NISQ computers. In this Letter we expand an implicit step of VQAs: the classical pre-computation subroutine which can non-trivially use classical algorithms to simplify, transform, or specify problem instance-specific variational quantum circuits.
  arXiv  Detail & Related papers  (2021-03-31T13:33:38Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.