How much of quantum mechanics is really needed to defy Extended Church-Turing Thesis?
Leonid Gurvits, Vwani Roychowdhury, Sudhir Kumar Singh, Farrokh Vatan
TL;DR
This paper investigates the extent to which quantum mechanics is necessary to challenge the Extended Church-Turing Thesis, exploring the theoretical boundaries of quantum computational power.
Contribution
It aims to clarify the minimal quantum assumptions required to potentially defy the Extended Church-Turing Thesis.
Findings
Analysis of quantum computational models
Discussion on the necessity of quantum features
Theoretical implications for computational complexity
Abstract
This paper has been withdrawn by the author as one of the coauthors needs institutional permission.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms