The Computational Complexity of Linear Optics
URL to conference site, shows it's an accepted paper
Main Authors: | Aaronson, Scott (Contributor), Arkhipov, Aleksandr (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery,
2011-05-10T18:40:32Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Bosonsampling Is Far from Uniform
by: Aaronson, Scott, et al.
Published: (2015) -
A linear-optical proof that the permanent is #P-hard
by: Aaronson, Scott
Published: (2012) -
Generation of universal linear optics by any beam splitter
by: Aaronson, Scott, et al.
Published: (2014) -
Quantum computation with identical bosons
by: Arkhipov, Alex (Aleksandr)
Published: (2018) -
Analysis of errors in linear optics quantum computation
by: Takeuchi, Shigeki
Published: (2011)