Bare Quantum simultaneity versus classical interactivity in communication complexity

@article{Gavinsky2020BareQS,
  title={Bare Quantum simultaneity versus classical interactivity in communication complexity},
  author={Dmitry Gavinsky},
  journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2020}
}
  • Dmitry Gavinsky
  • Published 2020
  • Mathematics, Computer Science, Physics
  • Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol. 
3 Citations
Communication Complexity of Private Simultaneous Quantum Messages Protocols
TLDR
It is demonstrated that the privacy condition inevitably increases the communication cost in the two-party PSQM model as well as in the classical case presented by Applebaum, Holenstein, Mishra, and Shayevitz, and it is proved that a lower bound (3 − o(1)n) is proved of the communication complexity inPSQM protocols with a shared random string for random Boolean functions of 2n-bit input. Expand
Communication memento: Memoryless communication complexity
TLDR
It is shown that the memoryless communication complexity of F characterizes the logarithm of the size of the smallest bipartite branching program computing $F$ (up to a factor 2); exponential separations between the classical variants of memoryless Communication models are given; and exponential quantum-classical separations in the four variants of the memorylessness communication model are exhibited. Expand
Quantum and Classical Hybrid Generations for Classical Correlations
TLDR
This work considers two-stage hybrid protocols that combine quantum resource and classical resource to generate classical correlations shared by two separated players, and analyzes the mathematical structures of these hybrid protocols. Expand

References

SHOWING 1-10 OF 32 REFERENCES
Classical interaction cannot replace a quantum message
We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O(log n) but requires exponentially more communication in the classicalExpand
Entangled simultaneity versus classical interactivity in communication complexity
TLDR
Shape is presented, which can be computed by a protocol sending entangled simultaneous messages of poly-logarithmic size, and whose classical two-way complexity is lower bounded by a polynomial. Expand
Quantum one-way communication can be exponentially stronger than classical communication
TLDR
The question whether the same exponential separation can be achieved with a quantum protocol that uses only one round of communication is settled in the affirmative. Expand
Exponential separation of quantum and classical communication complexity
  • R. Raz
  • Mathematics, Computer Science
  • STOC '99
  • 1999
TLDR
It is shown that for certain communication complezity problems quantum communication protocols are exponentially faster than classical ores and an ezponential gap between quantum communication complexity and classical probabilistic communication complexity is given. Expand
Entangled Simultaneity Versus Classical Interactivity in Communication Complexity
TLDR
A partial function <inline-formula> that can be computed by a protocol sending entangled simultaneous messages of poly-logarithmic size and whose classical two-way complexity is lower bounded by a polynomial is presented. Expand
Quantum vs. classical communication and computation
TLDR
A simple and general simulation technique is presented that transforms any black-box quantum algorithm to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism, to obtain new positive and negative results. Expand
Exponential separation of quantum and classical one-way communication complexity
TLDR
The Hidden Matching Problem HMn is defined and it is proved that any randomized linear one-way protocol with bounded error for this problem requires Ω(√[3] n log n) bits of communication. Expand
Quantum Versus Classical Simultaneity in Communication Complexity
  • Dmitry Gavinsky
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2019
TLDR
This paper contributes to understanding the power of the weakest commonly studied regime of quantum communication–SMP with quantum messages and without shared randomness. Expand
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
TLDR
This work gives an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean hidden matching problem of Bar-Yossef et al.) and gives a number of applications of this separation. Expand
On the Distributional Complexity of Disjointness
  • A. Razborov
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1992
We prove that the distributional communication complexity of the predicate “disjointness” with respect to a very simple measure on inputs is Ω(n).
...
1
2
3
4
...