{
  "abstract": "We present a total function with a polylogarithmic two-message quantum protocol, whereas every randomised protocol, even with arbitrarily many rounds, requires polynomial communication.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.18784",
  "author_total": 1,
  "authors": [
    {
      "name": "Dmytro Gavinsky"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/9y3441m4pwdwp.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.18784",
  "fulltext_url": null,
  "id": "9y3441m4pwdwp",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.18784",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7203895313",
  "pdf_url": "https://arxiv.org/pdf/2608.18784",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-17",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/9y3441m4pwdwp.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:52Z",
      "native_id": "2608.18784",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.18784"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "On the quantum communication complexity of total functions",
  "title_text": "On the quantum communication complexity of total functions",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:41Z",
  "url": "https://research.draconitic.com/paper/9y3441m4pwdwp",
  "venue": "arXiv",
  "versions": []
}