State preparation and evolution in quantum computing: a perspective from Hamiltonian moments

Abstract

Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quantum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ devices impedes the conventional quantum algorithms to be implemented. Practical strategies usually exploit hybrid quantum classical algorithms to demonstrate potentially useful applications of quantum computing in the NISQ era. Among the numerous hybrid algorithms, recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments, $⟨\varphi |{\hat{\mathcal{H}}}^n|\varphi ⟩$ ($n=1,2,\cdots$), with respect to quantum state $|\varphi ⟩$. In this tutorial, we will give a brief review of these quantum algorithms with focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies based on the quantum computed moments. Furthermore, we will present a tutorial to show how we can measure and compute the Hamiltonian moments of a four-site Heisenberg model, and compute the energy and magnetization of the model utilizing the imaginary time evolution in the real IBM-Q NISQ hardware environment. Along this line, we will further discuss some practical issues associated with these algorithms. We will conclude this tutorial review by overviewing some possible developments and applications in this direction in the near future.

References in corpus (64)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Simulation
• Many body localization and thermalization in quantum statistical mechanics
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Adiabatic Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Quantum Amplitude Amplification and Estimation
• Quantum random walks - an introductory overview
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Fermionic quantum computation
• Quantum walks: a comprehensive review
• Extending the computational reach of a noisy superconducting quantum processor
• Scalable Quantum Simulation of Molecular Energies
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Quench dynamics and relaxation in isolated integrable quantum spin chains
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid quantum-classical algorithms and quantum error mitigation
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Experimental Comparison of Two Quantum Computing Architectures
• Quantum Natural Gradient
• Variational Quantum Computation of Excited States
• Theory of variational quantum simulation
• Quantum-Classical Computation of Schwinger Model Dynamics using Quantum Computers
• Direct estimations of linear and non-linear functionals of a quantum state
• Universal Quantum Estimator
• Cloud Quantum Computing of an Atomic Nucleus
• Recent progress in many-body localization
• Subspace-search variational quantum eigensolver for excited states
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Simulating quantum many-body dynamics on a current digital quantum computer
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
• Optimal Quantum Measurements of Expectation Values of Observables
• Efficient estimation of Pauli observables by derandomization
• Mutually unbiased binary observable sets on N qubits
• Fermionic partial tomography via classical shadows
• A Non-Orthogonal Variational Quantum Eigensolver
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Methodology for replacing indirect measurements with direct measurements
• Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• Quantum Power Method by a Superposition of Time-Evolved States
• Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms
• Experimental Estimation of Quantum State Properties from Classical Shadows
• Rigorous measurement error correction
• Quantum inverse iteration algorithm for programmable quantum simulators
• Quantum computed moments correction to variational estimates
• Algorithmic Error Mitigation Scheme for Current Quantum Processors
• Improving the accuracy and efficiency of quantum connected moments expansions
• Quantum simulations employing connected moments expansions
• Analytic Solution for the Ground State Energy of the Extensive Many-Body Problem
• Variational quantum solver employing the PDS energy functional
• Implementing smooth functions of a Hermitian matrix on a quantum computer