Composite Quantum Simulations

Abstract

In this paper we provide a framework for combining multiple quantum simulation methods, such as Trotter-Suzuki formulas and QDrift into a single Composite channel that builds upon older coalescing ideas for reducing gate counts. The central idea behind our approach is to use a partitioning scheme that allocates a Hamiltonian term to the Trotter or QDrift part of a channel within the simulation. This allows us to simulate small but numerous terms using QDrift while simulating the larger terms using a high-order Trotter-Suzuki formula. We prove rigorous bounds on the diamond distance between the Composite channel and the ideal simulation channel and show under what conditions the cost of implementing the Composite channel is asymptotically upper bounded by the methods that comprise it for both probabilistic partitioning of terms and deterministic partitioning. Finally, we discuss strategies for determining partitioning schemes as well as methods for incorporating different simulation methods within the same framework.

References in corpus (24)

• Hamiltonian Simulation by Qubitization
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum Algorithms for Quantum Field Theories
• A Theory of Trotter Error
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Low Depth Quantum Simulation of Electronic Structure
• Faster quantum simulation by randomization
• Higher Order Decompositions of Ordered Operator Exponentials
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Quantum Simulation of the Sachdev-Ye-Kitaev Model by Asymmetric Qubitization
• Concentration for random product formulas
• Compilation by stochastic Hamiltonian sparsification
• Efficient quantum computation of molecular forces and other energy gradients
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Randomizing multi-product formulas for Hamiltonian simulation
• The Trotter Step Size Required for Accurate Quantum Simulation of Quantum Chemistry
• A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations

Cited by in corpus (13)

• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Parallel Quantum Algorithm for Hamiltonian Simulation
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Phase estimation with partially randomized time evolution
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Quantum Simulation via Stochastic Combination of Unitaries
• Does Quantum Mechanics Breed Larger, More Intricate Quantum Theories? The Case for Experience-Centric Quantum Theory and the Interactome of Quantum Theories
• Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search