We propose definitions of QAC^0, the quantum analog of the classical class AC^0 of constant-depth circuits with AND and OR gates of arbitrary fan-in, and QACC[q], the analog of the class ACC[q] where Mod_q gates are also allowed. We prove that parity or fanout allows us to construct quantum MOD_q gates in constant depth for any q, so QACC[2] = QACC. More generally, we show that for any q,p > 1, MOD_q is equivalent to MOD_p (up to constant depth and polynomial size). This implies that QAC^0 with unbounded fanout gates, denoted QACwf^0, is the same as QACC[q] and QACC for all q. Since \ACC[p] \ne ACC[q] whenever p and q are distinct primes, QACC[q] is strictly more powerful than its classical counterpart, as is QAC^0 when fanout is allowed. This adds to the growing list of quantum complexity classes which are provably more powerful than their classical counterparts. We also develop techniques for proving upper bounds for QACC in terms of related language classes. We define classes of languages closely related to QACC[2] and show that restricted versions of them can be simulated by polynomial-size circuits. With further restrictions, language classes related to QACC[2] operators can be simulated by classical threshold circuits of polynomial size and constant depth.
QAC0 is the class of constant-depth polynomial-size quantum circuits constructed from arbitrary single-qubit gates and generalized Toffoli gates. It is arguably the smallest natural class of constant-depth quantum computation which has not been shown useful for computing any non-trivial Boolean function. Despite this, many attempts to port classical
AC0 lower bounds to
QAC0 have failed.
We give one possible explanation of this:
QAC0 circuits are significantly more powerful than their classical counterparts. We show the unconditional separation
QAC0⊂AC0[p] for decision problems, which also resolves for the first time whether
AC0 could be more powerful than
QAC0. Moreover, we prove that
QAC0 circuits can compute a wide range of Boolean functions if given multiple copies of the input:
TC0⊆QAC0∘NC0. Along the way, we introduce an amplitude amplification technique that makes several approximate constant-depth constructions exact.
For any q>1, let MOD/sub q/ be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q, t>1, MODP is equivalent to MOD/sub t/ (up to constant depth). Based on the case q=2, C. Moore (1999) has shown that quantum analogs of AC/sup (0)/, ACC[q], and ACC, denoted QAC/sub wf//sup (0)/ QACC[2], QACC respectively, define the same class of operators, leaving q>2 as an open question. Our result resolves this question, proving that QAC/sub wf//sup (0)/=QACC[q] QACC for all q. We also develop techniques for proving upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC and BQACC/sub Q/. We define a notion of log-planar QACC operators and show the appropriately restricted versions of QACC and BQACC are contained in P/poly. We also define a notion of log-gate restricted QACC operators and show the appropriately restricted versions of QACC and NQACC are contained in TC/sup (0)/. To do this last proof; we show that TC/sup (0)/ can perform iterated addition and multiplication in certain field extensions. We also introduce the notion of a polynomial-size tensor graph and we show that families of such graphs can encode the amplitudes resulting from applying an arbitrary QACC operator to an initial state.
It is shown that determining whether a quantum computation has a non–zero probability of accepting is at least as hard as the polynomial–time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with non–zero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.
In this paper, we study the quantum learnability of constant-depth classical circuits under the uniform distribution and in the distribution-independent framework of probably approximately correct (PAC) learning. In order to attain our results, we establish connections between quantum learning and quantum-secure cryptosystems. We then achieve the following results. 1. Hardness of PAC learning
AC0 and
TC0 under the uniform distribution. Our first result concerns the concept class
TC0 (resp.,
AC0), the class of constant-depth, polynomial-sized circuits with unbounded fan-in majority gates (resp.,
AND,OR,NOT gates). We show the following: if there exists no quantum (quasi-)polynomial-time algorithm to solve the ring-learning with errors (
RLWE) problem, then there exists no (quasi-)polynomial-time quantum learning algorithm for
TC0; and if there exists no
2O(d1/η)-time quantum algorithm to solve
RLWE with dimension
d=O(polylogn) (for every constant
η>2), then there exists no
O(nlogνn)-time quantum learning algorithm for
poly(n)-sized
AC0 circuits (for a constant
ν>0), matching the classical upper bound of Linial, Mansour and Nisan [J. ACM, 40 (1993), pp. 607--620], where the learning algorithms are under the uniform distribution (even with access to quantum membership queries). The main technique in these results uses an explicit family of pseudorandom functions that are believed to be quantum-secure to construct concept classes that are hard to learn quantumly under the uniform distribution. 2. Hardness of learning
TC20 in the PAC setting. Our second result shows that if there exists no quantum polynomial-time algorithm for the
LWE problem, then there exists no polynomial-time quantum-PAC learning algorithm for the class
TC20, i.e., depth-2
TC0 circuits. The main technique in this result is to establish a connection between the quantum security of public-key encryption schemes and the learnability of a concept class that consists of decryption functions of the cryptosystem. Our results show that quantum resources do not give an exponential improvement to learning constant-depth polynomial-sized neural networks. This also gives a strong (conditional) negative answer to one of the “Ten Semi-Grand Challenges for Quantum Computing Theory" raised by Aaronson https://www.scottaaronson.com/writings/qchallenge.html, 2005.
In the dissertation we study topics in quantum computation. First, we study the model of constant-depth quantum circuits. We study the family QNC0 of constant-depth quantum circuits, and the complexity classes associated with QNC0 circuits: EQNC0, NQNC0, and BQNC0e,d . We show certain containment results such as NQNC 0 = NQACC = NQP = coC =P and BQNC0e,d is in P for certain e and δ. Our results essentially refute a conjecture of Green et al. that NQACC ⊆ TC0. We also define and study complexity classes postEQP, postRQP, postNQP, and postBQNC0 We show containment results such as postBQNC0 = postBQP = PP and NQP = postRQP = postNQP.
Second, we study applications of quantum algorithms in computational group theory. We give results about quantum algorithms and reductions for group theoretic problems, concentrating mostly on solvable groups. We study two particular group theoretic problems—GROUP I NTERSECTION and DOUBLE COSET M EMBERSHIP. We show that these problems reduce to other group problems with known efficient quantum algorithms for many instances, yielding efficient quantum algorithms for GROUP INTERSECTION and DOUBLE COSET MEMBERSHIP on the same types of groups. Then we generalize and refine our results by introducing decision versions of the STABILIZER and ORBIT COSET problems, and showing that these new problems lie in between GROUP INTERSECTION and DOUBLE COSET MEMBERSHIP on the one hand, and the problem ORBIT SUPERPOSITION, on the other. We also show that GROUP INTERSECTION and D OUBLE COSET MEMBERSHIP have statistical zero knowledge proofs. Finally we give an alternative quantum algorithm for the problem of decomposing finite abelian groups.