TY - JOUR
AB - 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.
AU - Bremner, MJ
AU - Mora, C
AU - Winter, A
DA - 2009/05/11
DO - 10.1103/PhysRevLett.102.190502
JO - Physical Review Letters
PY - 2009/05/11
TI - Are random pure states useful for quantum computation?
VL - 102
Y1 - 2009/05/11
Y2 - 2022/08/09
ER -