• Corpus ID: 53066754

Bayesian optimisation for variational quantum eigensolvers

@inproceedings{Moseley2018BayesianOF,
  title={Bayesian optimisation for variational quantum eigensolvers},
  author={Ben Moseley and Michael Osborne and Simon C. Benjamin},
  year={2018}
}
We investigate the performance of Bayesian optimisation for finding the ground state energy of molecules with variational quantum eigensolvers. We implement a variational quantum eigensolver using a classical simulation of a quantum computer and search for the ground state energy of H2 and LiH molecules. We use the UCC ansatz circuit for H2 and a hardware-efficient ansatz circuit for LiH. When using a noiseless quantum computer simulation, Bayesian optimisation converges to the ground state… 

Figures from this paper

Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
TLDR
This work introduces a systematic technique for minimizing requisite state preparations by exploiting the simultaneous measurability of partitions of commuting Pauli strings, and encompasses algorithms for efficiently approximating a MIN-COMMUTING-PARTITION, as well as a synthesis tool for compiling simultaneous measurement circuits.
Optimizing quantum heuristics with meta-learning
TLDR
Evidence that indicates the meta-learner trained on small problems will generalize to larger problems is presented, an important indication that meta-learning and associated machine learning methods will be integral to the useful application of noisy near-term quantum computers.
Applying Bayesian Techniques to the Optimization of Parameterized Quantum Circuits
TLDR
This work proposes a Bayesian method to optimally configure a single parameter in a given quantum circuit and is significantly more tolerant to noise than the existing analytical approach and its variants.
$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
TLDR
A fast, precomputable procedure for creating linearly sized commuting partitions by solving a round-robin scheduling problem via flow networks and the statistical implication of simultaneous measurement is provided.
Computational chemistry on quantum computers
TLDR
Computational chemistry data for small molecules obtained by implementing the Unitary Coupled Cluster method with Single and Double excitations (UCCSD) on a quantum computer simulator is presented.

References

SHOWING 1-10 OF 29 REFERENCES
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
TLDR
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.
Variational quantum simulation of imaginary time evolution with applications in chemistry and beyond
TLDR
This work proposes a variational method for simulating imaginary time evolution on a quantum computer, using a hybrid algorithm that combines quantum and classical resources, and applies this technique to the problem of finding the ground state energy of many-particle Hamiltonians.
The theory of variational hybrid quantum-classical algorithms
TLDR
This work develops a variational adiabatic ansatz and explores unitary coupled cluster where it is shown how 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.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
TLDR
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2.
A variational eigenvalue solver on a photonic quantum processor
TLDR
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.
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
Simulated Quantum Computation of Molecular Energies
TLDR
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.
Barren plateaus in quantum neural network training landscapes
TLDR
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
Quantum Chemistry Calculations on a Trapped-Ion Quantum Simulator
Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to
The Bravyi-Kitaev transformation for quantum computation of electronic structure.
TLDR
An alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev, is developed that reduces the simulation cost to O(log n) qubit operations for one fermionic operation and demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure.
...
...