Information storage and transmission under Markovian noise

Abstract

We study the information transmission capacities of quantum Markov semigroups $({\Psi }^t{)}_{t\in \mathbb{N}}$ acting on $d-$dimensional quantum systems. We show that, in the limit of $t\to \infty$, the capacities can be efficiently computed in terms of the structure of the peripheral space of $\Psi$, are strongly additive, and satisfy the strong converse property. We also establish convergence bounds to show that the infinite-time capacities are reached after time $t\gtrsim d^2\ln (d)$. From a data storage perspective, our analysis provides tight bounds on the number of bits or qubits that can be reliably stored for long times in a quantum memory device that is experiencing Markovian noise. From a practical standpoint, we show that typically, an $n-$qubit quantum memory, with Markovian noise acting independently and identically on all qubits and a fixed time-independent global error correction mechanism, becomes useless for storage after time $t\gtrsim n{2}^{2n}$. In contrast, if the error correction is local, we prove that the memory becomes useless much more quickly, i.e., after time $t\gtrsim \ln (n)$. In the setting of point-to-point communication between two spatially separated parties, our analysis provides efficiently computable bounds on the optimal rate at which bits or qubits can be reliably transmitted via long Markovian communication channels $({\Psi }^l{)}_{l\in \mathbb{N}}$ of length $l\gtrsim d^2\ln (d)$, both in the finite block-length and asymptotic regimes.

This version subsumes and generalizes the analysis presented in arXiv:2409.17743v1, arXiv:2409.17743v2 and arXiv:2504.10436v1

References in corpus (81)

• Quantum Computing in the NISQ era and beyond
• Noisy intermediate-scale quantum (NISQ) algorithms
• Non-Markovian dynamics in open quantum systems
• Quantum Error Correction for Quantum Memories
• Noiseless Quantum Codes
• Quantum Non-Markovianity: Characterization, Quantification and Detection
• A Theory of Quantum Error-Correcting Codes
• The capacity of the noisy quantum channel
• On quantum Renyi entropies: a new generalization and some properties
• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Superadditivity of communication capacity using entangled inputs
• Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Quantum Communication With Zero-Capacity Channels
• Secure key from bound entanglement
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• Quantum Channel Capacity of Very Noisy Channels
• Dividing Quantum Channels
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• All Teleportation and Dense Coding Schemes
• Sandwiched Rényi Divergence Satisfies Data Processing Inequality
• Continuity of quantum conditional information
• Quantum memories at finite temperature
• Robust polarization-based quantum key distribution over collective-noise channel
• The quantum capacity of channels with arbitrarily correlated noise
• Converse bounds for private communication over quantum channels
• General paradigm for distilling classical key from quantum states
• On the quantum Renyi relative entropies and related capacity formulas
• Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
• Information preserving structures: A general framework for quantum zero-error information
• Bounds on the Lambert function and their application to the outage analysis of user cooperation
• On the strong converses for the quantum channel capacity theorems
• Fundamental bound on the reliability of quantum information transmission
• Finite blocklength converse bounds for quantum channels
• On entanglement-assisted classical capacity
• The private capacity of quantum channels is not additive
• Gaussian bosonic synergy: quantum communication via realistic channels of zero quantum capacity
• Continuity of quantum channel capacities
• Trade-off capacities of the quantum Hadamard channels
• Relative Entropy Bounds on Quantum, Private and Repeater Capacities
• Simplifying additivity problems using direct sum constructions
• Lüders Theorem for Unsharp Quantum Measurements
• Strong converse rates for quantum communication
• Semidefinite programming strong converse bounds for classical capacity
• Extensive nonadditivity of privacy
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• The Shannon capacity of a graph and the independence numbers of its powers
• Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
• The quantum dynamic capacity formula of a quantum channel
• Exploring Noiseless Subsystems via Nuclear Magnetic Resonance
• Applications of position-based coding to classical communication over quantum channels
• Strictly contractive quantum channels and physically realizable quantum computers
• Potential capacities of quantum channels
• Spectral convergence bounds for classical and quantum Markov processes
• Quantum source-channel coding and non-commutative graph theory
• Amortization does not enhance the max-Rains information of a quantum channel
• Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions
• On converse bounds for classical communication over quantum channels
• On superactivation of zero-error capacities and reversibility of a quantum channel
• On period, cycles and fixed points of a quantum channel
• Generic nonadditivity of quantum capacity in simple channels
• Contraction coefficients for noisy quantum channels
• Families of completely positive maps associated with monotone metrics
• Multiplicative Properties of Quantum Channels
• Sandwiched Rényi Convergence for Quantum Evolutions
• Capacity Estimates via comparison with TRO channels
• Maximal Privacy Without Coherence
• On the near-optimality of one-shot classical communication over quantum channels
• Activation and superactivation of single-mode Gaussian quantum channels
• Entanglement-Saving Channels
• Fault-tolerant Coding for Quantum Communication
• Quantum Subdivision Capacities and Continuous-time Quantum Coding
• Universal collective rotation channels and quantum error correction
• Continuity of entropies via integral representations
• Undecidability in Physics: a Review
• Fault-tolerant Coding for Entanglement-Assisted Communication
• Maximum privacy without coherence, zero-error
• Unified framework for continuity of sandwiched Rényi divergences