Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial (Q3107878): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q80106508, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0508042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proposed Experiment to Test Local Hidden-Variable Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum tolerable noise for reliable computation by formulas / rank
 
Normal rank

Latest revision as of 18:31, 4 July 2024

scientific article
Language Label Description Also known as
English
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
scientific article

    Statements

    Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 December 2011
    0 references

    Identifiers