A non-orthogonal variational quantum eigensolver

Abstract

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H 4 and the the π-system of Hexatriene (C6H8). We show that it is possible to accurately capture the ground state of both systems using a linear combination of simpler ansatz circuits for which it is impossible individually. arXiv:1909.09114v1 [quant-ph]

Orbital optimized unitary coupled cluster theory for quantum computer

“…VQE calculations using actual quantum computers have already been performed for small molecules [16,[18][19][20][21][22][23]. Recently, researchers have proposed electron-correlation methods based on UCC for quantum computers [24][25][26][27][28][29][30][31][32][33].…”

Spin-projection for quantum computation: A low-depth approach to strong correlation

“…It should be emphasized that spin-projection attains remarkable accuracy in exchange for 1 ancilla qubit, albeit with little overhead in circuit depth (additional 4n CNOT gates). We note that one disadvantage of our scheme is the increase in the number of measurements, but it grows only linearly with N g as opposed to standard nonorthogonal methods that show a quadratic scaling [51]. Also, the scheme can potentially suffer from errors when a projected state is not suitable for dealing with strong correlation in the system [52,53].…”

A feasible approach for automatically differentiable unitary coupled-cluster on quantum computers

“…Our strategies to compile gradients can be done entirely in the fermionic representation making it independent of the used qubit mapping. The developed techniques combined with Tequilas automatic differentiation framework provide a testbed for quantum chemistry on quantum computers where new ideas, like low-depth approaches based on pair-natural orbitals 55 or Krylov subspaces, 74,75 can be prototyped and demonstrated in a blackboard fashion. Our implementation provides an easy to use, automatically differentiable framework for unitary-coupled cluster, that leverages state of the art high performance simulators 58,59 and is ready for emerging quantum computers.…”