Photonic Boson Sampling in a Tunable Circuit
Name
Aaronson_Photonic boson.pdf
Size
730.07 KB
Format
Adobe PDF
Checksum (MD5)
f8cd0ee0368241bc0eb591186ce86461
Author(s) • • • • • •
Dove, Justin Michael
Aaronson, Scott
Broome, Matthew A.
Fedrizzi, Alessandro
Rahimi-Keshari, Saleh
Ralph, Timothy C.
White, Andrew G.
Date Issued
December 2012
Journal
Science
Publisher
American Association for the Advancement of Science (AAAS)
Citation
Broome, M. A., A. Fedrizzi, S. Rahimi-Keshari, J. Dove, S. Aaronson, T. C. Ralph, and A. G. White. “Photonic Boson Sampling in a Tunable Circuit.” Science 339, no. 6121 (February 15, 2013): 794–798.
Version
Author's final manuscript
Abstract
Quantum computers are unnecessary for exponentially efficient computation or simulation if the Extended Church-Turing thesis is correct. The thesis would be strongly contradicted by physical devices that efficiently perform tasks believed to be intractable for classical computers. Such a task is boson sampling: sampling the output distributions of n bosons scattered by some passive, linear unitary process. We tested the central premise of boson sampling, experimentally verifying that three-photon scattering amplitudes are given by the permanents of submatrices generated from a unitary describing a six-mode integrated optical circuit. We find the protocol to be robust, working even with the unavoidable effects of photon loss, non-ideal sources, and imperfect detection. Scaling this to large numbers of photons should be a much simpler task than building a universal quantum computer.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1126/science.1231440