Please use this identifier to cite or link to this item:
Title: Are random pure states useful for quantum computation?
Authors: Bremner, M.J.
Mora, C.
Winter, A. 
Issue Date: 11-May-2009
Citation: Bremner, M.J., Mora, C., Winter, A. (2009-05-11). Are random pure states useful for quantum computation?. Physical Review Letters 102 (19) : -. ScholarBank@NUS Repository.
Abstract: 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.
Source Title: Physical Review Letters
ISSN: 00319007
DOI: 10.1103/PhysRevLett.102.190502
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.