Higher Order Decompositions of Ordered Operator Exponentials

Abstract

We present a decomposition scheme based on Lie-Trotter-Suzuki product formulae to represent an ordered operator exponential as a product of ordinary operator exponentials. We provide a rigorous proof that does not use a time-displacement superoperator, and can be applied to non-analytic functions. Our proof provides explicit bounds on the error and includes cases where the functions are not infinitely differentiable. We show that Lie-Trotter-Suzuki product formulae can still be used for functions that are not infinitely differentiable, but that arbitrary order scaling may not be achieved.

16 pages, 1 figure

References in corpus (4)

• Efficient quantum algorithms for simulating sparse Hamiltonians
• Arbitrarily accurate composite pulses
• Efficient numerical integrators for stochastic models
• Gradient Symplectic Algorithms for Solving the Radial Schrodinger Equation

Cited by in corpus (93)

• Quantum Chemistry in the Age of Quantum Computing
• Quantum principal component analysis
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Efficient variational quantum simulator incorporating active error minimisation
• A Theory of Trotter Error
• Digitized adiabatic quantum computing with a superconducting circuit
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum Simulation for High Energy Physics
• Solving strongly correlated electron models on a quantum computer
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Low Depth Quantum Simulation of Electronic Structure
• High-order quantum algorithm for solving linear differential equations
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Adiabatic Quantum Simulation of Quantum Chemistry
• Nearly optimal lattice simulation by product formulas
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Digital Quantum Simulation, Trotter Errors, and Quantum Chaos of the Kicked Top
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• BQP-completeness of Scattering in Scalar Quantum Field Theory
• Hamiltonian simulation in the low-energy subspace
• Simulating Quantum Dynamics On A Quantum Computer
• Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
• Quantum computing of fluid dynamics using the hydrodynamic Schrödinger equation
• Quantum-circuit design for efficient simulations of many-body quantum dynamics
• Universal simulation of Markovian open quantum systems
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Time-marching based quantum solvers for time-dependent linear differential equations
• Bounding the costs of quantum simulation of many-body physics in real space
• Bayesian Deep Learning on a Quantum Computer
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
• Nonadiabatic Topological Energy Pumps with Quasiperiodic Driving
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Optimised Trotter Decompositions for Classical and Quantum Computing
• Fast-forwarding quantum evolution
• Spectral Gap Amplification
• Randomizing multi-product formulas for Hamiltonian simulation
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
• Simulation of single-qubit open quantum systems
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Quantum optimal control with quantum computers: an hybrid algorithm featuring machine learning optimization
• Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning
• Algorithm for the solution of the Dirac equation on digital quantum computers
• Many-Body Localization with Quasiperiodic Driving
• Hardware-efficient quantum algorithm for the simulation of open-system dynamics and thermalisation
• Exact gate decompositions for photonic quantum computing
• Quantum algorithms from fluctuation theorems: Thermal-state preparation
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Error-resilient Monte Carlo quantum simulation of imaginary time
• Exact and approximate continuous-variable gate decompositions
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Composite Quantum Simulations
• Product Formulas for Exponentials of Commutators
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Importance sampling for stochastic quantum simulations
• Quantum computer-aided design: digital quantum simulation of quantum processors
• Improved Bounds for Eigenpath Traversal
• State-dependent error bound for digital quantum simulation of driven systems
• Unitary expansion of the time evolution operator
• Computational complexity of time-dependent density functional theory
• Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
• Hamiltonian simulation for low-energy states with optimal time dependence
• Measurement-efficient quantum Krylov subspace diagonalisation
• Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
• Parallel Quantum Algorithm for Hamiltonian Simulation
• Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials
• Quantum simulation for time-dependent Hamiltonians -- with applications to non-autonomous ordinary and partial differential equations
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• Simulation of non-radiative energy transfer in photosynthetic systems using a quantum computer
• Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• Digital Quantum Simulation, Learning of the Floquet Hamiltonian, and Quantum Chaos of the Kicked Top
• Trotterization is substantially efficient for low-energy states
• Recipes for the Digital Quantum Simulation of Lattice Spin Systems
• A Spacetime Area Law Bound on Quantum Correlations
• Toward simulating quantum field theories with controlled phonon-ion dynamics: A hybrid analog-digital approach
• Efficient state initialization by a quantum spectral filtering algorithm
• Efficient Algorithms for Universal Quantum Simulation
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Parallelization techniques for quantum simulation of fermionic systems
• Effective (Floquet) Lindblad generators from spectral unwinding
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Phase Estimation with Compressed Controlled Time Evolution
• Explicit volume-preserving numerical schemes for relativistic trajectories and spin dynamics
• Sub-Riemannian geometry of measurement based quantum computation
• Decoherence of the quantum logic gate implemented with the Jaynes-Cummings model: A semiclassical approach