46 - BQP-Complete ProblemsZhang, Shengyu
BQP-Complete ProblemsThe concept of completeness is one of the most important notions in theoretical computer science. PromiseBQP-complete problems are those in PromiseBQP to which all other PromiseBQP problems can be reddoi:10.1007/978-3-540-92910-9_46Shengyu Zhang...
We show that this problem is BQP-complete. It can be solved efficiently on aquantum computer by repeatedly applying measurements of A to the jth basisvector and raising the outcome to the mth power. Conversely, every quantumcircuit that solves a problem in BQP can be encoded into a sparse ...
Wocjan. A Simple PromiseBQP-complete Matrix Problem. Theory of computing, 3(1):61-79, 2007.D. Janzing and P. Wocjan. A simple PromiseBQP-complete matrix problem. Theory of Computing, 3:61-79, 2007.Dominik Janzing and Pawel Wocjan. A simple PromiseBQP-complete matrix problem. Theory ...