What Can Quantum Optics Say about Computational Complexity Theory?

Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for c...

Full description

Bibliographic Details

Published in:	Physical review letters Vol. 114; no. 6; p. 060501
Main Authors:	Rahimi-Keshari, Saleh, Lund, Austin P., Ralph, Timothy C.
Format:	Journal Article
Language:	English
Published:	United States 13.02.2015
Subjects:	Algorithms Approximation Complexity Complexity theory Computation Gaussian Probability distribution Sampling
ISSN:	0031-9007, 1079-7114, 1079-7114
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!