Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

The Computational Complexity of Linear Optics

Not Accessible

Your library or personal account may give you access

Abstract

We explain why linear optics is of interest to complexity theory. We show that under plausible conjectures, one cannot classically simulate the outputs of linear optical systems, even approximately. This suggests a gap in computational power between quantum and classical.

This talk is based on work done with Scott Aaronson that includes the paper “The Computational Complexity of Linear Optics”[1].

© 2014 Optical Society of America

PDF Article
More Like This
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
FM2A.7 CLEO: QELS_Fundamental Science (CLEO:FS) 2014

Linear Optical Quantum Computing in a Single Spatial Mode

Peter C. Humphreys, Benjamin J. Metcalf, Justin B. Spring, Merritt Moore, Xian-Min Jin, Marco Barbieri, W. Steven Kolthammer, and Ian A. Walmsley
QTh2A.4 Quantum Information and Measurement (QIM) 2014

Linear optical quantum computing

J.D. Franson, M.J. Fitch, B.C. Jacobs, and T.B. Pittman
ThSS2 Frontiers in Optics (FiO) 2003

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved