{
  "abstract": "We introduce ordered-angle coding for binary-unanimity testing among $n$ transformation-only users in a serial quantum architecture inherited from Loop-Back communication. User $B_i$ fixes one private sign across a logical word and applies $R(s_iα_j)$ in trial $j$. If $w$ users choose the negative sign, serial composition gives $R[(n-2w)α_j]$. We show that every fixed same-axis pulse that is deterministic for both unanimous inputs under the binary Bell readout has $α_j=q_jπ/(2n)$ with integer $q_j$. For a nonadaptive word $\\mathbf q=(q_1,\\ldots,q_m)$, a mixed Hamming weight imitates the unanimous signature with probability \\[ M_{\\mathbf q}(w)=\\prod_{j=1}^{m}\\cos^2\\!\\left(\\frac{πq_jw}{n}\\right). \\] Within this complete deterministic-unanimity pulse family, a finite perfect word exists if and only if $n$ is a power of two. For $n=2^r$, the dyadic word $(1,2,4,\\ldots,2^{r-1})$ is exact and pulse-minimal with $m_{\\min}=r=\\log_2n$ trials. It replaces the $O(n^2\\log(1/\\varepsilon))$ worst-case burden of repeated smallest-angle tests by exact $O(\\log n)$ verification. Odd primes instead admit balanced statistical words with uniform mixed-weight imitation $2^{-(p-1)}$. For actual operations $R(s_iα_j+δ_{ij})$, an ideal rejecting position is lifted to $\\sin^2Δ_j$, where $Δ_j=\\sum_iδ_{ij}$. This yields explicit robustness bounds with angular and binary-readout errors. Bell entanglement is not required for the additive algebra, but it keeps the traveler locally maximally mixed in every honest trial. We therefore present the result as a coded multiuser relation primitive with optional raw conference-key-candidate use, not as a composably secure conference-key protocol.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.05645",
  "author_total": 1,
  "authors": [
    {
      "name": "Luis Adrián Lizama-Pérez"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8erjpfth2gpvh.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.05645",
  "fulltext_url": null,
  "id": "8erjpfth2gpvh",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.05645",
  "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.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7211997787",
  "pdf_url": "https://arxiv.org/pdf/2609.05645",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-04",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8erjpfth2gpvh.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:19:48Z",
      "native_id": "2609.05645",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.05645"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Ordered-Angle Coding for Exact Multiuser Unanimity Testing",
  "title_text": "Ordered-Angle Coding for Exact Multiuser Unanimity Testing",
  "type": "preprint",
  "updated_at": "2026-10-30T12:19:48Z",
  "url": "https://research.draconitic.com/paper/8erjpfth2gpvh",
  "venue": "arXiv",
  "versions": []
}