Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems
arXiv:2407.02569 · doi:10.1140/epjqt/s40507-025-00452-0
Abstract
Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start method inspired by imaginary time evolution, allowing for determining initial parameters that prioritize lower energy states in a resource-efficient way. Using classical simulations, we demonstrate that this warm start method significantly improves the success rate and reduces the number of iterations required for the convergence of VQE. The numerical results also indicate that the warm start approach effectively mitigates statistical errors arising from a finite number of measurements, and to a certain extent alleviates the effect of barren plateaus.
References in corpus (24)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Dynamical suppression of decoherence in two-state quantum systems
- The Variational Quantum Eigensolver: a review of methods and best practices
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Variational ansatz-based quantum simulation of imaginary time evolution
- Theory of variational quantum simulation
- Optimal Quantum Circuits for General Two-Qubit Gates
- Warm-starting quantum optimization
- Improving Variational Quantum Optimization using CVaR
- Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
- Model-free readout-error mitigation for quantum expectation values
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- On the representation of Boolean and real functions as Hamiltonians for quantum computing
- A case study of variational quantum algorithms for a job shop scheduling problem
- Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction
- Mitigating Coherent Noise Using Pauli Conjugation
- Quantum variational optimization: The role of entanglement and problem hardness
- Challenges of variational quantum optimization with measurement shot noise
- Error-resilient Monte Carlo quantum simulation of imaginary time