Work

Constant-round quantum advantage in communication complexity for total functions

Year: 2026

Type: preprint

Abstract: We show that there exists a total function for which there is a polynomial gap between the randomized and the constant-round quantum communication complexity. Previously, such a separation was known only for quantum protocols using polynomially many rounds.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2608.19787

Authors: Hasegawa, Atsuya, Gall, François Le

Institution: Nagoya University

Language: English

Topic: Quantum Information and Cryptography

Subfield: Atomic and Molecular Physics, and Optics

Field: Physics and Astronomy

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, 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: W7203893221

Cites: 1

Cited by: 1

Related to: 10