7.2k citations · 15.8k across the 72 of their papers we have counts for
10 papers · 1 filter
Accurately computing electronic properties of a quantum ring
C. Neill, T. McCourt, X. Mi +89
A promising approach to study condensed-matter systems is to simulate them on an engineered quantum platform. However, achieving the accuracy needed to outperform classical methods…
Virtual Distillation for Quantum Error Mitigation
William J. Huggins, Sam McArdle, Thomas E. O'Brien +6
Contemporary quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations, even with a large number of qubits. Quantum err…
Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
Frank Arute, Kunal Arya, Ryan Babbush +96
Strongly correlated quantum systems give rise to many exotic physical phenomena, including high-temperature superconductivity. Simulating these systems on quantum computers may avo…
Error mitigation via verified phase estimation
Thomas E. O'Brien, Stefano Polla, Nicholas C. Rubin +5
The accumulation of noise in quantum computers is the dominant issue stymieing the push of quantum algorithms beyond their classical counterparts. We do not expect to be able to af…
Fermionic partial tomography via classical shadows
Andrew Zhao, Nicholas C. Rubin, Akimasa Miyake
We propose a tomographic protocol for estimating any -body reduced density matrix (-RDM) of an -mode fermionic state, a ubiquitous step in near-term quantum algorith…
Low depth mechanisms for quantum optimization
Jarrod R. McClean, Matthew P. Harrigan, Masoud Mohseni +6
One of the major application areas of interest for both near-term and fault-tolerant quantum computers is the optimization of classical objective functions. In this work, we develo…
Using models to improve optimizers for variational quantum algorithms
Kevin J. Sung, Jiahao Yao, Matthew P. Harrigan +5
Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization out…
Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley +83
We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algor…
Hartree-Fock on a superconducting qubit quantum computer
Frank Arute, Kunal Arya, Ryan Babbush +79
As the search continues for useful applications of noisy intermediate scale quantum devices, variational simulations of fermionic systems remain one of the most promising direction…
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
B. Foxen, C. Neill, A. Dunsworth +54
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms…