QUANTUM COMPUTING

Quantum supremacy, here we come

It’s still unclear which problems can be solved by near-term quantum computers that are beyond the reach of their classical counterparts. A new analysis makes a practical assessment of how sampling the output of a quantum circuit leaves supercomputers in the dust.

Access options

Rent or Buy article

Get time limited or full article access on ReadCube.

from$8.99

All prices are NET prices.

References

  1. 1.

    Boixo, S. et al. Nat. Phys. https://doi.org/10.1038/s41567-018-0124-x (2018).

    ADS  Article  Google Scholar 

  2. 2.

    Harrow, A. & Montanaro, A. Nature 549, 203–209 (2017).

    ADS  Article  Google Scholar 

  3. 3.

    Häner, T. & Steiger, D. S. in Proc. Int. Conf. High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1145/3126908.3126947 (2017).

  4. 4.

    Pednault, E. et al. Preprint at https://arxiv.org/abs/1710.05867 (2017).

  5. 5.

    Kelly, J. et al. Nature 519, 66–69 (2015).

    ADS  Article  Google Scholar 

  6. 6.

    Aharonov, D. & Vazirani, U. in Computability: Gödel, Turing, Church, and Beyond (eds Copeland, B. J., Posy, C. J. & Shagrir, O.) Ch. 11 (MIT Press, Cambridge, MA, 2012).

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Barbara M. Terhal.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Terhal, B.M. Quantum supremacy, here we come. Nature Phys 14, 530–531 (2018). https://doi.org/10.1038/s41567-018-0131-y

Download citation

Further reading

Search

Sign up for the Nature Briefing newsletter for a daily update on COVID-19 science.
Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing