Quantum Circuits with Unbounded Fan-out

DOI10.4086/toc.2005.v001a005zbMath1213.68298OpenAlexW3104119396MaRDI QIDQ3002758

Robert Špalek, Peter Høyer

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2005.v001a005

zbMATH Keywords

quantum computingquantum Fourier transformthreshold circuitsquantum circuitsconstant depth circuitsfan-out

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (14)

Unnamed Item ⋮ Quantum Fourier transform over symmetric groups -- improved result ⋮ Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable ⋮ Efficient Universal Quantum Circuits ⋮ Optimal parallel quantum query algorithms ⋮ 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time ⋮ Quantum string matching unfolded and extended ⋮ A lower bound method for quantum circuits ⋮ Power of uninitialized qubits in shallow quantum circuits ⋮ Faster quantum chemistry simulation on fault-tolerant quantum computers ⋮ Classical Structures Based on Unitaries ⋮ Quantum Speedup and Categorical Distributivity ⋮ Unnamed Item

This page was built for publication: Quantum Circuits with Unbounded Fan-out