NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

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

Published

Author(s)

Stephen P. Jordan

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.
Citation
XRDS: crossroads (ACM's undergraduate magazine)
Volume
23
Issue
1
Pub Type
Others

Download Paper

DOI Link

Keywords

quantum computing, complexity theory
Quantum information science

Citation

Jordan, S. (2016), Black holes, quantum mechanics, and the limits of polynomial-time computability, XRDS: crossroads (ACM's undergraduate magazine), [online], https://doi.org/10.1145/2983539 (Accessed October 14, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created September 1, 2016, Updated November 10, 2018
Was this page helpful?