Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to compress interactive communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Equality With Limited Interaction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From information to exact communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Lower Bounds via Self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separation of Quantum and Classical One-Way Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information complexity approach to extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common information and unique disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Product via Round-Preserving Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fidelity of Recovery Is Multiplicative / 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: An information statistics approach to data stream and communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum conditional mutual information and approximate Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entangled simultaneity versus classical interactivity in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of communication and external information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction in quantum communication and the complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum one-way communication can be exponentially stronger than classical communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounds in Communication Complexity Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of pointer chasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Direct Product Theorems for Quantum Communication and Query Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Lower Bounds Using Directional Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Minimax Theorems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Information Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Information Theory / rank
 
Normal rank

Revision as of 17:10, 17 July 2024

scientific article; zbMATH DE number 6995730
Language Label Description Also known as
English
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
scientific article; zbMATH DE number 6995730

    Statements

    Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2018
    0 references
    disjointness
    0 references
    quantum communication complexity
    0 references
    quantum information complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers