Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Abstract

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation (EC) to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver (VQE). By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

20 pages, 20 figures

References in corpus (50)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Scalable Quantum Simulation of Molecular Energies
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Computational Studies of Quantum Spin Systems
• A Theory of Trotter Error
• Information transmission through a noisy quantum channel
• Simulating Physical Phenomena by Quantum Networks
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Efficient learning of quantum noise
• Real- and imaginary-time evolution with compressed quantum circuits
• Hardware-efficient variational quantum algorithms for time evolution
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• A Non-Orthogonal Variational Quantum Eigensolver
• Eigenvector continuation with subspace learning
• Modelling and Simulating the Noisy Behaviour of Near-term Quantum Computers
• Digital Quantum Simulation of Spin Systems in Superconducting Circuits
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Eigenvector Continuation as an Efficient and Accurate Emulator for Uncertainty Quantification
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Simulating Quantum Materials with Digital Quantum Computers
• Quantum simulation of electronic structure with a transcorrelated Hamiltonian: improved accuracy with a smaller footprint on the quantum computer
• Towards adiabatic quantum computing using compressed quantum circuits
• A theory of quantum subspace diagonalization
• Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• The mother of all states of the kagome quantum antiferromagnet
• Quantum computation of magnon spectra
• Eigenvector Continuation and Projection-Based Emulators
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
• The ground-state phase diagram of the XXZ spin-s kagome antiferromagnet: A coupled-cluster study
• Real-Time Krylov Theory for Quantum Computing Algorithms
• Finite-size and finite bond dimension effects of tensor network renormalization
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• Self-healing of Trotter error in digital adiabatic state preparation
• On Circuit Depth Scaling For Quantum Approximate Optimization
• Schrödinger-Heisenberg Variational Quantum Algorithms
• Surrogate models for quantum spin systems based on reduced order modeling
• Volume extrapolation via eigenvector continuation
• Analysis of quantum Krylov algorithms with errors
• Simulating noisy quantum channels via quantum state preparation algorithms
• Measurement-efficient quantum Krylov subspace diagonalisation
• Quantum Eigenvector Continuation for Chemistry Applications
• Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
• Quantum subspace expansion in the presence of hardware noise