2014/06/17 by Benoît Valiron, Valiron, Benoît
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1406.4361
openalex publication_date 2014/06/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper shows that, in measurement-based quantum computation, it is\npossible to write any quantum oracle implementing a classical function in\nconstant depth. The result is shown through the equivalence between MBQC and\nthe circuit model where arbitrary rotations along Z axis and unbounded\nfan-outs are elementary operations. A corollary of this result is that\ndisjunction can be implemented exactly in constant-depth, answering an open\nquestion of H oyer and vSpalek.\n