2012/08/31 by Peter P. Rohde · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physreva.86.052321
published as Phys. Rev. A 86, 052321 (2012) · Version submitted to Phys. Rev. A
arxiv created 2012/09/24 · openalex publication_date 2012/11/19 · arxiv updated 2012/11/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 spatiotemporal 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 may make boson-sampling LOQC within reach of present-day technology.