7.2k citations · 7.2k across the 10 of their papers we have counts for
18 papers
Offloading Quantum Computation by Superposition Masking
Samuel Jaques, Craig Gidney
Error correction will add so much overhead to large quantum computations that we suspect the most efficient algorithms will use a classical co-processor to do as much work as possi…
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…
Learning Non-Markovian Quantum Noise from Moiré-Enhanced Swap Spectroscopy with Deep Evolutionary Algorithm
Murphy Yuezhen Niu, Vadim Smelyanskyi, Paul Klimov +30
Two-level-system (TLS) defects in amorphous dielectrics are a major source of noise and decoherence in solid-state qubits. Gate-dependent non-Markovian errors caused by TLS-qubit c…
Surface code dislocations have code distance L+O(1)
Craig Gidney
In [Hastings et al 2014] it is stated that the code distance of a logical qubit stored using dislocations is 2L + O(1), where L is the separation between the dislocation twists. Th…
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute, Kunal Arya, Ryan Babbush +74
This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 201…