2009/06/30 by Wieslaw Laskowski, Wiesław Laskowski, Tomasz Paterek +4 · 2 citations
Computer Science · Physics and Astronomy · #Algorithm #Artificial intelligence #Bell state #Computer science #Dephasing #Entanglement distillation #Noise (video) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Quantum nonlocality #Qubit #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.81.042101
published as Phys. Rev. A 81, 042101 (2010) · new version, more results added
arxiv created 2010/01/19 · openalex publication_date 2010/04/02 · arxiv updated 2015/05/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We consider properties of states of many qubits, which arise after sending certain entangled states via various noisy channels (white noise, colored noise, local depolarization, dephasing, and amplitude damping). Entanglement of these states and their ability to violate certain classes of Bell inequalities are studied. States which violate them allow a higher than classical efficiency in solving related distributed computational tasks with constrained communication. This is a direct property of such states---not requiring their further modification via stochastic local operations and classical communication such as entanglement purification or distillation procedures. We identify families of multiparticle states which are entangled but nevertheless allow the local realistic description of specific Bell experiments. For some of them, the ``gap'' between the critical values for entanglement and violation of Bell inequality remains finite even in the limit of infinitely many qubits.