BQP Complexity Class Diagram

In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.Michael Nielsen and Isaac Chuang (2000). ''Quantum Computation and Quantum Information''. Cambridge: Cambridge University Press. . It is the quantum analogue to the complexity class BPP.

A decision problem is a member of BQP if there exists a quantum algorithm (an algorithm that runs on a quantum computer) that solves the decision problem with high probability and is guaranteed to run in polynomial time. A run of the algorithm will correctly solve the decision problem with a probability of at least 2/3.

Definition

BQP can be viewed as the languages associated with certain bounded-error uniform families of quantum circuits. A language ''L'' is in BQP if and only if there exists a polynomial-time uniform family of quantum circuits $\$, such that
* For all $n \in \mathbb$, ''Q_n'' takes ''n'' qubits as input and outputs 1 bit
* For all ''x'' in ''L'', $\mathrm(Q_(x)=1)\geq \tfrac$
* For all ''x'' not in ''L'', $\mathrm(Q_(x)=0)\geq \tfrac$

Alternatively, one can define BQP in terms of quantum Turing machines. A language ''L'' is in BQP if and only if there exists a polynomial quantum Turing machine that accepts ''L'' with an error probability of at most 1/3 for all instances.

Similarly to other "bounded error" probabilistic classes, the choice of 1/3 in the definition is arbitrary. We can run the algorithm a constant number of times and take a majority vote to achieve any desired probability of correctness less than 1, using the Chernoff bound. The complexity class is unchanged by allowing error as high as 1/2 − ''n''^−''c'' on the one hand, or requiring error as small as 2^−''nc'' on the other hand, where ''c'' is any positive constant, and ''n'' is the length of input.

Relationship to other complexity classes

BQP is defined for quantum computers; the corresponding complexity class for classical computers (or more formally for probabilistic Turing machines) is BPP. Just like P and BPP, BQP is low for itself, which means . Informally, this is true because polynomial time algorithms are closed under composition. If a polynomial time algorithm calls polynomial time algorithms as subroutines, the resulting algorithm is still polynomial time.

BQP contains P and BPP and is contained in AWPP, PP and PSPACE.
In fact, BQP is low for PP, meaning that a PP machine achieves no benefit from being able to solve BQP problems instantly, an indication of the possible difference in power between these similar classes. The known relationships with classic complexity classes are:
:$\mathsf$

As the problem of has not yet been solved, the proof of inequality between BQP and classes mentioned above is supposed to be difficult. The relation between BQP and NP is not known. In May 2018, computer scientists Ran Raz of Princeton University and Avishay Tal of Stanford University published a paper which showed that, relative to an oracle, BQP was not contained in PH. It can be proven that there exists an oracle A such that $\mathsf^\mathrm\nsubseteq\mathsf^\mathrm$. In an extremely informal sense, this can be thought of as giving PH and BQP an identical, but additional, capability and verifying that BQP with the oracle (BQP^A) can do things PH^A cannot. While an oracle separation has been proven, the fact that BQP is not contained in PH has not been proven. An oracle separation does not prove whether or not complexity classes are the same. The oracle separation gives intuition that BQP may not be contained in PH.

It has been suspected for many years that Fourier Sampling is a problem that exists within BQP, but not within the polynomial hierarchy. Recent conjectures have provided evidence that a similar problem, Fourier Checking, also exists in the class BQP without being contained in the polynomial hierarchy. This conjecture is especially notable because it suggests that problems existing in BQP could be classified as harder than NP-Complete problems. Paired with the fact that many practical BQP problems are suspected to exist outside of P (it is suspected and not verified because there is no proof that P ≠ NP), this illustrates the potential power of quantum computing in relation to classical computing.

Adding postselection to BQP results in the complexity class PostBQP which is equal to PP.. Preprint available a

/ref>

A complete problem for Promise-BQP

Promise-BQP is the class of promise problem, promise problems that can be solved by a uniform family of quantum circuits (i.e., within BQP). Completeness proofs focus on this version of BQP. Similar to the notion of NP-completeness and other complete problems, we can define a complete problem as a problem that is in Promise-BQP and that every other problem in Promise-BQP reduces to it in polynomial time.

APPROX-QCIRCUIT-PROB

The APPROX-QCIRCUIT-PROB problem is complete for efficient quantum computation, and the version presented below is complete for the Promise-BQP complexity class (and not for the total BQP complexity class, for which no complete problems are known). APPROX-QCIRCUIT-PROB's completeness makes it useful for proofs showing the relationships between other complexity classes and BQP.

Given a description of a quantum circuit acting on qubits with gates, where is a polynomial in and each gate acts on one or two qubits, and two numbers \alpha, \beta \in ,1 \alpha > \beta, distinguish between the following two cases:
* measuring the first qubit of the state $C, 0\rangle^$ yields $, 1\rangle$ with probability $\geq \alpha$
* measuring the first qubit of the state $C, 0\rangle^$ yields $, 1\rangle$ with probability $\leq \beta$

Here, there is a promise on the inputs as the problem does not specify the behavior if an instance is not covered by these two cases.

Claim. Any BQP problem reduces to APPROX-QCIRCUIT-PROB.

