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, access via your institution
Access options
Access Nature and 54 other Nature Portfolio journals
Get Nature+, our best-value online-access subscription
$32.99 / 30 days
cancel any time
Subscribe to this journal
Receive 12 print issues and online access
$259.00 per year
only $21.58 per issue
Rent or buy this article
Prices vary by article type
from$1.95
to$39.95
Prices may be subject to local taxes which are calculated during checkout
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:
Version of record:
Issue date:
DOI: https://doi.org/10.1038/s41567-018-0131-y
