2015/10/31 by Chiara Macchiavello, Massimiliano F. Sacchi · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Amplitude damping channel #Channel (broadcasting) #Classical capacity #Combinatorics #Computer science #Dimension (graph theory) #Mathematical analysis #Mathematics #Pauli exclusion principle #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum capacity #Quantum channel #Quantum error correction #Quantum information #Quantum mechanics #Quantum network #Quantum-Dot Cellular Automata #Qubit #Statistical physics #Telecommunications #Topology (electrical circuits) #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physrevlett.116.140501
published as Phys. Rev. Lett. 116, 140501 (2016) · 7 pages, 3 figures; changed title; improved and published version
openalex publication_date 2016/04/06 · arxiv created 2016/04/11 · arxiv updated 2016/04/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of a few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its efficiency by studying its performance for most well-known single-qubit noisy channels and for the generalized Pauli channel in an arbitrary finite dimension.