Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets

  title={Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets},
  author={Abhinav Kandala and Antonio Mezzacapo and Kristan Temme and Maika Takita and Markus Brink and Jerry M. Chow and Jay M. Gambetta},
Quantum computers can be used to address electronic-structure problems and problems in materials science and condensed matter physics that can be formulated as interacting fermionic problems, problems which stretch the limits of existing high-performance computers. Finding exact solutions to such problems numerically has a computational cost that scales exponentially with the size of the system, and Monte Carlo methods are unsuitable owing to the fermionic sign problem. These limitations of… 

Quantum Chemistry and the Variational Quantum Eigensolver

Quantum Computation promises very large speed ups with respect to normal, classical computers on specific problems. Examples include prime-factoring and database searching. These applications are far

Dynamical mean field theory algorithm and experiment on quantum computers

An alternative approach is proposed, which uses the variational quantum eigensolver (VQE) method for ground and excited states to obtain the needed quantities as part of an exact diagonalization impurity solver.

Variational Quantum Eigensolver for Frustrated Quantum Systems

This work considers the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions with competing nearest- and next-nearest-neighbor interactions and studies the barren plateau phenomenon for the Hamiltonian in question.

A Full Quantum Eigensolver for Quantum Chemistry Simulations

This work proposes a full quantum eigensolver (FQE) algorithm to calculate the molecular ground energies and electronic structures using quantum gradient descent to remove the classical optimizer and perform all the calculations on a quantum computer with faster convergence.

Optimizing electronic structure simulations on a trapped-ion quantum computer using problem decomposition

An end-to-end pipeline that focuses on minimizing quantum resources while maintaining accuracy is experimentally demonstrated, and an early demonstration of the potential for problem decomposition to accurately simulate large molecules on quantum hardware is demonstrated.

Quantum simulations of materials on near-term quantum computers

Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a

Toward practical quantum embedding simulation of realistic chemical systems on near-term quantum computers

Quantum computing has recently exhibited great potential in predicting chemical properties for various applications in drug discovery, material design, and catalyst optimization. Progress has been

Resource Efficient Chemistry on Quantum Computers with the Variational Quantum Eigensolver and The Double Unitary Coupled-Cluster Approach.

This work employs the double unitary coupled-cluster (DUCC) method to effectively downfold correlation effects into the reduced-size orbital space, commonly referred to as the active space, and demonstrates that properly constructed effective Hamiltonians can capture the effect of the whole orbital space in small-size active spaces.

Hybrid Quantum-Classical Eigensolver without Variation or Parametric Gates

The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here, we

Numerical hardware-efficient variational quantum simulation of a soliton solution

It is argued that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure, which naturally limits the application range of variational quantum computing to solve quantum simulation tasks.



Progress towards practical quantum variational algorithms

The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the

A variational eigenvalue solver on a photonic quantum processor

The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.

Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz

The application of VQE to the simulation of molecular energies using the unitary coupled cluster (UCC) ansatz is studied and an analytical method to compute the energy gradient is proposed that reduces the sampling cost for gradient estimation by several orders of magnitude compared to numerical gradients.

Towards quantum chemistry on a quantum computer.

The application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis is reported and the complete energy spectrum is calculated to 20 bits of precision.

The theory of variational hybrid quantum-classical algorithms

The concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device is introduced and the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

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.

Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States

This work provides evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channel model of variational state preparation and develops a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources.

Quantum Algorithms for Fixed Qubit Architectures

Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or

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.

Tapering off qubits to simulate fermionic Hamiltonians

It is shown that encodings with a given filling fraction $\nu=N/M$ and a qubit-per-mode ratio $\eta=Q/M<1$ can be constructed from efficiently decodable classical LDPC codes with the relative distance $2\nu$ and the encoding rate $1-\eta$.