Counting, fanout and the complexity of quantum ACC

MaRDI QIDQ3522362zbMATH OpenFDO

Authors

Publication date 3 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0106017

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Quantum fan-out is powerful
• scientific article; zbMATH DE number 1962817
• Fundamentals of Computation Theory
• Quantum lower bounds for fanout
• Collapse of the hierarchy of constant-depth exact quantum circuits

Cited in

(11)

• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Parallelizing quantum circuits
• Quantum neural networks
• Power of uninitialized qubits in shallow quantum circuits
• Quantum fan-out is powerful
• scientific article; zbMATH DE number 7228448 (Why is no real title available?)
• Collapse of the hierarchy of constant-depth exact quantum circuits
• Average-case quantum advantage with shallow circuits
• Fundamentals of Computation Theory
• Noisy decoding by shallow circuits with parities: classical and quantum (extended abstract)
• Bounds on the QAC^0 complexity of approximating parity

This page was built for publication: Counting, fanout and the complexity of quantum ACC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522362)