Corpus ID: 237532296

A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations

  title={A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations},
  author={Shi Jin and Xiantao Li},
  • Shi Jin, Xiantao Li
  • Published 16 September 2021
  • Computer Science, Physics, Mathematics
  • ArXiv
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are evaluated at each time step, while the remaining terms are evaluated at random. The bound for the mean square error is obtained, together with a concentration bound. The mean square error consists of a variance term and a bias term, arising respectively from… Expand
Some Error Analysis for the Quantum Phase Estimation Algorithms
This paper characterize the probability of computing the phase values in terms of the consistency error, including the residual error, Trotter splitting error, or statistical error. Expand


Random Compiler for Fast Hamiltonian Simulation.
  • E. Campbell
  • Physics, Medicine
  • Physical review letters
  • 2019
A randomized compiler for Hamiltonian simulation where gate probabilities are proportional to the strength of a corresponding term in the Hamiltonian, especially suited to electronic structure Hamiltonians relevant to quantum chemistry. Expand
Improving quantum algorithms for quantum chemistry
Improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer by modifying how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Expand
Faster quantum simulation by randomization
Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands.Expand
On the Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting.Expand
Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees
Quantum simulation has wide applications in quantum chemistry and physics. Recently, scientists have begun exploring the use of randomized methods for accelerating quantum simulation. Among them, aExpand
Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
It is found that the Trotter error for most systems involving heavy atoms, using a reference magnitude ordering, is less than 1 kcal/mol, and three ordering strategies are proposed, including an iterative method for generating the new error operator terms added upon insertion of a term into an ordered Hamiltonian. Expand
Simulation of electronic structure Hamiltonians using quantum computers
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However,Expand
Time-dependent unbounded Hamiltonian simulation with vector norm scaling
It is demonstrated that under suitable assumptions of the Hamiltonian and the initial vector, if the error is measured in terms of the vector norm, the computational cost may not increase at all as the norm of theHamiltonian increases using Trotter type methods. Expand
The Trotter step size required for accurate quantum simulation of quantum chemistry
This study presents an alternative simulation scheme and shows that it can sometimes outperform existing schemes, but that this possibility depends crucially on the details of the simulated molecule. Expand
Quantum speedup of Monte Carlo methods
  • A. Montanaro
  • Mathematics, Medicine
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
A quantum algorithm which can accelerate Monte Carlo methods in a very general setting, achieving a near-quadratic speedup over the best possible classical algorithm. Expand