Theoretical Guarantees of Variational Quantum Algorithm with Guiding States

• URL: http://arxiv.org/abs/2510.06764v1
• Date: Wed, 08 Oct 2025 08:45:22 GMT
• Title: Theoretical Guarantees of Variational Quantum Algorithm with Guiding States
• Authors: Tuyen Nguyen, Mária Kieferová,
• Abstract summary: Variational quantum algorithms (VQAs) are prominent candidates for near-term quantum advantage but lack rigorous guarantees of convergence and generalization.<n>We introduce a variational quantum algorithm with guiding states aiming towards predicting ground-state properties of quantum many-body systems.<n>We show that guiding states accelerate convergence, suppress finite-size error terms, and ensure stability across system dimensions.
• Score: 0.007269363911173491
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) are prominent candidates for near-term quantum advantage but lack rigorous guarantees of convergence and generalization. By contrast, quantum phase estimation (QPE) provides provable performance under the guiding state assumption, where access to a state with non-trivial overlap with the ground state enables efficient energy estimation. In this work, we ask whether similar guarantees can be obtained for VQAs. We introduce a variational quantum algorithm with guiding states aiming towards predicting ground-state properties of quantum many-body systems. We then develop a proof technique-the linearization trick-that maps the training dynamics of the algorithm to those of a kernel model. This connection yields the first theoretical guarantees on both convergence and generalization for the VQA under the guiding state assumption. Our analysis shows that guiding states accelerate convergence, suppress finite-size error terms, and ensure stability across system dimensions. Finally, we validate our findings with numerical experiments on 2D random Heisenberg models.

Related papers

• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• On the convergence of the variational quantum eigensolver and quantum optimal control [0.0]
  We develop a convergence theory for the variational quantum eigensolver (VQE)<n>We prove a sufficient criterion that characterizes when convergence to a ground state of a Hamiltonian can be guaranteed.<n>We analyze two commonly employed families of quantum circuit ans"atze.
  arXiv  Detail & Related papers  (2025-09-05T17:59:44Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• Grassmann Variational Monte Carlo with neural wave functions [45.935798913942904]
  We formalize the framework introduced by Pfau et al.citepfau2024accurate in terms of Grassmann geometry of the Hilbert space.<n>We validate our approach on the Heisenberg quantum spin model on the square lattice, achieving highly accurate energies and physical observables for a large number of excited states.
  arXiv  Detail & Related papers  (2025-07-14T13:53:13Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Certifying steady-state properties of open quantum systems [0.0]
  Estimating the steady-state properties of open many-body quantum systems is a fundamental challenge in quantum science.<n>We present a scalable approach based on semi-definite programming to derive certified bounds.<n>Our method introduces the first general numerical tool for bounding steady-state properties of open quantum dynamics.
  arXiv  Detail & Related papers  (2024-10-17T15:13:12Z)
• A Quantum States Preparation Method Based on Difference-Driven Reinforcement Learning [7.595208396761107]
  This paper proposes a difference-driven reinforcement learning algorithm for quantum state preparation of two-qubit system. It has different degrees of improvement in convergence speed and fidelity of the final quantum state.
  arXiv  Detail & Related papers  (2023-09-29T04:42:11Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers [0.5608803995383594]
  We propose methods to initialize on a gate-based quantum computer a general class of quantum spin wave functions. VBS states are the exact ground states of a class of interacting quantum spin models introduced by Affleck, Kennedy, Lieb and Tasaki. We find that schemes to prepare VBS states based on their tensor-network representations yield quantum circuits that are too deep to be within reach of noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2022-07-15T19:40:15Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Improving the accuracy and efficiency of quantum connected moments expansions [4.9834612867114965]
  In quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous. Here we use the ADAPT-VQE algorithm to test shallow circuit construction strategies.
  arXiv  Detail & Related papers  (2021-03-16T15:13:40Z)

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.