Closed timelike curves make quantum and classical computing equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to non-trivial insights into general relativity, quantum information and other areas. In this paper, we show that, if CTCs existed, quantum computers would be no more powerful than classical computers: bo...
Main Authors: | Aaronson, Scott, Watrous, John |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Royal Society of London
2010
|
Online Access: | http://hdl.handle.net/1721.1/52302 https://orcid.org/0000-0003-1333-4045 |
Similar Items
-
Closed Timelike Curves via Postselection: Theory and Experimental Test of Consistency
by: Lloyd, Seth, et al.
Published: (2011) -
Advice coins for classical and quantum computation
by: Aaronson, Scott, et al.
Published: (2012) -
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
by: Aaronson, Scott, et al.
Published: (2015) -
Twice upon a time: timelike-separated quantum extremal surfaces
by: Engelhardt, Netta, et al.
Published: (2024) -
The equivalence of sampling and searching
by: Aaronson, Scott
Published: (2012)