Quantum algorithm for obtaining the energy spectrum of molecular systems.

  title={Quantum algorithm for obtaining the energy spectrum of molecular systems.},
  author={Hefeng Wang and Sabre Kais and Al{\'a}n Aspuru-Guzik and Mark R. Hoffmann},
  journal={Physical chemistry chemical physics : PCCP},
  volume={10 35},
Simulating a quantum system is more efficient on a quantum computer than on a classical computer. The time required for solving the Schrödinger equation to obtain molecular energies has been demonstrated to scale polynomially with system size on a quantum computer, in contrast to the well-known result of exponential scaling on a classical computer. In this paper, we present a quantum algorithm to obtain the energy spectrum of molecular systems based on the multiconfigurational self-consistent… 

Figures and Tables from this paper

Quantum Computing Resource Estimate of Molecular Energy Simulation
Over the last century, ingenious physical and mathematical insights paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, efficient
At the intersection of quantum computing and quantum chemistry
Quantum chemistry is concerned with solving the Schrodinger equation for chemically relevant systems. This is typically done by making useful and systematic approximations which form the basis for
Relativistic quantum chemistry on quantum computers
The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very
Quantum Chemistry on Quantum Computers: A Method for Preparation of Multiconfigurational Wave Functions on Quantum Computers without Performing Post-Hartree–Fock Calculations
This work proposes a method to construct multiconfigurational initial guess wave functions suitable for QPEA-based full-CI calculations on quantum computers, by utilizing diradical characters computed from spin-projected UHF wave functions.
A quantum–quantum Metropolis algorithm
This work presents a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain, and offers a quantum speedup relative to the classical counterpart.
Quantum Chemistry on Quantum Computers: A Polynomial-Time Quantum Algorithm for Constructing the Wave Functions of Open-Shell Molecules.
A quantum algorithm is proposed to construct the wave function consisting of one configuration state function, which is suitable for the initial guess wave function in QPE-based FCI calculations of open-shell molecules, based on the addition theorem of angular momentum.
Assessing the Precision of Quantum Simulation of Many-Body Effects in Atomic Systems Using the Variational Quantum Eigensolver Algorithm
The emerging field of quantum simulation of many-body systems is widely recognized as a very important application of quantum computing. A crucial step towards its realization in the context of
Wave Function Adapted Hamiltonians for Quantum Computing.
A modified VQE scheme in which the form of the molecular Hamiltonian is adapted to the circuit ansatz through an optimization procedure and is able to recover a significant amount of electron correlation even with only empirical ansatzes with shallow circuit depth.
Quantum algorithm for simulating the dynamics of an open quantum system
In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the
Quantum Simulation of Resonant Transitions for Solving the Eigenproblem of an Effective Water Hamiltonian.
This work experimentally demonstrate a quantum algorithm which could solve the energy levels and eigenstates of a large physical system on a classical computer via simulated resonant transitions and makes use of this algorithm to efficiently prepare specific eigen states on the simulator according to the measured eigenenergies.


Simulated Quantum Computation of Molecular Energies
Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm and mapping of the molecular wave function to the quantum bits are described.
Simulating quantum systems on a quantum computer
  • Christof Zalka
  • Physics, Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
It is shown that the time evolution of the wave function of a quantum–mechanical many–particle system can be simulated precisely and efficiently on a quantum computer, and that ultimately the simulation of quantum field theory might be possible on large quantum computers.
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Fast algorithms for simulating many body Fermi systems on a universal quantum computer are provided and a simulation of the Hubbard model is discussed in detail.
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
A new polynomial time quantum algorithm is described that uses the quantum fast Fourier transform to find eigenvalues and eigenvectors of a local Hamiltonian and that can be applied in cases for which all known classical algorithms require exponential time.
Quasiclassical computation.
  • F. Remacle, R. Levine
  • Physics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2004
A search problem, previously discussed in the quantum computing literature, is solved as an example and the solution requires the same number of function evaluations as in the quantal case.
Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement.
For the first time, the core processes, coherent control, and resultant entangled states required in a full-scale implementation of Shor's powerful quantum algorithm for factoring are demonstrated in a photonic system.
Macroconfigurations in molecular electronic structure theory
Based on the well-known idea of dividing a molecular orbital set into groups, and imposing restrictions on allowed group occupancies, a more general formalism, which we refer to as the
Calculating the thermal rate constant with exponential speedup on a quantum computer
It is shown how to formulate the ubiquitous quantum chemistry problem of calculating the thermal rate constant on a quantum computer. The resulting exact algorithm scales exponentially faster with
Demonstration of controlled-NOT quantum gates on a pair of superconducting quantum bits
Selective execution of the complete set of four different controlled-NOT (CNOT) quantum logic gates are demonstrated, by applying microwave pulses of appropriate frequency to a single pair of coupled flux qubits, to form an efficient set of versatile building blocks.