Projects per year
Abstract
In this paper, we mainly prove that the “depth of computations” in the oneway model is equivalent, up to a classical sideprocessing of logarithmic depth, to the quantum circuit model augmented with unbounded fanout gates. It demonstrates that the oneway 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 oneway model and the quantum circuit model. Since oneway model has the same parallel power as unbounded quantum fanout circuits, the quantum Fourier transform can be approximated in constant depth in the oneway model, and thus the factorisation can be done by a polytime probabilistic classical algorithm which has access to a constantdepth oneway quantum computer. The extra power of the oneway model, comparing with the quantum circuit model, comes from its classicalquantum hybrid nature. We show that this extra power is reduced to the capability to perform unbounded classical parity gates in constant depth.
Original language  English 

Title of host publication  Theory of Quantum Computation, Communication, and Cryptography 
Subtitle of host publication  5th Conference, TQC 2010, Leeds, UK, April 1315, 2010, Revised Selected Papers 
Publisher  Springer Berlin Heidelberg 
Pages  3546 
Number of pages  12 
Volume  6519 
ISBN (Electronic)  9783642180736 
ISBN (Print)  9783642180729 
DOIs  
Publication status  Published  2010 
Fingerprint
Dive into the research topics of 'Computational Depth Complexity of MeasurementBased Quantum Computation'. Together they form a unique fingerprint.Projects
 1 Finished

Measurement based quantum computing and it's relation to other quantum models
1/03/08 → 31/07/13
Project: Research