2011/10/17 by Sergey N. Filippov, Tomáš Rybár, Tomas Rybar +2 · 43 citations
Computer Science · Mathematics · Physics and Astronomy · #Bipartite graph #Combinatorics #Discrete mathematics #Duality (order theory) #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #Robustness (evolution) #Squashed entanglement #Statistical physics #Topology (electrical circuits) #math-ph #math.MP #quant-ph
paper · pdf · doi:10.1103/physreva.85.012303
published in Physical Review A 85(1) (American Physical Society) · 10 pages, 5 figures
arxiv created 2011/10/17 · openalex publication_date 2012/01/04 · arxiv updated 2012/01/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We address the problem of the robustness of entanglement of bipartite systems (qubits) interacting with dynamically independent environments. In particular, we focus on the characterization of so-called local entanglement-annihilating (EA) two-qubit channels, which set the maximum permissible noise level allowing us to perform entanglement-enabled experiments. The differences, but also the subtle relations, between entanglement-breaking and local EA channels are emphasized. A detailed characterization of the latter ones is provided for a variety of channels including depolarizing, unital, (generalized) amplitude-damping, and extremal channels. We also consider the convexity structure of local EA qubit channels and introduce a concept of EA duality.