A lower bound method for quantum circuits

DOI10.1016/J.IPL.2011.05.002zbMath1260.68145OpenAlexW2047671131MaRDI QIDQ1944121

Debajyoti Bera

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.002

zbMATH Keywords

computational complexitylower boundparity functionquantum circuitcircuit complexity theory

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Unnamed Item ⋮ Power of uninitialized qubits in shallow quantum circuits

Cites Work

• Quantum Circuits with Unbounded Fan-out
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound method for quantum circuits