Verifying quantum complexity in linear optical experiments

Jacques Carolan, Jasmin D.A. Meinecke, Pete Shadbolt, Nicholas J. Russell, Mark G. Thompson, Jeremy L. O'Brien, Jonathan C.F. Matthews, Anthony Laing, Nur Ismail, Kerstin Wörhoff, Terry Rudolph

Research output: Contribution to conferenceConference presentation/ephemerapeer-review

Abstract

We develop techniques to verify the computational complexity of a class of analogue quantum computers known as boson samplers. We demonstrate these techniques with up to 5 photons in two different types of integrated linear optical circuit, observing Hilbert spaces of up to 50,000 dimensions.

Original languageEnglish
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event2014 Conference on Lasers and Electro-Optics, CLEO 2014 - San Jose, United States
Duration: 8 Jun 201413 Jun 2014
https://www.cleoconference.org/library/images/cleo/Archive/CLEO-Archive-2014.pdf

Conference

Conference2014 Conference on Lasers and Electro-Optics, CLEO 2014
Country/TerritoryUnited States
CitySan Jose
Period8/06/1413/06/14
Internet address

Fingerprint

Dive into the research topics of 'Verifying quantum complexity in linear optical experiments'. Together they form a unique fingerprint.

Cite this