Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR11-103 | 31st July 2011 11:31

BQP and PPAD

RSS-Feed




TR11-103
Authors: Yang Li
Publication: 2nd August 2011 01:24
Downloads: 1322
Keywords: 


Abstract:

We initiate the study of the relationship between two complexity classes, BQP
(Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument,
Directed). We first give a conjecture that PPAD is contained in BQP, and show
a necessary and sufficient condition for the conjecture to hold. Then we prove
that the conjecture is not true under the oracle model. In the end, we raise
some interesting open problems/future directions.



ISSN 1433-8092 | Imprint