Are random pure states useful for quantum computation?

Bremner, MJ; Mora, C; Winter, A

Are random pure states useful for quantum computation?

Bremner, MJ

Mora, C Winter, A

Permalink

Publication Type:: Journal Article
Citation:: Physical Review Letters, 2009, 102 (19)
Issue Date:: 2009-05-11

Closed Access

	Filename	Description	Size
	2013003976OK.pdf		114.48 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Bremner, MJ https://orcid.org/0000-0001-7240-4686	en_US
dc.contributor.author	Mora, C	en_US
dc.contributor.author	Winter, A https://orcid.org/0000-0001-6344-4870	en_US
dc.date.issued	2009-05-11	en_US
dc.identifier.citation	Physical Review Letters, 2009, 102 (19)	en_US
dc.identifier.issn	0031-9007	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29297
dc.description.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.	en_US
dc.relation.ispartof	Physical Review Letters	en_US
dc.relation.isbasedon	10.1103/PhysRevLett.102.190502	en_US
dc.subject.classification	General Physics	en_US
dc.title	Are random pure states useful for quantum computation?	en_US
dc.type	Journal Article
utslib.citation.volume	19	en_US
utslib.citation.volume	102	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0206 Quantum Physics	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	02 Physical Sciences	en_US
utslib.for	09 Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	19	en_US
pubs.publication-status	Published	en_US
pubs.volume	102	en_US

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/29297