Temporally unstructured quantum computation

Publisher:
The Royal Society
Publication Type:
Journal Article
Citation:
Proceedings Of The Royal Society A-Mathematical Physical And Engineering Sciences, 2009, 465 (2105), pp. 1413 - 1439
Issue Date:
2009-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013003975OK.pdf331.19 kB
Adobe PDF
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here temporally unstructured (`instantaneous) quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that cannot, classically, be sampled efficiently and accurately. This paradigm also admits simple interactive proof games that may convince a sceptic of the existence of truly quantum effects. Furthermore, these effects can be created using significantly fewer qubits than are required for running Shors algorithm.
Please use this identifier to cite or link to this item: