Coding theorem and strong converse for quantum channels
From MaRDI portal
Abstract: In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using types of sequences. As a by-product of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.
Recommendations
- Strong converse to the quantum channel coding theorem
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Strong converse for identification via quantum channels
- A Strong Converse Theorem for Quantum Multiple Access Channels
- A Strong Converse Theorem for Quantum Multiple Access Channels
Cited in
(only showing first 100 items - show all)- Classical capacity of quantum channels with general Markovian correlated noise
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Secure certification of mixed quantum states with application to two-party randomness generation
- Classical proofs for the quantum collapsing property of classical hash functions
- A note on random coding bounds for classical-quantum channels
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- Parallelization of entanglement-resistant multi-prover interactive proofs
- 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
- Quantum reverse hypercontractivity: its tensorization and application to strong converses
- Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels
- Strong converse for the classical capacity of the pure-loss bosonic channel
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Moderate deviation analysis for classical communication over quantum channels
- Strong converse exponent for classical-quantum channel coding
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
- Relative entropy and squashed entanglement
- Quantum privacy and quantum wiretap channels
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Convergence rates for the quantum central limit theorem
- Asymptotic state transformations of continuous variable resources
- Unclonable encryption, revisited
- Strong converse theorems using Rényi entropies
- Stronger methods of making quantum interactive proofs perfectly complete
- Entropy in general physical theories
- A Conceptually Simple Proof of the Quantum Reverse Shannon Theorem
- One-shot assisted concentration of coherence
- Applications of position-based coding to classical communication over quantum channels
- Achieving the Holevo bound via a bisection decoding protocol
- Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources
- Classical coding and the Cauchy-Schwarz inequality
- A Strong Converse Theorem for Quantum Multiple Access Channels
- Testing quantum circuits and detecting insecure encryption
- A Random Coding Based Proof for the Quantum Coding Theorem
- Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
- scientific article; zbMATH DE number 5320294 (Why is no real title available?)
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- scientific article; zbMATH DE number 5508888 (Why is no real title available?)
- Ergodic Classical-Quantum Channels: Structure and Coding Theorems
- MAX-RELATIVE ENTROPY OF ENTANGLEMENT, ALIAS LOG ROBUSTNESS
- A most compendious and facile quantum de Finetti theorem
- Quantum sources and a quantum coding theorem
- Quantum coding theorems
- scientific article; zbMATH DE number 1944611 (Why is no real title available?)
- Strong converse to the quantum channel coding theorem
- Strong converse for identification via quantum channels
- Classical-quantum arbitrarily varying wiretap channel: secret message transmission under jamming attacks
- A quantum central limit theorem for non-equilibrium systems: exact local relaxation of correlated states
- On the near-optimality of one-shot classical communication over quantum channels
- Coherent attack on oblivious transfer based on single-qubit rotations
- Classical-Quantum Arbitrarily Varying Wiretap Channel
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- Universal points in the asymptotic spectrum of tensors
- Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Post-quantum Security of Plain OAEP Transform
- Shadow tomography of quantum states
- The apex of the family tree of protocols: optimal rates and resource inequalities
- Steganography protocols for quantum channels
- Uniform continuity bounds for characteristics of multipartite quantum systems
- An achievable rate for private classical information over a quantum broadcast channel
- Universal coding for transmission of private information
- Relativistic (or 2-prover 1-round) zero-knowledge protocol for \(\mathsf {NP}\) secure against quantum adversaries
- The coding theorem for a class of quantum channels with long-term memory
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Universal quantum state merging
- THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
- A Strong Converse Theorem for Quantum Multiple Access Channels
- The extraction of work from quantum coherence
- Resource theory of heat and work with non-commuting charges
- Identification over quantum broadcast channels
- Source coding with quantum side information at several decoders
- 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)
- NLTS Hamiltonians from good quantum codes
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Weakening assumptions for publicly-verifiable deletion
- One-out-of-many unclonable cryptography: definitions, constructions, and more
- From plaintext-extractability to IND-CCA security
- A review of quantum correlation sharing: the recycling of quantum correlations triggered by quantum measurements
- Area laws and tensor networks for maximally mixed ground states
- PKE and ABE with collusion-resistant secure key leasing
- LWE with quantum amplitudes: Algorithm, hardness, and oblivious sampling
- Secret sharing with publicly verifiable deletion
- A simple framework for secure key leasing
- On quantum money and evasive obfuscation
- Quantum event learning and gentle random measurements
- Quantum money from abelian group actions
- Unclonable commitments and proofs
- An additive refinement of quantum channel capacities
- Zero-entropy encoders and simultaneous decoders in identification via quantum channels
- Faithful squashed entanglement
- Publicly verifiable deletion: general compilers from minimal assumptions
- Powerful primitives in the bounded quantum storage model
- Certified everlasting secure collusion-resistant functional encryption, and more
This page was built for publication: Coding theorem and strong converse for quantum channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503436)
