Simulating chemistry using quantum computers
arXiv:1007.2648 · doi:10.1146/annurev-physchem-032210-103512
Abstract
The difficulty of simulating quantum systems, well-known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.
27 pages. Submitted to Ann. Rev. Phys. Chem
References in corpus (30)
- Non-Abelian Anyons and Topological Quantum Computation
- Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Optical Quantum Computing
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Universal computation by quantum walk
- Superconducting Circuits and Quantum Information
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- Creating superpositions that correspond to efficiently integrable probability distributions
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Optimal Quantum Measurements of Expectation Values of Observables
- Quantum Simulations of Classical Annealing Processes
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Using Quantum Computers for Quantum Simulation
- Speed-up via Quantum Sampling
- Quantum NP - A Survey
- Quantum simulation of the single-particle Schrodinger equation
- A Quantum Approach to Classical Statistical Mechanics
- Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
- Preparation of many-body states for quantum simulation
- Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
- Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer
- Quantum Computing of Quantum Chaos in the Kicked Rotator Model
- Modelling chemical reactions using semiconductor quantum dots
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- Wavefunction preparation and resampling using a quantum computer
- Scalable Superconducting Architecture for Adiabatic Quantum Computation
- Quantum Networks for Generating Arbitrary Quantum States
- Observation of Co-tunneling in Pairs of Coupled Flux Qubits
- Quantum Computational Method of Finding the Ground State Energy and Expectation Values