Temporally unstructured quantum computation

Shepherd, D; Bremner, MJ

Temporally unstructured quantum computation

Shepherd, D Bremner, MJ

Permalink

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-05-08

Closed Access

	Filename	Description	Size
	2013003975OK.pdf		331.19 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	Shepherd, D	en_US
dc.contributor.author	Bremner, MJ https://orcid.org/0000-0001-7240-4686	en_US
dc.date.issued	2009-05-08	en_US
dc.identifier.citation	Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2009, 465 (2105), pp. 1413 - 1439	en_US
dc.identifier.issn	1364-5021	en_US
dc.identifier.uri	http://hdl.handle.net/10453/29272
dc.description.abstract	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 Shor's algorithm. This journal is © 2009 The Royal Society.	en_US
dc.relation.ispartof	Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences	en_US
dc.relation.isbasedon	10.1098/rspa.2008.0443	en_US
dc.title	Temporally unstructured quantum computation	en_US
dc.type	Journal Article
utslib.citation.volume	2105	en_US
utslib.citation.volume	465	en_US
utslib.for	0105 Mathematical 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	2105	en_US
pubs.publication-status	Published	en_US
pubs.volume	465	en_US

Abstract:

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 Shor's algorithm. This journal is © 2009 The Royal Society.

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

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