Counting, fanout and the complexity of quantum ACC

zbMATH Open1187.81065arXivquant-ph/0106017MaRDI QIDQ3522362FDOQ3522362

Authors:

Publication date: 3 September 2008

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Power of uninitialized qubits in shallow quantum circuits
• Fundamentals of Computation Theory
• Parallelizing quantum circuits
• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Title not available (Why is that?)
• Title not available (Why is that?)
• Collapse of the hierarchy of constant-depth exact quantum circuits
• Quantum neural networks
• Quantum fan-out is powerful

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)