Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
Conferences > CLEO_QELS > 2014 > FM2A > FM2A.7

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, and Terry Rudolph

Not Accessible

Your library or personal account may give you access

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.

© 2014 Optical Society of America

PDF Article
More Like This
The Computational Complexity of Linear Optics

Scott Aaronson and Alex Arkhipov
QTh1A.2 Quantum Information and Measurement (QIM) 2014

An integrated programmable quantum photonic processor for linear optics

Jacob Mower, Nicholas C. Harris, Greg Steinbrecher, Yoav Lahini, and Dirk Englund
FM2A.3 CLEO: QELS_Fundamental Science (CLEO:FS) 2014

Experimental Boson Sampling with integrated photonics

N. Spagnolo, C. Vitelli, M. Bentivegna, F. Flamini, P. Mataloni, F. Sciarrino, Daniel J. Brod, Ernesto F. Galvão, Andrea Crespi, Roberta Ramponi, and Roberto Osellame
QTh1A.3 Quantum Information and Measurement (QIM) 2014

View More...
Select as filters
Select Topics Cancel
Top
       
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.
Privacy | Terms of Use