| | |
| | |
Stat |
Members: 3645 Articles: 2'503'724 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
Quantum Computing, Postselection, and Probabilistic Polynomial-Time | Scott Aaronson
; | Date: |
23 Dec 2004 | Subject: | Quantum Physics; Computational Complexity | quant-ph cs.CC | Abstract: | I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and Reingold. This illustrates that quantum computing can yield new and simpler proofs of major results about classical computation. | Source: | arXiv, quant-ph/0412187 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |