Nearly tight Trotterization of interacting electrons

Abstract

We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and prior knowledge of the initial state. We achieve this using Trotterization for a class of interacting electrons that encompasses various physical systems, including the plane-wave-basis electronic structure and the Fermi-Hubbard model. We estimate the simulation error by taking the transition amplitude of nested commutators of the Hamiltonian terms within the $\eta$-electron manifold. We develop multiple techniques for bounding the transition amplitude and expectation of general fermionic operators, which may be of independent interest. We show that it suffices to use $\left(\frac{n^{5/3}}{{\eta }^{2/3}}+n^{4/3}{\eta }^{2/3}\right)n^{o(1)}$ gates to simulate electronic structure in the plane-wave basis with $n$ spin orbitals and $\eta$ electrons, improving the best previous result in second quantization up to a negligible factor while outperforming the first-quantized simulation when $n={\eta }^{2-o(1)}$. We also obtain an improvement for simulating the Fermi-Hubbard model. We construct concrete examples for which our bounds are almost saturated, giving a nearly tight Trotterization of interacting electrons.

arXiv comment58 pages, 2 figures

References in corpus (58)

• Quantum algorithm for solving linear systems of equations
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Hamiltonian Simulation by Qubitization
• Exponential algorithmic speedup by quantum walk
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Stripe order in the underdoped region of the two-dimensional Hubbard model
• Toward the first quantum simulation with quantum speedup
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum Algorithms for Quantum Field Theories
• A Theory of Trotter Error
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Quantum Algorithms for Fermionic Simulations
• Gate count estimates for performing quantum chemistry on small quantum computers
• Solving strongly correlated electron models on a quantum computer
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Low Depth Quantum Simulation of Electronic Structure
• Quantum computing enhanced computational catalysis
• High-order quantum algorithm for solving linear differential equations
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Exponential improvement in precision for simulating sparse Hamiltonians
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Low rank representations for quantum simulation of electronic structure
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Resource-efficient digital quantum simulation of $d$-level systems for photonic, vibrational, and spin-$s$ Hamiltonians
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Exploiting locality in quantum computation for quantum chemistry
• Measuring the Renyi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Hamiltonian simulation in the low-energy subspace
• Faster Digital Quantum Simulation by Symmetry Protection
• Early fault-tolerant simulations of the Hubbard model
• Locality and digital quantum simulation of power-law interactions
• Concentration for random product formulas
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Improved thermal area law and quasi-linear time algorithm for quantum Gibbs states
• Resource Estimation for Quantum Variational Simulations of the Hubbard Model
• Compilation by stochastic Hamiltonian sparsification
• Fourier transform of fermionic systems and the spectral tensor network
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
• Toward simulating Superstring/M-theory on a quantum computer
• Novel Trotter formulas for digital quantum simulation
• Boundedness properties of fermionic operators

Cited by in corpus (50)

• Quantum Simulation for High Energy Physics
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Provably accurate simulation of gauge theories and bosonic systems
• Learning many-body Hamiltonians with Heisenberg-limited scaling
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Towards near-term quantum simulation of materials
• Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation
• Classically emulated digital quantum simulation for screening and confinement in the Schwinger model with a topological term
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
• Hamiltonian simulation with random inputs
• Efficient quantum computation of molecular forces and other energy gradients
• Fast-forwarding quantum evolution
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• On the complexity of implementing Trotter steps
• Quantum simulation of real-space dynamics
• Simulating Effective QED on Quantum Computers
• Quench dynamics of the Schwinger model via variational quantum algorithms
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Entanglement accelerates quantum simulation
• Importance sampling for stochastic quantum simulations
• Quantum Simulations of SO(5) Many-Fermion Systems using Qudits
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• Average-case Speedup for Product Formulas
• Quantum error mitigation for Fourier moment computation
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Quantifying $T$-gate-count improvements for ground-state-energy estimation with near-optimal state preparation
• Trotter error with commutator scaling for the Fermi-Hubbard model
• Parallel Quantum Algorithm for Hamiltonian Simulation
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Selection and improvement of product formulae for best performance of quantum simulation
• Exploiting anticommutation in Hamiltonian simulation
• End-to-end complexity for simulating the Schwinger model on quantum computers
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Phase estimation with partially randomized time evolution
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
• Dissipative ground state preparation in ab initio electronic structure theory
• Quantum Simulation of Nuclear Dynamics in First Quantization
• Error Interference in Quantum Simulation
• Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding