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, N. Ismail, Kerstin Wörhoff, Terry Rudolph · 2014
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.