The Trotter step size required for accurate quantum simulation of quantum chemistry

  title={The Trotter step size required for accurate quantum simulation of quantum chemistry},
  author={David Poulin and Matthew B. Hastings and Dave Wecker and Nathan Wiebe and Andrew C. Doberty and Matthias Troyer},
  journal={Quantum Inf. Comput.},
The simulation of molecules is a widely anticipated application of quantum computers. However, recent studies [1, 2] have cast a shadow on this hope by revealing that the complexity in gate count of such simulations increases with the number of spin orbitals N as N8, which becomes prohibitive even for molecules of modest size N ∼ 100. This study was partly based on a scaling analysis of the Trotter step required for an ensemble of random artificial molecules. Here, we revisit this analysis and… 

Figures from this paper

Exponentially more precise quantum simulation of fermions in second quantization
We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically more efficient than those based on the Lie–Trotter–Suzuki decomposition. We present the first
Effects of gate errors in digital quantum simulations of fermionic systems
Digital quantum simulations offer exciting perspectives for the study of fermionic systems such as molecules or lattice models. However, with quantum error correction still being out of reach for
Nearly tight Trotterization of interacting electrons
It suffices to use O gates to simulate electronic structure in the plane-wave basis with $n$ spin orbitals and $\eta$ electrons up to a negligible factor, improving the best previous result in second quantization while outperforming the first-quantized simulation when $n=\mathcal{O}\left(\eta^2\right)$.
Exponentially more precise quantum simulation of fermions in the configuration interaction representation
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As
Increasing the Representation Accuracy of Quantum Simulations of Chemistry without Extra Quantum Resources
Proposals for near-term experiments in quantum chemistry on quantum computers leverage the ability to target a subset of degrees of freedom containing the essential quantum behavior, sometimes called
Quantum simulation of real-space dynamics
Applications are given to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
Toward the first quantum simulation with quantum speedup
It is argued that simulating the time evolution of spin systems is a classically hard problem of practical interest that is among the easiest to address with early quantum devices, and develops optimized implementations and performs detailed resource analyses for several leading quantum algorithms for this problem.
Low-Depth Quantum Simulation of Materials
Simulations of low-density jellium are identified as a promising first setting to explore quantum supremacy in electronic structure and a proposal to simulate the uniform electron gas using a low-depth variational ansatz realizable on near-term quantum devices is proposed.
Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
A framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system is presented, and a suite of generalized transformations of fermion to qubit operators are explored to show that resource-requirement savings of up to nearly $20\% is possible.
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.


Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
Quantum chemistry provides a target for quantum simulation of considerable scientific interest and industrial importance. The majority of algorithms to date have been based on a second-quantized
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.
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,
Simulating chemistry using quantum computers.
This review discusses to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems and describes algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks.
Simulated Quantum Computation of Molecular Energies
Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm and mapping of the molecular wave function to the quantum bits are described.
Simulating Quantum Dynamics On A Quantum Computer
A range of techniques to simulate Hamiltonians with badly behaved derivatives are proposed, including using adaptive time steps, adapting the order of the integrators, and omitting regions about discontinuities.
Black-box hamiltonian simulation and unitary implementation
This work gives the best known simulation of sparse Hamiltonians with constant precision, and shows that a black-box unitary can be performed with bounded error using O(N2/3(log logN)4/3) queries to its matrix elements.
Quantum algorithms for fermionic simulations
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems,
Entangled quantum electronic wavefunctions of the Mn₄CaO₅ cluster in photosystem II.
Through entanglement maps, this work reveals rich information contained in the wavefunctions on bonding changes in the cycle, and suggests that current candidates that have been recently distinguished using parameterized spin models should be reassessed.
Efficient Simulation of Quantum Systems by Quantum Computers
The time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer and the computational cost is comparable to a conventional simulation of the corresponding classical system.