Coding theorem and strong converse for quantum channels
From MaRDI portal
Publication:4503436
DOI10.1109/18.796385zbMath0965.94007arXiv1409.2536OpenAlexW2114473497WikidataQ57522588 ScholiaQ57522588MaRDI QIDQ4503436
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.2536
Quantum computation (81P68) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items
Universal points in the asymptotic spectrum of tensors ⋮ Ground State Connectivity of Local Hamiltonians ⋮ Secure certification of mixed quantum states with application to two-party randomness generation ⋮ Classical proofs for the quantum collapsing property of classical hash functions ⋮ Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein’s lemma ⋮ Testing Quantum Circuits and Detecting Insecure Encryption ⋮ Achieving the Holevo bound via a bisection decoding protocol ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Moderate deviation analysis for classical communication over quantum channels ⋮ Convergence rates for the quantum central limit theorem ⋮ Post-quantum Security of Plain OAEP Transform ⋮ Strong converse exponent for classical-quantum channel coding ⋮ Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity ⋮ Quantum state merging and negative information ⋮ Quantum reverse hypercontractivity: its tensorization and application to strong converses ⋮ Resource theory of heat and work with non-commuting charges ⋮ Identification over quantum broadcast channels ⋮ The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel ⋮ Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks ⋮ Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete ⋮ Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels ⋮ Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication ⋮ A quantum central limit theorem for non-equilibrium systems: exact local relaxation of correlated states ⋮ Source coding with quantum side information at several decoders ⋮ Asymptotic state transformations of continuous variable resources ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Public key encryption with secure key leasing ⋮ Quantum rewinding for many-round protocols ⋮ Cryptography with certified deletion ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Unclonable encryption, revisited ⋮ Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation ⋮ Relative entropy and squashed entanglement ⋮ Entropy in general physical theories ⋮ Shadow Tomography of Quantum States ⋮ On the near-optimality of one-shot classical communication over quantum channels ⋮ The apex of the family tree of protocols: optimal rates and resource inequalities ⋮ Steganography protocols for quantum channels ⋮ Universal quantum state merging ⋮ Coherent attack on oblivious transfer based on single-qubit rotations ⋮ Uniform continuity bounds for characteristics of multipartite quantum systems ⋮ Classical-Quantum Arbitrarily Varying Wiretap Channel ⋮ Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities ⋮ THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT ⋮ Strong converse for the classical capacity of the pure-loss bosonic channel ⋮ Parallelization of entanglement-resistant multi-prover interactive proofs ⋮ Faithful squashed entanglement ⋮ The capacity of a quantum channel for simultaneous transmission of classical and quantum information ⋮ Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy ⋮ MAX-RELATIVE ENTROPY OF ENTANGLEMENT, ALIAS LOG ROBUSTNESS ⋮ Strong converse theorems using Rényi entropies ⋮ Classical capacity of quantum channels with general Markovian correlated noise ⋮ A most compendious and facile quantum de Finetti theorem ⋮ Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters ⋮ An achievable rate for private classical information over a quantum broadcast channel ⋮ Entanglement transmission and generation under channel uncertainty: universal quantum channel coding ⋮ One-shot assisted concentration of coherence ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ The extraction of work from quantum coherence ⋮ Universal coding for transmission of private information ⋮ Quantum privacy and quantum wiretap channels ⋮ Measurement-based universal blind quantum computation with minor resources ⋮ Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender ⋮ Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries ⋮ Second-order asymptotics for the classical capacity of image-additive quantum channels
This page was built for publication: Coding theorem and strong converse for quantum channels
