Hamiltonian Simulation Using Linear Combinations of Unitary Operations

Abstract

We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods.

18 pages, 3 figures

References in corpus (8)

• Quantum algorithm for solving linear systems of equations
• Universal computation by quantum walk
• Exponential algorithmic speedup by quantum walk
• On the relationship between continuous- and discrete-time quantum walk
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Simulating sparse Hamiltonians with star decompositions
• A Quantum Algorithm for the Hamiltonian NAND Tree
• Efficient discrete-time simulations of continuous-time quantum query algorithms

Cited by in corpus (84)

• Quantum Chemistry in the Age of Quantum Computing
• Strawberry Fields: A Software Platform for Photonic Quantum Computing
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Measurement reduction in variational quantum algorithms
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Quantum Power Method by a Superposition of Time-Evolved States
• Quantum Computing for Neutrino-nucleus Scattering
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
• A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment
• Symmetry-adapted variational quantum eigensolver
• Quantum SDP-Solvers: Better upper and lower bounds
• Quantum Simulation of the Sachdev-Ye-Kitaev Model by Asymmetric Qubitization
• Time-marching based quantum solvers for time-dependent linear differential equations
• Correlating AGP on a quantum computer
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model
• Quantum-classical simulation of two-site dynamical mean-field theory on noisy quantum hardware
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Predicting Gibbs-State Expectation Values with Pure Thermal Shadows
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
• Approximate Quantum Circuit Synthesis using Block-Encodings
• Faster quantum and classical SDP approximations for quadratic binary optimization
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Composite Quantum Simulations
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Doubling Efficiency of Hamiltonian Simulation via Generalized Quantum Signal Processing
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
• Compact quantum algorithms for time-dependent differential equations
• Variational quantum solver employing the PDS energy functional
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• Doubling the order of approximation via the randomized product formula
• Non-Unitary Quantum Machine Learning
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• A quantum algorithm for the linear Vlasov equation with collisions
• Quantifying $T$-gate-count improvements for ground-state-energy estimation with near-optimal state preparation
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms
• Quantum state preparation for multivariate functions
• Signal processing techniques for efficient compilation of controlled rotations in trapped ions
• Multi-nucleon structure and dynamics via quantum computing
• Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
• Quantum Control Machine: The Limits of Control Flow in Quantum Programming
• Diagnosing Quantum Many-body Chaos in Non-Hermitian Quantum Spin Chain via Krylov Complexity
• Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
• Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
• Equivariant Variational Quantum Eigensolver to detect Phase Transitions through Energy Level Crossings
• Practicality of quantum adiabatic algorithm for chemistry applications
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Quantum algorithms for powering stable Hermitian matrices
• Roadmap for quantum simulation of the fractional quantum Hall effect
• Quantum Magic Rectangles: Characterization and Application to Certified Randomness Expansion
• Quantum algorithm for the Vlasov simulation of the large-scale structure formation with massive neutrinos
• Squeezed supermodes and cluster states based on modes with orbital angular momentum
• Ladder Operator Block-Encoding
• Uncoupled Majorana fermions in open quantum systems: On the efficient simulation of non-equilibrium stationary states of quadratic Fermi models
• Toward simulating quantum field theories with controlled phonon-ion dynamics: A hybrid analog-digital approach
• Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
• Semicoherent Symmetric Quantum Processes: Theory and Applications
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Quantum algorithms for linear and non-linear fractional reaction-diffusion equations
• Parallelization techniques for quantum simulation of fermionic systems
• Exponential distillation of dominant eigenproperties
• Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
• Agnostic Process Tomography
• On solving classes of positive-definite quantum linear systems with quadratically improved runtime in the condition number
• Adaptive Lattice Gas Algorithm: Classical and Quantum implementations
• An Efficient Decomposition of the Carleman Linearized Burgers' Equation
• Divergence-free algorithms for solving nonlinear differential equations on quantum computers
• Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
• State preparation and evolution in quantum computing: a perspective from Hamiltonian moments
• On the commutator scaling in Hamiltonian simulation with multi-product formulas
• Quantum-to-Classical Transition via Single-Shot Generalized Measurements
• Learning the structure of any Hamiltonian from minimal assumptions
• Quantum Phase Recognition via Quantum Attention Mechanism
• Unitary-transformed projective squeezing: applications for circuit-knitting and state-preparation of non-Gaussian states
• Quantum Chaos and Universal Trotterisation Behaviours in Digital Quantum Simulations
• Toward Density Functional Theory on Quantum Computers?
• Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation
• Vortex Detection from Quantum Data
• Preparation of the single-spinon wave function on a quantum computer
• Block Encoding of Sparse Matrices via Coherent Permutation
• Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding
• Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation