A Non-Orthogonal Variational Quantum Eigensolver

Abstract

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H${}_4$ and the $\pi$-system of Hexatriene (C${}_6$H${}_8$).

References in corpus (28)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Simulated Quantum Computation of Molecular Energies
• Error mitigation for short-depth quantum circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Evaluating analytic gradients on quantum hardware
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Extending the computational reach of a noisy superconducting quantum processor
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Robust determination of molecular spectra on a quantum processor
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Error-mitigated digital quantum simulation
• Low-cost error mitigation by symmetry verification
• Is the Trotterized UCCSD Ansatz chemically well-defined?
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Decoding quantum errors with subspace expansions
• Quantum circuits cannot control unknown operations
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• Multi-component symmetry-projected approach for molecular ground state correlations
• Quantum inverse iteration algorithm for programmable quantum simulators
• Compact wavefunctions from compressed imaginary time evolution

Cited by in corpus (94)

• Variational Quantum Algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• The Variational Quantum Eigensolver: a review of methods and best practices
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• A Quantum Computing View on Unitary Coupled Cluster Theory
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Emerging quantum computing algorithms for quantum chemistry
• Fermionic partial tomography via classical shadows
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Orbital optimized unitary coupled cluster theory for quantum computer
• Algorithms for quantum simulation at finite energies
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Quantum Power Method by a Superposition of Time-Evolved States
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• The Meta-Variational Quantum Eigensolver (Meta-VQE): Learning energy profiles of parameterized Hamiltonians for quantum simulation
• Exact and efficient Lanczos method on a quantum computer
• A state-averaged orbital-optimized hybrid quantum-classical algorithm for a democratic description of ground and excited states
• Quantum Filter Diagonalization with Double-Factorized Hamiltonians
• Quantum simulation of electronic structure with a transcorrelated Hamiltonian: improved accuracy with a smaller footprint on the quantum computer
• A theory of quantum subspace diagonalization
• Simulating Many-Body Systems with a Projective Quantum Eigensolver
• Quantum inverse iteration algorithm for programmable quantum simulators
• Iterative Quantum Assisted Eigensolver
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Dimensionality reduction of many-body problem using coupled-cluster sub-system flow equations: classical and quantum computing perspective
• Spin-projection for quantum computation: A low-depth approach to strong correlation
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• Real-Time Krylov Theory for Quantum Computing Algorithms
• N-electron valence perturbation theory with reference wavefunctions from quantum computing: application to the relative stability of hydroxide anion and hydroxyl radical
• Noisy intermediate-scale quantum algorithm for semidefinite programming
• Generalized Quantum Assisted Simulator
• Challenges in the use of quantum computing hardware-efficient Ansatze in electronic structure theory
• Hamiltonian operator approximation for energy measurement and ground state preparation
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
• Quantum simulations employing connected moments expansions
• Coupled Cluster Downfolding Methods: the effect of double commutator terms on the accuracy of ground-state energies
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers
• Diagonalization of large many-body Hamiltonians on a quantum processor
• The Basics of Quantum Computing for Chemists
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• Topology-Driven Quantum Architecture Search Framework
• Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Spatial, spin, and charge symmetry projections for a Fermi-Hubbard model on a quantum computer
• Quantum algorithms for the generalized eigenvalue problem
• A stochastic quantum Krylov protocol with double factorized Hamiltonians
• Discretized quantum adiabatic process for free fermions and comparison with the imaginary-time evolution
• Variational quantum solver employing the PDS energy functional
• Analysis of quantum Krylov algorithms with errors
• Gutzwiller wave function on a quantum computer using a discrete Hubbard-Stratonovich transformation
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• Natural orbitals and sparsity of quantum mutual information
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Unitary Coupled Cluster: Seizing the Quantum Moment
• Measurement-efficient quantum Krylov subspace diagonalisation
• Quantum algorithms for generator coordinate methods
• Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
• Quantum Eigenvector Continuation for Chemistry Applications
• Improved iterative quantum algorithm for ground-state preparation
• Many-Body Excited States with a Contracted Quantum Eigensolver
• Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
• Precision ground-state energy calculation for the water molecule on a superconducting quantum processor
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• A Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design
• Unleashed from Constrained Optimization: Quantum Computing for Quantum Chemistry Employing Generator Coordinate Inspired Method
• Near Term Algorithms for Linear Systems of Equations
• Local, Expressive, Quantum-Number-Preserving VQE Ansatze for Fermionic Systems
• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
• Variational Phase Estimation with Variational Fast Forwarding
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
• Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
• Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
• Multireference error mitigation for quantum computation of chemistry
• Experimental benchmarking of quantum state overlap estimation strategies with photonic systems
• Partitioned Quantum Subspace Expansion
• Cascaded variational quantum eigensolver algorithm
• Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach
• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Experimental demonstration of optimal measurement for unambiguously discriminating asymmetric qudit states
• Systematic many-fermion Hamiltonian input scheme and spectral calculations on quantum computers
• NISQ algorithm for the matrix elements of a generic observable
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments
• Cheaper and more noise-resilient quantum state preparation using eigenvector continuation
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions
• From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
• Qubit frugal entanglement determination with the deep multi-scale entanglement renormalization ansatz
• Exploring fixed points and eigenstates of quantum systems with reinforcement learning
• A quantum eigenvalue solver based on tensor networks
• Numerical investigation of the quantum inverse algorithm on small molecules
• Robust phase estimation of the ground-state energy without controlled time evolution on a quantum device