{
  "abstract": "We give a direct analytic proof that every total Boolean function computable exactly with at most two quantum queries depends on at most six input variables. This bound is sharp. A previous derivation relied on a numerical classification of Boolean functions on at most four variables; to the best of our knowledge, ours is the first unconditional proof. The main difficulty beyond the one-query case is that query-path vectors need not be mutually orthogonal, so interference prevents the scalar weight-counting argument from applying. We overcome this difficulty by establishing a rigid support-and-branch decomposition: after the coordinates in the first-query support are fixed, the second query induces a family of exact one-query branches. This structural description may be of independent interest.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.34079",
  "author_total": 1,
  "authors": [
    {
      "name": "Yaqiao Li"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/b8zewcf27rxjy.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.34079",
  "fulltext_url": null,
  "id": "b8zewcf27rxjy",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.34079",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7223873833",
  "pdf_url": "https://arxiv.org/pdf/2610.34079",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-25",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/b8zewcf27rxjy.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:35Z",
      "native_id": "2610.34079",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.34079"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Two exact quantum queries use at most six variables",
  "title_text": "Two exact quantum queries use at most six variables",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:35Z",
  "url": "https://research.draconitic.com/paper/b8zewcf27rxjy",
  "venue": "arXiv",
  "versions": []
}