Optical quantum computing with photons of arbitrarily low fidelity and purity
Peter P. Rohde

TL;DR
This paper demonstrates that large-scale linear optics quantum computing, specifically Boson-sampling, can be feasible even with photons of low fidelity and purity, relaxing previous strict requirements and making current technology sufficient.
Contribution
It shows that Boson-sampling quantum computing can operate with less perfect photons, significantly easing experimental challenges compared to prior assumptions.
Findings
Computational hardness persists with low-fidelity photons.
System size increase compensates for photon imperfections.
Relaxed photon quality requirements enable current technology applications.
Abstract
Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics network. It is well known that in such schemes there are stringent requirements on the spatio-temporal structure of photons -- they must be completely indistinguishable and of very high purity. We show that in the Boson-sampling model for LOQC these conditions may be significantly relaxed. We present evidence that by increasing the size of the system we can implement a computationally hard algorithm even if our photons have arbitrarily low fidelity and purity. These relaxed conditions make Boson-sampling LOQC within reach of present-day technology.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
