Efficient quantum protocols for XOR functions

DOI10.1137/1.9781611973402.136zbMath1422.68081arXiv1307.6738OpenAlexW4214608570MaRDI QIDQ5384098

Shengyu Zhang

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.6738

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

A Short List of Equalities Induces Large Sign-Rank, Structure of Protocols for XOR Functions, Dimension-free bounds and structural results in communication complexity, Unnamed Item, A Lifting Theorem with Applications to Symmetric Functions, Upper bounds on communication in terms of approximate rank