Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation

Abstract

Simulating the time-evolution of a Hamiltonian is one of the most promising applications of quantum computers. Multi-Product Formulas (MPFs) are well suited to replace standard product formulas since they scale better with respect to time and approximation errors. Hamiltonian simulation with MPFs was first proposed in a fully quantum setting using a linear combination of unitaries. Here, we analyze and demonstrate a hybrid quantum-classical approach to MPFs that classically combines expectation values evaluated with a quantum computer. This has the same approximation bounds as the fully quantum MPFs, but, in contrast, requires no additional qubits, no controlled operations, and is not probabilistic. We show how to design MPFs that do not amplify the hardware and sampling errors, and demonstrate their performance. In particular, we illustrate the potential of our work by theoretically analyzing the benefits when applied to a classically intractable spin-boson model, and by computing the dynamics of the transverse field Ising model using a classical simulator as well as quantum hardware. We observe an error reduction of up to an order of magnitude when compared to a product formula approach by suppressing hardware noise with Pauli Twirling, pulse efficient transpilation, and a novel zero-noise extrapolation based on scaled cross-resonance pulses. The MPF methodology reduces the circuit depth and may therefore represent an important step towards quantum advantage for Hamiltonian simulation on noisy hardware.

References in corpus (62)

• Quantum algorithm for solving linear systems of equations
• Probing many-body dynamics on a 51-atom quantum simulator
• Ultrastrong coupling between light and matter
• Error mitigation for short-depth quantum circuits
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Many-Body Physics with Individually-Controlled Rydberg Atoms
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Extending the computational reach of a noisy superconducting quantum processor
• Exponential algorithmic speedup by quantum walk
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Efficient variational quantum simulator incorporating active error minimisation
• Toward the first quantum simulation with quantum speedup
• Noise tailoring for scalable quantum computation via randomized compiling
• A Theory of Trotter Error
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• Theory of variational quantum simulation
• Quantum Process Tomography: Resource Analysis of Different Strategies
• On the relationship between continuous- and discrete-time quantum walk
• Cloud Quantum Computing of an Atomic Nucleus
• A random compiler for fast Hamiltonian simulation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Quantum Process Tomography of a Universal Entangling Gate Implemented with Josephson Phase Qubits
• Variational quantum simulation of general processes
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Option Pricing using Quantum Computers
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits
• Effective Hamiltonian models of the cross-resonance gate
• Digital zero noise extrapolation for quantum error mitigation
• Nearly optimal lattice simulation by product formulas
• Resource Efficient Zero Noise Extrapolation with Identity Insertions
• Qiskit Pulse: Programming Quantum Computers Through the Cloud with Pulses
• Digital quantum simulation of open quantum systems using quantum imaginary time evolution
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Quantum advantage with noisy shallow circuits in 3D
• Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
• Mitiq: A software package for error mitigation on noisy quantum computers
• Quantum hardware simulating four-dimensional inelastic neutron scattering
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
• A randomized quantum algorithm for statistical phase estimation
• Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware
• Mitigating algorithmic errors in Hamiltonian simulation
• Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Multimode circuit QED with hybrid metamaterial transmission lines
• Compilation by stochastic Hamiltonian sparsification
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model
• Error-Mitigated Simulation of Quantum Many-Body Scars on Quantum Computers with Pulse-Level Control
• Efficient State Preparation for Quantum Amplitude Estimation
• Enhancing the Quantum Linear Systems Algorithm using Richardson Extrapolation
• Randomizing multi-product formulas for Hamiltonian simulation
• First-Order Trotter Error from a Second-Order Perspective
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
• Error Bounds for Variational Quantum Time Evolution
• Variational Quantum Simulation of Ultrastrong Light-Matter Coupling
• Coupling a Superconducting Qubit to a Left-Handed Metamaterial Resonator
• Well-conditioned multiproduct Hamiltonian simulation

Cited by in corpus (18)

• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
• Pulse variational quantum eigensolver on cross-resonance based hardware
• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
• Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings
• Tensor Network enhanced Dynamic Multiproduct Formulas
• Semicoherent Symmetric Quantum Processes: Theory and Applications
• Phase estimation with partially randomized time evolution
• Trotter error time scaling separation via commutant decomposition
• Short-time simulation of quantum dynamics by Pauli measurements
• Realization of Two-dimensional Discrete Time Crystals with Anisotropic Heisenberg Coupling
• On the commutator scaling in Hamiltonian simulation with multi-product formulas
• Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation