skip to main content
research-article

Black holes, quantum mechanics, and the limits of polynomial-time computability

Published: 20 September 2016 Publication History

Abstract

Which computational problems can be solved in polynomial-time and which cannot? Though seemingly technical, this question has wide-ranging implications and brings us to the heart of both theoretical computer science and modern physics.

References

[1]
Jordan, S.P., Lee, K.S.M. and Preskill, J. Quantum algorithms for quantum field theories. Science 336, 6085(2012), 1130--1133. arXiv:1111.3633.
[2]
Fortnow, L. What if P = NP?. Computational Complexity. Blog. May 25, 2004; http://blog.computationalcomplexity.org/2004/05/what-if-pnp.html
[3]
Bao, N. Bouland, A and Jordan, S.P. Grover search and the no-signaling principle. 2015. arXiv:1511.00657.

Cited By

View all
  • (2021)Toward simulating superstring/M-theory on a quantum computerJournal of High Energy Physics10.1007/JHEP07(2021)1402021:7Online publication date: 20-Jul-2021
  • (2020)Quantum simulation of quantum field theories as quantum chemistryJournal of High Energy Physics10.1007/JHEP12(2020)0112020:12Online publication date: 2-Dec-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image XRDS: Crossroads, The ACM Magazine for Students
XRDS: Crossroads, The ACM Magazine for Students  Volume 23, Issue 1
Quantum Computing
Fall 2016
63 pages
ISSN:1528-4972
EISSN:1528-4980
DOI:10.1145/3000591
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2016
Published in XRDS Volume 23, Issue 1

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Popular
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Toward simulating superstring/M-theory on a quantum computerJournal of High Energy Physics10.1007/JHEP07(2021)1402021:7Online publication date: 20-Jul-2021
  • (2020)Quantum simulation of quantum field theories as quantum chemistryJournal of High Energy Physics10.1007/JHEP12(2020)0112020:12Online publication date: 2-Dec-2020

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media