Computational Depth Complexity of Measurement-Based Quantum Computation
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.
Unable to display preview. Download preview PDF.
- [BK07]Broadbent, A., Kashefi, E.: Parallelizing quantum circuits. To appear in Theoretical Computer Science (2007) (arXiv.org preprint 0704.1736)Google Scholar
- [DKP07]Danos, V., Kashefi, E., Panangaden, P.: The measurement calculus. J. ACM 54(2) (2007)Google Scholar
- [DKPP09]Danos, V., Kashefi, E., Panangaden, P., Perdrix, S.: Semantic Techniques in quantum Computation. In: Extended measurement calculus. Cambridge University Press, Cambridge (2010)Google Scholar
- [J05]Jozsa, R.: An introduction to measurement based quantum computation (2005), arXiv pre-print: quant-ph/0508124Google Scholar
- [MN98]Moore, C., Nilsson, M.: Parallel Quantum Computation and Quantum Codes (1998), arXiv pre-print:quant-ph/9808027v1 Google Scholar
- [RBB03]Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Physical Review A 68 (2003)Google Scholar
- [SB08]Shepherd, D., Bremner, M.J.: Instantaneous Quantum Computation (2008), arXiv pre-print:0809.0847v1 Google Scholar