2002
DOI: 10.26421/qic2.1-3
|View full text |Cite
|
Sign up to set email alerts
|

Counting, fanout and the complexity of quantum ACC

Abstract: 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 fa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
46
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 40 publications
(46 citation statements)
references
References 38 publications
0
46
0
Order By: Relevance
“…Besides being the first such unconditional separation in the circuit model, this separation is also especially important since shallow quantum circuits are likely to be the easiest quantum circuits to experimentally implement, due to their robustness to noise and decoherence. (Note that separations were already known when allowing gates with unbounded fanin or fanout [GHMP02,HS05,TT16]. The strength of Bravyi, Gosset and König's result is that it holds for the weaker model of quantum circuits with bounded fanin and fanout.…”
Section: Introduction 1background and Our Resultsmentioning
confidence: 96%
“…Besides being the first such unconditional separation in the circuit model, this separation is also especially important since shallow quantum circuits are likely to be the easiest quantum circuits to experimentally implement, due to their robustness to noise and decoherence. (Note that separations were already known when allowing gates with unbounded fanin or fanout [GHMP02,HS05,TT16]. The strength of Bravyi, Gosset and König's result is that it holds for the weaker model of quantum circuits with bounded fanin and fanout.…”
Section: Introduction 1background and Our Resultsmentioning
confidence: 96%
“…These constructions usually require the use of auxiliary qubits. The depth complexity of quantum circuits has also been studied in [12,13].…”
Section: Introduction and Summary Of Resultsmentioning
confidence: 99%
“…Constant-depth quantum circuits, but with gates that have arbitrary fan-in, have been studied previously, see for example Ref. [GHMP02]. The constant depth circuits that we consider here have fan-in at most two.…”
Section: Previous Workmentioning
confidence: 99%