Quantum interpretations of AWPP and APP
Tomoyuki Morimae, Harumichi Nishimura

TL;DR
This paper provides a quantum physical interpretation of the complexity class AWPP, linking it to quantum computation with postselection, and extends this interpretation to APP, offering insights into their physical significance.
Contribution
It introduces a quantum physical interpretation of AWPP and APP, connecting these classes to quantum postselection and classical analogues, enhancing understanding of their computational significance.
Findings
AWPP equals problems solvable by quantum computers with postselection near an FP probability
Provides a quantum physical interpretation of APP based on AWPP
Shows classical analogue: a restricted BPP path class contains UP∩coUP and is contained in WAPP
Abstract
AWPP is a complexity class introduced by Fenner, Fortnow, Kurtz, and Li, which is defined using GapP functions. Although it is an important class as the best upperbound of BQP, its definition seems to be somehow artificial, and therefore it would be better if we have some "physical interpretation" of AWPP. Here we provide a quantum physical interpretation of AWPP: we show that AWPP is equal to the class of problems efficiently solved by a quantum computer with the ability of postselecting an event whose probability is close to an FP function. This result is applied to also obtain a quantum physical interpretation of APP. In addition, we consider "classical physical analogue" of these results, and show that a restricted version of contains and is contained in WAPP.
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
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Machine Learning and Algorithms
