Constant-round quantum advantage in communication complexity for total functions

quant-ph, cs.CC

Submitted: 2026-08-20

Updated: 2026-10-12

Comments: 13 pages

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Sources

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians