Quantum supremacy using a programmable superconducting processor

John M. Martinis, Sergio Boixo, Hartmut Neven, Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Fernando G. S. L. Brandao, David A. Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, Austin Fowler, Craig Gidney, Marissa Giustina, Rob Graff … & Adam Zalcman
The tantalizing 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 using a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 ∼ 10^16. Measurements from repeated...
2 citations reported since publication in 2019.
15,133 views reported since publication in 2019.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?
1,157 downloads reported since publication in 2019.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?