Faster quantum chemistry simulation on fault-tolerant quantum computers
From MaRDI portal
Publication:5137802
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.}, extbf{6}:81, 2006]. For a given approximation error , arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is or ; 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.
Recommendations
- Toward the first quantum simulation with quantum speedup
- Exponentially more precise quantum simulation of fermions in second quantization
- Hartree-Fock on a superconducting qubit quantum computer
- Faster ground state preparation and high-precision ground energy estimation with fewer qubits
- Efficient Algorithms for Universal Quantum Simulation
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- A logarithmic-depth quantum carry-lookahead adder
- Constructing arbitrary Steane code single logical qubit fault-tolerant gates
- Effective fault-tolerant quantum computation with slow measurements
- Fast quantum modular exponentiation
- Higher order decompositions of ordered operator exponentials
- Quantum algorithms revisited
- Quantum fan-out is powerful
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Simulating quantum mechanics on a quantum computer.
- Simulating quantum systems on a quantum computer
- The Solovay--Kitaev algorithm
- Universal Quantum Simulators
- Using quantum computers for quantum simulation
Cited in
(16)- The variational quantum eigensolver: a review of methods and best practices
- Divide and conquer approach to quantum Hamiltonian simulation
- Application of fermionic marginal constraints to hybrid quantum algorithms
- T-count optimized Wallace tree integer multiplier for quantum computing
- Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions
- Ancilla-approximable quantum state transformations
- Quantum adder for superposition states
- Bounding the costs of quantum simulation of many-body physics in real space
- Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
- Exponentially more precise quantum simulation of fermions in second quantization
- Floating point representations in quantum circuit synthesis
- Quantum algorithms for the generalized eigenvalue problem
- Toward the first quantum simulation with quantum speedup
- scientific article; zbMATH DE number 7679311 (Why is no real title available?)
- Hierarchical system mapping for large-scale fault-tolerant quantum computing
- Two-qubit stabilizer circuits with recovery. II: Analysis
This page was built for publication: Faster quantum chemistry simulation on fault-tolerant quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137802)
