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.
This is a preview of subscription content, log in via an institution to check access.
References
Boixo, S. et al. Nat. Phys. https://doi.org/10.1038/s41567-018-0124-x (2018).
Harrow, A. & Montanaro, A. Nature 549, 203–209 (2017).
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).
Pednault, E. et al. Preprint at https://arxiv.org/abs/1710.05867 (2017).
Kelly, J. et al. Nature 519, 66–69 (2015).
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).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
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
Published:
Issue Date:
DOI: https://doi.org/10.1038/s41567-018-0131-y
- Springer Nature Limited
This article is cited by
-
Classically verifiable quantum advantage from a computational Bell test
Nature Physics (2022)
-
Multiplexed quantum transport using commercial off-the-shelf CMOS at sub-kelvin temperatures
npj Quantum Information (2020)
-
Restricted Boltzmann machines in quantum physics
Nature Physics (2019)