Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
arXiv:2007.11624 · doi:10.22331/q-2022-02-02-637
Abstract
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to approximate a Taylor series by truncating after some order. Here we present an adaptation of that method, optimized for Hamiltonians with terms of widely varying magnitude, as is commonly the case in electronic structure calculations. We show that it is more efficient to apply LCU using a truncation that retains larger magnitude terms as determined by an iterative procedure. We obtain bounds on the simulation error for this generalized truncated Taylor method, and for a range of molecular simulations, we report these bounds as well as exact numerical results. We find that our adaptive method can typically improve the simulation accuracy by an order of magnitude, for a given circuit depth.
arXiv comment14 pages, 7 figures
References in corpus (31)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Simulated Quantum Computation of Molecular Energies
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Contextuality supplies the magic for quantum computation
- Roads towards fault-tolerant universal quantum computation
- Toward the first quantum simulation with quantum speedup
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- A Theory of Trotter Error
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- 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
- 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
- Nearly optimal lattice simulation by product formulas
- Faster quantum simulation by randomization
- Exploiting locality in quantum computation for quantum chemistry
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
- Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Hamiltonian Simulation in the Interaction Picture
- Compilation by stochastic Hamiltonian sparsification
- Well-conditioned multiproduct Hamiltonian simulation
Cited by in corpus (9)
- Early fault-tolerant simulations of the Hubbard model
- Hunting for quantum-classical crossover in condensed matter problems
- Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
- On the complexity of implementing Trotter steps
- Error-resilient Monte Carlo quantum simulation of imaginary time
- Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
- Quantum algorithm for partial differential equations of non-conservative systems with spatially varying parameters
- Measurement-efficient quantum Krylov subspace diagonalisation
- Quantum techniques for eigenvalue problems