Simulating chemistry efficiently on fault-tolerant quantum computers

Abstract

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error $\epsilon$, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is $O(\log \epsilon )$ or $O(\log \log \epsilon )$; with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.

33 pages, 18 figures

References in corpus (17)

• Simulated Quantum Computation of Molecular Energies
• An Open-System Quantum Simulator with Trapped Ions
• Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating chemistry using quantum computers
• A new quantum ripple-carry addition circuit
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Creating superpositions that correspond to efficiently integrable probability distributions
• Fast Quantum Modular Exponentiation
• Effective fault-tolerant quantum computation with slow measurements
• Using Quantum Computers for Quantum Simulation
• A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
• Scalability of Shor's algorithm with a limited set of rotation gates
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Preparation of many-body states for quantum simulation
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Quantum Computing of Quantum Chaos in the Kicked Rotator Model

Cited by in corpus (2)

• Novel constructions for the fault-tolerant Toffoli gate
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code