activity
20122026
most citedFrom the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

768 citations · 2.6k across the 25 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

quant-ph2019★ 146 cited

A Non-Orthogonal Variational Quantum Eigensolver

William J. Huggins, Joonho Lee, Unpil Baek +2

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…

quant-ph2019★ 2 cited

Discontinuous Galerkin discretization for quantum simulation of chemistry

Jarrod R. McClean, Fabian M. Faulstich, Qinyi Zhu +5

Methods for electronic structure based on Gaussian and molecular orbital discretizations offer a well established, compact representation that forms much of the foundation of corre…

cs.DS2019★ 4 cited

Parameterization of tensor network contraction

Bryan O'Gorman

We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to te…

quant-ph2019★ 68 cited

Generalized swap networks for near-term quantum computing

Bryan O'Gorman, William J. Huggins, Eleanor G. Rieffel +1

The practical use of many types of near-term quantum computers requires accounting for their limited connectivity. One way of overcoming limited connectivity is to insert swaps in…

quant-ph2019★ 11 cited

From Ansätze to Z-gates: a NASA View of Quantum Computing

Eleanor G. Rieffel, Stuart Hadfield, Tad Hogg +12

For the last few years, the NASA Quantum Artificial Intelligence Laboratory (QuAIL) has been performing research to assess the potential impact of quantum computers on challenging…