Proof.
Suppose we have an algorithm that solves APPROX-QCIRCUIT-PROB, i.e., given a quantum circuit acting on qubits, and two numbers \alpha, \beta \in ,1 \alpha > \beta, distinguishes between the above two cases. We can solve any problem in BQP with this oracle, by setting $\alpha = 2/3, \beta = 1/3$.

For any $L \in \mathsf$, there exists family of quantum circuits $\$ such that for all $n \in \mathbb$, a state $, x\rangle$ of $n$ qubits, if $x \in L, Pr(Q_n(, x\rangle)=1) \geq 2/3$; else if $x \notin L, Pr(Q_n(, x\rangle)=0) \geq 2/3$. Fix an input $, x\rangle$ of qubits, and the corresponding quantum circuit $Q_n$. We can first construct a circuit $C_x$ such that $C_x, 0\rangle^ = , x\rangle$. This can be done easily by hardwiring $, x\rangle$ and apply a sequence of CNOT gates to flip the qubits. Then we can combine two circuits to get $C' = Q_nC_x$, and now $C', 0\rangle^ = Q_n, x\rangle$. And finally, necessarily the results of $Q_n$ is obtained by measuring several qubits and apply some (classical) logic gates to them. We can always defer the measurement and reroute the circuits so that by measuring the first qubit of $C', 0\rangle^ = Q_n, x\rangle$, we get the output. This will be our circuit , and we decide the membership of $x \in L$ by running $A(C)$ with $\alpha = 2/3, \beta = 1/3$. By definition of BQP, we will either fall into the first case (acceptance), or the second case (rejection), so $L \in \mathsf$ reduces to APPROX-QCIRCUIT-PROB.

BQP and EXP

We begin with an easier containment. To show that $\mathsf \subseteq \mathsf$, it suffices to show that APPROX-QCIRCUIT-PROB is in EXP since APPROX-QCIRCUIT-PROB is BQP-complete.

Note that this algorithm also requires $2^$ space to store the vectors and the matrices. We will show in the following section that we can improve upon the space complexity.

BQP and PSPACE

Sum of histories is a technique introduced by physicist Richard Feynman for path integral formulation. APPROX-QCIRCUIT-PROB can be formulated in the sum of histories technique to show that $\mathsf \subseteq \mathsf$.

Consider a quantum circuit , which consists of gates, $g_1, g_2, \cdots, g_m$, where each $g_j$ comes from a universal gate set and acts on at most two qubits.
To understand what the sum of histories is, we visualize the evolution of a quantum state given a quantum circuit as a tree. The root is the input $, 0\rangle^$, and each node in the tree has $2^n$ children, each representing a state in $\mathbb C^n$. The weight on a tree edge from a node in -th level representing a state $, x\rangle$ to a node in $j+1$-th level representing a state $, y\rangle$ is $\langle y, g_, x\rangle$, the amplitude of $, y\rangle$ after applying $g_$ on $, x\rangle$. The transition amplitude of a root-to-leaf path is the product of all the weights on the edges along the path. To get the probability of the final state being $, \psi\rangle$, we sum up the amplitudes of all root-to-leave paths that ends at a node representing $, \psi\rangle$.

More formally, for the quantum circuit , its sum over histories tree is a tree of depth , with one level for each gate $g_i$ in addition to the root, and with branching factor $2^n$.

Notice in the sum over histories algorithm to compute some amplitude $\alpha_x$, only one history is stored at any point in the computation. Hence, the sum over histories algorithm uses $O(nm)$ space to compute $\alpha_x$ for any since $O(nm)$ bits are needed to store the histories in addition to some workspace variables.

Therefore, in polynomial space, we may compute $\sum_x , \alpha_x, ^2$ over all with the first qubit being , which is the probability that the first qubit is measured to be 1 by the end of the circuit.

Notice that compared with the simulation given for the proof that $\mathsf \subseteq \mathsf$, our algorithm here takes far less space but far more time instead. In fact it takes $O(m\cdot 2^ )$ time to calculate a single amplitude!

BQP and PP

A similar sum-over-histories argument can be used to show that $\mathsf \subseteq \mathsf$.

P and BQP

We know $\mathsf \subseteq \mathsf$, since every classical circuit can be simulated by a quantum circuit. Nielsen, Michael A.; Chuang, Isaac L. (2000), Quantum Computation and Quantum Information, Cambridge: Cambridge University Press, ISBN 0-521-63235-8, MR 1796805.

It is conjectured that BQP solves hard problems outside of P, specifically, problems in NP. The claim is indefinite because we don't know if P=NP, so we don't know if those problems are actually in P. Below are some evidence of the conjecture:

*Integer factorization (see Shor's algorithm)arXiv:quant-ph/9508027v2 ''Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer'', Peter W. Shor
/ref>
*Discrete logarithm
*Simulation of quantum systems (see universal quantum simulator)
*Approximating the Jones polynomial at certain roots of unity
* Harrow-Hassidim-Lloyd (HHL) algorithm

See also

* Hidden subgroup problem
* Polynomial hierarchy (PH)
* Quantum complexity theory
* QMA, the quantum equivalent to NP.
* QIP, the quantum equivalent to IP.

References

External links

Complexity Zoo link to BQP

{{DEFAULTSORT:Bqp
Probabilistic complexity classes
Quantum complexity theory
Quantum computing