activity
20082026
most citedSupplementary information for "Quantum supremacy using a programmable superconducting processor"

7.2k citations · 24.9k across the 107 of their papers we have counts for

collaborators
Showing 2020 · quant-phShow all

11 papers · 2 filters

quant-ph2020★ 69 cited

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…

quant-ph2020★ 148 cited

Focus beyond quadratic speedups for error-corrected quantum advantage

Ryan Babbush, Jarrod McClean, Michael Newman +3

In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algor…

quant-ph2020★ 746 cited

Power of data in quantum machine learning

Hsin-Yuan Huang, Michael Broughton, Masoud Mohseni +4

The use of quantum computing for machine learning is among the most exciting prospective applications of quantum technologies. However, machine learning tasks where data is provide…

quant-ph2020★ 5 cited

Learnability and Complexity of Quantum Samples

Murphy Yuezhen Niu, Andrew M. Dai, Li Li +5

Given a quantum circuit, a quantum computer can sample the output distribution exponentially faster in the number of bits than classical computers. A similar exponential separation…

quant-ph2020★ 95 cited

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…

quant-ph2020★ 46 cited

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…

quant-ph2020★ 100 cited

Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization

Yuval R. Sanders, Dominic W. Berry, Pedro C. S. Costa +5

Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits…

quant-ph2020★ 24 cited

The Snake Optimizer for Learning Quantum Processor Control Parameters

Paul V. Klimov, Julian Kelly, John M. Martinis +1

High performance quantum computing requires a calibration system that learns optimal control parameters much faster than system drift. In some cases, the learning procedure require…

quant-ph2020★ 469 cited

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…

quant-ph2020★ 731 cited

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…

quant-ph2020★ 312 cited

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…