Variational quantum eigensolvers for sparse Hamiltonians

Abstract

Hybrid quantum-classical variational algorithms such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) are promising applications for noisy, intermediate-scale quantum (NISQ) computers. Both VQE and QAOA variationally extremize the expectation value of a Hamiltonian. All work to date on VQE and QAOA has been limited to Pauli representations of Hamiltonians. However, many cases exist in which a sparse representation of the Hamiltonian is known but there is no efficient Pauli representation. We extend VQE to general sparse Hamiltonians. We provide a decomposition of a fermionic second-quantized Hamiltonian into a number of one-sparse, self-inverse, Hermitian terms linear in the number of ladder operator monomials in the second-quantized representation. We provide a decomposition of a general $d$-sparse Hamiltonian into $O(d^2)$ such terms. In both cases a single sample of any term can be obtained using two ansatz state preparations and at most six oracle queries. The number of samples required to estimate the expectation value to precision $\epsilon$ scales as ${\epsilon }^{-2}$ as for Pauli-based VQE. This widens the domain of applicability of VQE to systems whose Hamiltonian and other observables are most efficiently described in terms of sparse matrices.

arXiv commentpublished version; 12 pages, 5 figures

References in corpus (32)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Simulated Quantum Computation of Molecular Energies
• Fermionic quantum computation
• Extending the computational reach of a noisy superconducting quantum processor
• Hamiltonian Simulation by Qubitization
• Exponential algorithmic speedup by quantum walk
• Scalable Quantum Simulation of Molecular Energies
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Hartree-Fock on a superconducting qubit quantum computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Robust determination of molecular spectra on a quantum processor
• Quantum chemistry calculations on a trapped-ion quantum simulator
• On the relationship between continuous- and discrete-time quantum walk
• Cloud Quantum Computing of an Atomic Nucleus
• Hamiltonian simulation with nearly optimal dependence on all parameters
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Experimental Bayesian Quantum Phase Estimation on a Silicon Photonic Chip
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Simulating sparse Hamiltonians with star decompositions
• Simulating Hadronic Physics on NISQ devices using Basis Light-Front Quantization
• Light-Front Field Theory on Current Quantum Computers
• Efficient quantum circuits for arbitrary sparse unitaries

Cited by in corpus (18)

• Edge AI: A Taxonomy, Systematic Review and Future Directions
• Light-Front Field Theory on Current Quantum Computers
• Solving hadron structures using the basis light-front quantization approach on quantum computers
• Pulse based Variational Quantum Optimal Control for hybrid quantum computing
• Second-quantized fermionic operators with polylogarithmic qubit and gate complexity
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Quantum Simulation of Second-Quantized Hamiltonians in Compact Encoding
• Variational quantum algorithms for Poisson equations based on the decomposition of sparse Hamiltonians
• Computationally Efficient Quantum Expectation with Extended Bell Measurements
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Molecular Structure Optimization based on Electrons-Nuclei Quantum Dynamics Computation
• Tight Bound for Estimating Expectation Values from a System of Linear Equations
• A quantum computing concept for 1-D elastic wave simulation with exponential speedup
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Quantum nuclear dynamics on a distributed set of ion-trap quantum computing systems
• Making the cut: two methods for breaking down a quantum algorithm
• A penalty-free quantum algorithm to find energy eigenstates