Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Computer Science > Computational Complexity

arXiv:1111.3125 (cs)
[Submitted on 14 Nov 2011]

Title:Proving the power of postselection

Authors:Abuzer Yakaryilmaz, A. C. Cem Say
View a PDF of the paper titled Proving the power of postselection, by Abuzer Yakaryilmaz and A. C. Cem Say
View PDF HTML (experimental)
Abstract:It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition power of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machines with postselection are more powerful than their probabilistic counterparts with the same resource restrictions. We approach these problems by imposing additional constraints on the resources to be used by the computer, and are able to prove for the first time that postselection does augment the computational power of both classical and quantum computers, and that quantum does outperform probabilistic in this context, under simultaneous time and space bounds in a certain range. We also look at postselected versions of space-bounded classes, as well as those corresponding to error-free and one-sided error recognition, and provide classical characterizations. It is shown that $\mathsf{NL}$ would equal $\mathsf{RL}$ if the randomized machines had the postselection capability.
Comments: 26 pages. This is a heavily improved version of arXiv:1102.0666
Subjects: Computational Complexity (cs.CC); Quantum Physics (quant-ph)
Cite as: arXiv:1111.3125 [cs.CC]
  (or arXiv:1111.3125v1 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.1111.3125
arXiv-issued DOI via DataCite
Journal reference: Fundamenta Informaticae, Vol. 123, No. 1, pp. 107-134, 2013
Related DOI: https://doi.org/10.3233/FI-2013-803
DOI(s) linking to related resources

Submission history

From: Abuzer Yakaryilmaz [view email]
[v1] Mon, 14 Nov 2011 08:02:36 UTC (38 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Proving the power of postselection, by Abuzer Yakaryilmaz and A. C. Cem Say
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Additional Features

  • Audio Summary

Current browse context:

cs.CC
< prev   |   next >
new | recent | 2011-11
Change to browse by:
cs
quant-ph

References & Citations

  • INSPIRE HEP
  • SciX
  • Google Scholar
  • Semantic Scholar

1 blog link

(what is this?)

DBLP - CS Bibliography

listing | bibtex
Abuzer Yakaryilmaz
A. C. Cem Say
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)