Simple scheme for universal linear-optics quantum computing with constant experimental complexity using fiber loops

Rohde, PP

Simple scheme for universal linear-optics quantum computing with constant experimental complexity using fiber loops

Rohde, PP

Permalink

Publication Type:: Journal Article
Citation:: Physical Review A - Atomic, Molecular, and Optical Physics, 2015, 91 (1)
Issue Date:: 2015-01-08

Closed Access

	Filename	Description	Size
	1410.0433v1.pdf	Submitted Version	792.67 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	Rohde, PP https://orcid.org/0000-0002-5814-7289	en_US
dc.date.issued	2015-01-08	en_US
dc.identifier.citation	Physical Review A - Atomic, Molecular, and Optical Physics, 2015, 91 (1)	en_US
dc.identifier.issn	1050-2947	en_US
dc.identifier.uri	http://hdl.handle.net/10453/132377
dc.description.abstract	© 2015 American Physical Society. Recently, Motes, Gilchrist, Dowling, and Rohde [Phys. Rev. Lett. 113, 120501 (2014).PRLTAO0031-900710.1103/PhysRevLett.113.120501] presented a scheme for photonic boson sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear-optics quantum computing, in various incarnations. The scheme employs two embedded fiber loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photodetector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.	en_US
dc.relation.ispartof	Physical Review A - Atomic, Molecular, and Optical Physics	en_US
dc.relation.isbasedon	10.1103/PhysRevA.91.012306	en_US
dc.subject.classification	General Physics	en_US
dc.title	Simple scheme for universal linear-optics quantum computing with constant experimental complexity using fiber loops	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	91	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	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	03 Chemical Sciences	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/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	91	en_US

Abstract:

© 2015 American Physical Society. Recently, Motes, Gilchrist, Dowling, and Rohde [Phys. Rev. Lett. 113, 120501 (2014).PRLTAO0031-900710.1103/PhysRevLett.113.120501] presented a scheme for photonic boson sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full, universal linear-optics quantum computing, in various incarnations. The scheme employs two embedded fiber loops, a single push-button photon source, three dynamically controlled beamsplitters, and a single time-resolved photodetector. The architecture has only a single point of interference, and thus may be significantly easier to align than other schemes. The experimental complexity of the scheme is constant, irrespective of the size of the computation, limited only by fiber lengths and their respective loss rates.

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

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