Work

Improved Separations between Quantum and Classical Communication Complexity of Total Functions

Year: 2026

Type: preprint

Abstract: We refine Gavinsky's framework (arXiv:2608.18784) for exponential separations between quantum and randomized communication complexity of total functions and obtain larger separations: polylogarithmic quantum communication versus $\tildeΩ(\sqrt n)$ randomized communication with two quantum messages, and versus $Ω(n^{1-\varepsilon})$ for every fixed $0<\varepsilon<1$ with more quantum messages.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.16726

Author: Gall, François Le

Institution: Nagoya University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Ministry of Education, Culture, Sports, Science and Technology, Japan Society for the Promotion of Science, Core Research for Evolutional Science and Technology

Awards: G3578047007, G4023031295, Foundations of Secure Distributed Quantum Computing on Medium-Scale Quantum Computers, G4627739467, Foundations of Secure Distributed Quantum Computing on Medium-Scale Quantum Computers

OpenAlex ID: W7213410626

Cites:

Cited by:

Related to: 10