Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Debbie W. Leung / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62109093 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098665333 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.1195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel Coding Rate in the Finite Blocklength Regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-error information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5308670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3540808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor-group-generated polar spaces and (multi-)qudits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations over finite fields and the chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions and their stabilizers for line complexes and quadrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symplectic spreads / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof for the existence of mutually unbiased bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: From qubits to E7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of root systems and the \(E\)-sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to error probability for coding on discrete memoryless channels. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameters graph of the root system \(E_8\) is uniquely geometrisable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional and non-crystallographic root systems and the Kochen–Specker theorem / rank
 
Normal rank

Latest revision as of 00:59, 5 July 2024

scientific article
Language Label Description Also known as
English
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
scientific article

    Statements

    Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2012
    0 references
    classical channel
    0 references
    zero probability of decoding error
    0 references
    entanglement
    0 references
    asymptotic zero-error capacity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references