2023/02/15 by Paul Hilaire, Yaron Castor, Hilaire, Paul +7 · 2 citations
Computer Science · Engineering · Mathematics · #Bell state #Bell test experiments #Bell's theorem #Computer science #Constraint (computer-aided design) #FOS: Physical sciences #Kochen–Specker theorem #Mathematical analysis #Mathematics #Neural Networks and Reservoir Computing #Photonic and Optical Devices #Photonics #Physics #Probabilistic logic #Quantum #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum entanglement #Quantum information #Quantum mechanics #Statistical physics #Upper and lower bounds
paper · pdf · doi:10.48550/arxiv.2302.07908
openalex publication_date 2023/02/15 · openalex created_date 2023/02/18 · openalex updated_date 2026/08/01
Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information. We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linear-optical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements. For logical Bell state measurements - ubiquitous operations in photonic quantum information - we demonstrate analytically that linear optics can achieve the fundamental loss threshold imposed by the no-cloning theorem even though, following the work of Lee et al., (Phys. Rev. A 100, 052303 (2019)), the constraint was widely assumed to be stricter. We spotlight the assumptions of the latter publication and find their bound holds for a logical Bell measurement built from adaptive physical linear-optical Bell measurements. We also give an explicit even stricter bound for non-adaptive Bell measurements.