On Shor's channel extension and constrained channels (Q1885621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On strong superadditivity of the entanglement of formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On entanglement-assisted classical capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shor's channel extension and constrained channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on additivity of the Holevo channel capacity and of the entanglement of formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additivity of the classical capacity of entanglement-breaking quantum channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of additivity questions in quantum information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4241225 / rank
 
Normal rank

Latest revision as of 14:07, 7 June 2024

scientific article
Language Label Description Also known as
English
On Shor's channel extension and constrained channels
scientific article

    Statements

    On Shor's channel extension and constrained channels (English)
    0 references
    0 references
    0 references
    11 November 2004
    0 references
    The paper uses a special extension for an arbitrary channel \(\Phi\), in order to deal with the additivity conjecture for quantum channels with constrained inputs. This is done with special emphasis on results valid for individual channels. Section 2 introduces the basic quantities used, such as the ensemble and its average. Section 3 focuses on optimal ensembles, characteristic property of the optimal ensemble is derived in {Proposition 1}, thus generalizing the maximal distance property. Section 4 deals with additivity properties for constrained channels. {Proposition 2} denotes that the additivity conjecture holds true for certain nontrivial classes of channels. The additivity for two constrained channels is proved to be reduced to additivity for unconstrained channels. This way, {Theorem 2} states that global aditivity for channels with arbitrary constraints is equivalent to global additivity without constraints.
    0 references
    quantum cryptography
    0 references
    additivity conjecture for quantum channels
    0 references

    Identifiers