Are random pure states useful for quantum computation?

Publication Type:
Journal Article
Citation:
Physical Review Letters, 2009, 102 (19)
Issue Date:
2009-05-11
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013003976OK.pdf114.48 kB
Adobe PDF
We show the following: a randomly chosen pure state as a resource for measurement-based quantum computation is-with overwhelming probability-of no greater help to a polynomially bounded classical control computer, than a string of random bits. Thus, unlike the familiar "cluster states," the computing power of a classical control device is not increased from P to BQP (bounded-error, quantum polynomial time), but only to BPP (bounded-error, probabilistic polynomial time). The same holds if the task is to sample from a distribution rather than to perform a bounded-error computation. Furthermore, we show that our results can be extended to states with significantly less entanglement than random states. © 2009 The American Physical Society.
Please use this identifier to cite or link to this item: