Quantum-capacity bounds in spin-network communication channels

2019/05/31 by Stefano Chessa, Marco Fanizza, Vittorio Giovannetti
Computer Science · Mathematics · Physics and Astronomy · #Classical capacity #Combinatorics #Communication source #Computer network #Computer science #Diamond #Encoding (memory) #Mathematical analysis #Mathematics #Physics #Property (philosophy) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum information #Quantum information science #Quantum mechanics #Quantum network #Spin (aerodynamics) #Topology (electrical circuits) #Upper and lower bounds #quant-ph

paper · pdf · doi:10.1103/physreva.100.032311

published as Phys. Rev. A 100, 032311 (2019) · 9 pages, 1 figure

openalex publication_date 2019/09/09 · arxiv created 2019/09/30 · arxiv updated 2019/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Using the Lieb-Robinson inequality and the continuity property of the quantum capacities in terms of the diamond norm, we derive an upper bound on the values that these capacities can attain in spin-network communication i.i.d. models of arbitrary topology. Different from previous results we make no assumptions about the encoding mechanisms that the sender of the messages adopts in loading information on the network.

Citations

• Lieb-Schultz-Mattis in higher dimensions
• Capacity of the noisy quantum channel
• Lieb-Robinson Bounds and the Exponential Clustering Theorem
• Quantum communication through spin chain dynamics: an introductory overview
• A continuity property of the entropy density for spin lattice systems
• Towards Quantum Entanglement in Nanoelectromechanical Devices
• Completely positive linear maps on complex matrices
• Excitation and entanglement transfer versus spectral gap
• Quantum computations: algorithms and error correction
• The Theory of Quantum Information
• Quantum Computation and Quantum Information