Quantum supremacy using a programmable superconducting processor
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 2019-10-23
- Cited by
- 7,996
- References
- 131
- Access
- Open access
- OpenAlex
- https://openalex.org/W2982169647
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:204836822
Keywords
Quantum computer, Quantum, Realization (probability), Dimension (graph theory), Quantum algorithm
References
- Quantum theory of a bandpass Purcell filter for qubit readout
- Fast accurate state measurement with superconducting qubits.
- Scalable and robust randomized benchmarking of quantum processes.
- Fast adiabatic qubit gates using only σ z control
- The concentration of measure phenomenon
- An Introduction to Cartan's KAK Decomposition for QC Programmers
- Average-case complexity versus approximate simulation of commuting quantum computations
- Gaussian Noise Sensitivity and BosonSampling
- Estimating the coherence of noise
- On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis
- Charge-insensitive qubit design derived from the Cooper pair box
- Approaching unit visibility for control of a superconducting qubit with dispersive readout.
- Superconducting quantum circuits at the surface code threshold for fault tolerance
- Convergence conditions for random quantum circuits
- The Equivalence of Sampling and Searching
- Atomic physics and quantum optics using superconducting circuits
- Random quantum states
- Two-bit gates are universal for quantum computation.
- The computational complexity of linear optics
- Quantum complexity theory
Cited by
- Cooling photon-pressure circuits into the quantum regime
- Applied Cryptography and Network Security: 18th International Conference, ACNS 2020, Rome, Italy, October 19–22, 2020, Proceedings, Part I
- Gradient Density Estimation in Arbitrary Finite Dimensions Using the Method of Stationary Phase
- Correlation Measure Equivalence in Dynamic Causal Structures
- Practical
- Gate Set Tomography
- Teleportation through the wormhole
- The Road to Quantum Computational Supremacy
- Methods for classically simulating noisy networked quantum architectures
- Quantum Algorithm Implementations for Beginners
- How many qubits are needed for quantum computational supremacy?
- Low rank representations for quantum simulation of electronic structure
- Experimental cryptographic verification for near-term quantum cloud computing.
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Quantum computational chemistry
- A programmable three-qubit superconducting processor with all-to-all connectivity
- Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
- Quantum Zeno Dynamics from General Quantum Operations
- Multiple-shot and unambiguous discrimination of von Neumann measurements
- Entanglement concentration service for the quantum Internet
Related papers
- Multiple quantum terms in the fröhlich kinetic equation
- LETTER TO THE EDITOR: Rescattering and quantum interference near the classical cut-offs
- Charge transfer in positronium–proton collisions: comparison of classical and quantum-mechanical theories
- Vibrating skyrmions (II). Quantum corrections to masses
- Resonant d-wave interaction induced quantum droplet in dipolar atoms
- Effect of quantum fluctuation on oscillatory superradiance
- Few trapped quantum dipoles: quantum versus classical structures
- Small time behaviour of an unstable quantum system
- Exact analysis of a quantum mechanical maser model
- Experimental study of quantum fluctuations of polarisation in superradiance