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

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