Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware

Abstract

The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with severely restricted resources, this overhead may be unjustifiable. In this work, we develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model, exploiting the underlying control over qubit interactions available in principle in most quantum hardware implementations. We then analyse the impact of these techniques under the standard error model where errors occur per gate, and an error model with a constant error rate per unit time. To quantify the benefits of this approach, we apply it to a canonical example: time-dynamics simulation of the 2D spin Fermi-Hubbard model. We derive analytic circuit identities for efficiently synthesising multi-qubit evolutions from two-qubit interactions. Combined with new error bounds for Trotter product formulas tailored to the non-asymptotic regime and a careful analysis of error propagation under the aforementioned per-gate and per-time error models, we improve upon the previous best methods for Hamiltonian simulation by multiple orders of magnitude. By our calculations, for a 5$\times$5 Fermi-Hubbard lattice we reduce the circuit depth from 800,160 to 1460 in the per-gate error model, or the circuit-depth-equivalent to 440 in the per-time error model. This brings Hamiltonian simulation, previously beyond reach of current hardware for non-trivial examples, significantly closer to being feasible in the NISQ era.

63 pages, 21 figures, 3 tables. v2 includes full analysis of algorithm performance under second error model, and new numerical calculations of Trotter error bounds alongside previous analytic bounds v3 is final version

References in corpus (5)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Hartree-Fock on a superconducting qubit quantum computer
• Decoherence Rate of Semiconductor Charge Qubit Coupled to Acoustic Phonon Reservoir
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer

Cited by in corpus (34)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Hamiltonian simulation in the low-energy subspace
• Nearly tight Trotterization of interacting electrons
• Noise-assisted digital quantum simulation of open systems
• First-Order Trotter Error from a Second-Order Perspective
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Quantum algorithms for scientific computing
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• SimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation
• Trotter error with commutator scaling for the Fermi-Hubbard model
• Optimized noise-assisted simulation of the Lindblad equation with time-dependent coefficients on a noisy quantum processor
• Measurement-based infused circuits for variational quantum eigensolvers
• Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
• Riemannian quantum circuit optimization for Hamiltonian simulation
• Quantum Algorithms for Testing Hamiltonian Symmetry
• Resource estimations for the Hamiltonian simulation in correlated electron materials
• Non-Hermiticity in quantum nonlinear optics through symplectic transformations
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• End-to-end complexity for simulating the Schwinger model on quantum computers
• Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
• Quantum subspace expansion approach for simulating dynamical response functions of Kitaev spin liquids
• Parallelization techniques for quantum simulation of fermionic systems
• Recursive relations and quantum eigensolver algorithms within modified Schrieffer--Wolff transformations for the Hubbard dimer
• Quantum circuits for partial differential equations in Fourier space
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Extracting the spin excitation spectrum of a fermionic system using a quantum processor
• Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices
• Agnostic Process Tomography
• Theory of quantum error mitigation for non-Clifford gates
• Finding eigenvectors with a quantum variational algorithm
• Prethermalization, shadowing breakdown, and the absence of Trotterization transition in quantum circuits
• Photonic Simulation of Localization Phenomena Using Boson Sampling
• Programming tools for Analogue Quantum Computing in the High-Performance Computing Context -- A Review
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation