Quantum computation with identical bosons

We investigate the computational complexity of quantum computing with identical noninteracting bosons, such as that in a linear optical system. We explore the challenges in building devices that implement this model and in certifying their correctness. In work done with Scott Aaronson, we introduce BOSONSAMPLING, a computational model of quantum linear optics [1]. We argue that the statistical distribution of outcomes cannot be reproduced by any classical device in a reasonable time span. This gives hands-on evidence of quantum advantage, that there are quantum phenomena are prohibitive to simulate in the classical world. Moreover, this quantum advantage is already present in limited optical systems, suggesting a lower bar to building devices that exhibit super-classical computation. We lay out the computational complexity argument for the classical difficulty of simulating BOSONSAMPLING. An efficient classical simulation would have unlikely complexity consequences for the polynomial hierarchy PH. We look into the difficulties in proving an analogous approximate result, including the conjectures that seem to be needed to push it through. We then discuss experimental implementations of BOSONSAMPLING. The scalability of current implementations is limited by various sources of noise that accumulate as the problem size grows. We prove a result [51 that pertains to the inexactnesses of components that comprise the linear optical network, giving bounds on the tolerances that suffice to obtain an output distribution close to the ideal one. Finally, we look at the challenge of certifying a BOSONSAMPLING device. We show the impossibility of one technique, to use a submatrix whose permanent is so large that its corresponding outcome appears very frequently. Joint work with Aaronson [21 argues that the outputs of a BOSONSAMPLING device can be verified not to come from a uniform distribution. Results on the statistical bunching of bosons obtained with Kuperberg [61 are another approach to certification. We further present a novel certification technique based on classically estimating the distribution of integer combinations of the boson counts.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2017

Author dc:creator

• Arkhipov, Alex (Aleksandr)

Advisor dc:contributor.advisor

• Scott Aaronson.

• Electrical Engineering and Computer Science.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/113995

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/113995