Corpus ID: 7442496

Can quantum chemistry be performed on a small quantum computer

  title={Can quantum chemistry be performed on a small quantum computer},
  author={D. Wecker and B. Bauer and B. Clark and M. Hastings and M. Troyer},
As quantum computing technology improves and quantum computers with a small but non-trivial number of N ≥ 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman’s original proposal of simulating quantum systems, and in particular the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to… Expand

Figures and Tables from this paper

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-quantizedExpand
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. Expand
Lowering qubit requirements for quantum simulations of fermionic systems.
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting theExpand
New methods for Quantum Compiling
I show an exact synthesis algorithm for unitaries generated by Clifford+T circuits requiring exponentially less number of gates than previous state of the art, which might make certain interesting quantum computations possible several years earlier. Expand
How to test the “quantumness” of a quantum computer?
Recent devices, using hundreds of superconducting quantum bits, claim to perform quantum computing. However, it is not an easy task to determine and quantify the degree of quantum coherence andExpand
Fermion-to-qubit mappings with varying resource requirements for quantum simulation
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting theExpand
Adiabatic Quantum Simulation of Quantum Chemistry
A procedure to map electronic structure Hamiltonians to 2-body qubit Hamiltonians with a small set of physically realizable couplings with precision requirements on the coupling strengths and a number of ancilla qubits that scale polynomially in the problem size is described. Expand
The Trotter step size required for accurate quantum simulation of quantum chemistry
This study presents an alternative simulation scheme and shows that it can sometimes outperform existing schemes, but that this possibility depends crucially on the details of the simulated molecule. Expand
Adiabatic state preparation study of methylene.
This work applies the adiabatic state preparation approach to preparation of the lowest lying multireference singlet electronic state of methylene and numerically investigate preparation of this state at different molecular geometries and proposes modifications that lead to speeding up the preparation process. Expand
Quantum Simulation of Helium Hydride Cation in a Solid-State Spin Register.
This work uses a solid-state quantum register realized in a nitrogen-vacancy defect in diamond to compute the bond dissociation curve of the minimal basis helium hydride cation, HeH(+), with an energy uncertainty of 10(-14) hartree, which is 10 orders of magnitude below the desired chemical precision. Expand


Quantum information science and its contributions to mathematics : American Mathematical Society Short Course, January 3-4, 2009, Washington, DC
This volume consists of two papers giving introductory surveys of many of the important topics in the newly emerging field of quantum computation and quantum information, i.e., quantum information science (QIS). Expand
Quantum Information
  • S. Barnett
  • Computer Science
  • Oxford Master Series in Atomic, Optical, and Laser Physics
  • 2009
The intention is to introduce readers at this level to the fundamental, but rather simple, ideas behind ground-breaking developments including quantum cryptography, teleportation and quantum computing. Expand
Theory of quantum computation
Short review article on quantum computation accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also this http URL
Reports on Progress in Physics
WHEN introduced in 1934, “Reports on Progress in Physics’ was intended to be a series of annual reports. In 1942, owing to the need for economy in time and material, a change in policy was made, forExpand
Communications in Mathematical Physics The Pearcey Process
The extended Airy kernel describes the space-time correlation functions for the Airy process, which is the limiting process for a polynuclear growth model. The Airy functions themselves are given byExpand
Classical and Quantum Computation
Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.
Factorization of a 768-Bit RSA Modulus
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
Proceedings of the National Academy of Sciences, USA
The song below is a talking blues in the style of Woody Guthrie, written by Joel Herskowitz, a pediatric neurologist working in Boston, and sung by Joel and his brother Ira. Expand
Molecular Physics 109
  • 735
  • 2011
  • Math. Phys. 270, 359
  • 2007