Quantum supremacy using a programmable superconducting processor
- F. Arute, K. Arya, J. Martinis
- Physics, Computer ScienceNature
- 23 October 2019
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Surface codes: Towards practical large-scale quantum computation
- A. Fowler, M. Mariantoni, J. Martinis, A. Cleland
- Physics, Computer Science
- 4 August 2012
The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- R. Babbush, C. Gidney, H. Neven
- Computer SciencePhysical Review X
- 9 May 2018
Compiling to surface code fault-tolerant gates and assuming per gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods.
Scalable Quantum Simulation of Molecular Energies
- P. O’Malley, R. Babbush, J. Martinis
- Physics
- 21 December 2015
We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits to compute the…
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.
Surface code quantum computing by lattice surgery
- Clare Horsman, A. Fowler, S. Devitt, R. V. Meter
- Computer Science
- 17 November 2011
This paper introduces a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer, and shows how lattice surgery allows us to distribute encoded GHZ states in a more direct manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits.
High-threshold universal quantum computation on the surface code
- A. Fowler, A. Stephens, P. Groszkowski
- Physics, Computer Science
- 3 March 2008
A comprehensive and self-contained simplified review of the quantum computing scheme of Phys.
Superconducting quantum circuits at the surface code threshold for fault tolerance
- R. Barends, J. Kelly, J. Martinis
- Physics, Computer ScienceNature
- 24 April 2014
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
State preservation by repetitive error detection in a superconducting quantum circuit
- J. Kelly, R. Barends, J. Martinis
- PhysicsNature
- 26 November 2014
The protection of classical states from environmental bit-flip errors is reported and the suppression of these errors with increasing system size is demonstrated, motivating further research into the many challenges associated with building a large-scale superconducting quantum computer.
Towards practical classical processing for the surface code.
- A. Fowler, Adam C. Whiteside, L. Hollenberg
- Computer SciencePhysical Review Letters
- 24 October 2011
This work shows how to perform the processing associated with an n×n lattice of qubits, each being manipulated in a realistic, fault-tolerant manner, in O(n2) average time per round of error correction.
...
...