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