Publication record · 18.cifr/2019.arute.quantum-supremacy-xeb
18.cifr/2019.arute.quantum-supremacy-xebThe promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53. Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times — our classical simulations indicate that it would take 10,000 years for the equivalent task on a state-of-the-art classical supercomputer.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
Demonstrating quantum advantage on practically useful problems (chemistry, optimization) remains open. The authors call for lower two-qubit gate error rates and a path to fault-tolerant logical qubits. Classical simulation improvements (tensor networks) continue to push back the supremacy boundary, motivating ongoing hardware-algorithm benchmarking races.