Computational Depth Complexity of Measurement-Based Quantum Computation

Abstract : In this paper, we mainly prove that the "depth of computations" in the one-way model is equivalent, up to a classical side-processing of logarithmic depth, to the quantum circuit model augmented with unbounded fanout gates. It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a very powerful model of quantum computation. It confirms and completes previous results which have pointed out, for some specific problems, a depth separation between the one-way model and the quantum circuit model. Since one-way model has the same parallel power as unbounded quantum fan-out circuits, the quantum Fourier transform can be approximated in constant depth in the one-way model, and thus the factorisation can be done by a polytime probabilistic classical algorithm which has access to a constant-depth one-way quantum computer. The extra power of the one-way model, comparing with the quantum circuit model, comes from its classical-quantum hybrid nature. We show that this extra power is reduced to the capability to perform unbounded classical parity gates in constant depth.
Document type :
Conference papers
Complete list of metadatas
Contributor : Nicolas Peltier <>
Submitted on : Friday, January 17, 2014 - 3:32:28 PM
Last modification on : Friday, October 25, 2019 - 2:01:51 AM

Links full text




Dan E. Browne, Elham Kashefi, Simon Perdrix. Computational Depth Complexity of Measurement-Based Quantum Computation. TQC 2010 - 5th Conference on Theory of Quantum Computation, Communication, and Cryptography, Apr 2010, Leeds, United Kingdom. pp.35-46, ⟨10.1007/978-3-642-18073-6_4⟩. ⟨hal-00932720⟩



Record views