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 (50)

• Quantum Teleportation is a Universal Computational Primitive
• Simulated Quantum Computation of Molecular Energies
• Quantum Algorithms Revisited
• Quantum Computing with Very Noisy Devices
• An Open-System Quantum Simulator with Trapped Ions
• Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
• Quantum Networks for Elementary Arithmetic Operations
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Towards Quantum Chemistry on a Quantum Computer
• Quantum Error Correction for Beginners
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Universal digital quantum simulation with trapped ions
• Quantum Algorithms for Quantum Field Theories
• High threshold universal quantum computation on the surface code
• Quantum measurements and the Abelian Stabilizer Problem
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Efficient Simulation of Quantum Systems by Quantum Computers
• Simulating chemistry using quantum computers
• Methodology for quantum logic gate constructions
• A new quantum ripple-carry addition circuit
• Implementation of the Quantum Fourier Transform
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Creating superpositions that correspond to efficiently integrable probability distributions
• Simulating lattice gauge theories on a quantum computer
• Layered architecture for quantum computing
• Addition on a Quantum Computer
• Approximate Quantum Fourier Transform and Decoherence
• Fast Quantum Modular Exponentiation
• Quantum simulation of the wavefunction to probe frustrated Heisenberg spin systems
• Higher Order Decompositions of Ordered Operator Exponentials
• Direct Characterization of Quantum Dynamics
• Effective fault-tolerant quantum computation with slow measurements
• Using Quantum Computers for Quantum Simulation
• Fault-tolerant quantum computation
• Simulating Ising Spin Glasses on a Quantum Computer
• Simulating quantum mechanics on a quantum computer
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
• Polynomial-Time Simulation of Pairing Models on a Quantum Computer
• Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
• Quantum Circuits with Unbounded Fan-out
• Fast parallel circuits for the quantum Fourier transform
• 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
• Efficiency of free energy calculations of spin lattices by spectral quantum algorithms

Cited by in corpus (82)

• A variational eigenvalue solver on a quantum processor
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• The Variational Quantum Eigensolver: a review of methods and best practices
• Scalable Quantum Simulation of Molecular Energies
• Quantum algorithms for quantum chemistry and quantum materials science
• Elucidating Reaction Mechanisms on Quantum Computers
• Quantum chemistry calculations on a trapped-ion quantum simulator
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Gate count estimates for performing quantum chemistry on small quantum computers
• Low Depth Quantum Simulation of Electronic Structure
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Novel constructions for the fault-tolerant Toffoli gate
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Adiabatic Quantum Simulation of Quantum Chemistry
• Quantum Simulation of Helium Hydride in a Solid-State Spin Register
• Efficient synthesis of universal Repeat-Until-Success circuits
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
• Exploiting locality in quantum computation for quantum chemistry
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Lowering qubit requirements for quantum simulations of fermionic systems
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Digital quantum simulation of molecular vibrations
• Topological Quantum Compiling with Reinforcement Learning
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Adiabatic state preparation study of methylene
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• Local spin operators for fermion simulations
• Entanglement spectroscopy on a quantum computer
• Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Grid-based methods for chemistry simulations on a quantum computer
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
• Reducing the quantum computing overhead with complex gate distillation
• Computation of molecular excited states on IBM quantum computers using a discriminative variational quantum eigensolver
• T-count and T-depth of any multi-qubit unitary
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Fault-tolerant Operations for Universal Blind Quantum Computation
• On the complexity of implementing Trotter steps
• Analyzing the impact of time-correlated noise on zero-noise extrapolation
• Fast Black-Box Quantum State Preparation
• Quantum computation of stopping power for inertial fusion target design
• Composite Toffoli gate with two-round error detection
• New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
• Quantum Error Correction for State Transfer in Noisy Spin Chains
• Quantum variational learning for quantum error-correcting codes
• Quantum algorithms for grid-based variational time evolution
• Simulating Molecular Spectroscopy with Circuit Quantum Electrodynamics
• Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
• Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
• Spin-free quantum computational simulations and symmetry adapted states
• Hardware-efficient fermionic simulation with a cavity-QED system
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Fault-tolerant fermionic quantum computation based on color code
• Quantum algorithms for the generalized eigenvalue problem
• Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Analyzing many-body localization with a quantum computer
• First-quantized eigensolver for ground and excited states of electrons under a uniform magnetic field
• A framework for exact synthesis
• Novel Trotter formulas for digital quantum simulation
• Accelerating Quantum Algorithms with Precomputation
• Computational Chemistry on Quantum Computers: Ground state estimation
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Ancilla-free Quantum Adder with Sublinear Depth
• Optical Manipulation of Quantum Dot Electron Spin Qubits Using Microcavity Quantum Well Exciton-Polaritons
• Resource optimization for fault-tolerant quantum computing
• Ancilla Approximable Quantum State Transformations
• The impacts of optimization algorithm and basis size on the accuracy and efficiency of variational quantum eigensolver
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Weighted Quantum Channel Compiling through Proximal Policy Optimization
• On The Study Of Partial Qubit Hamiltonian For Efficient Molecular Simulation Using Variational Quantum Eigensolvers
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Accelerated spin-adapted ground state preparation with non-variational quantum algorithms
• Quantum Simulation of Nuclear Dynamics in First Quantization
• Matrix product states and first quantization