Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels (Q4832727): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57522550, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036635430 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0108066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computational networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal two-bit gate for quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality in quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmable Quantum Gate Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity of the quantum channel with general signal states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additivity for unital qubit channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity of the quantum depolarizing channel / 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: Q2706747 / 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: All teleportation and dense coding schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operator monotones, the reduction criterion and the relative entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive maps and entropy inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dense coding with mixed state entanglement / 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: Quantum coding theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:40, 7 June 2024

scientific article; zbMATH DE number 2122308
Language Label Description Also known as
English
Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels
scientific article; zbMATH DE number 2122308

    Statements

    Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels (English)
    0 references
    0 references
    0 references
    14 December 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references