{
  "abstract": "A fault-tolerant quantum computer runs behind a telemetry stream logging syndromes, decoder actions, resets and timing separately from the answer. Can it reveal the logical input? For a distance-$d$ rotated surface-code memory on a fixed schedule of $T=Θ(d)$ rounds, under three stated hypotheses (sector-scalar honest backbone, transcript locality, Kotecky-Preiss smallness), the channel from logical qubit to transcript is $e^{-Θ(d)}$-close in diamond norm to one that ignores the input. A statement of this kind follows generically from correctability-privacy duality. Anisotropy does not. Each logical axis pays the distance of its own coset, so under amplitude damping the computational-basis label is governed by the code's $Z$-distance $d_Z\\ge d_{\\min}$ and not by the code distance. Two codes of quantum distance $1$ make the gap concrete. A phase-flip code's $X$-syndrome transcript is exactly input-independent under unobserved damping, while a repetition code leaks at first order. A matched converse identifies the records that do expose it, among them a lattice-surgery parity readout. On a 156-qubit superconducting processor our sufficient certificate misses by $21.5\\times$, so the theorem cannot be invoked there. Measured directly, a $d_Z=1$ memory's record identifies its input with total variation $\\ge 0.927$ under randomised, label-balanced acquisition. Holding the code fixed and varying the damping exposure reproduces the parameter-free law, with exponent $0.85\\pm0.03$ against a predicted $0.86$. Randomized encoding returns the statistic to the floor at no two-qubit-gate cost. Fault tolerance does not grant transcript privacy. It relocates it, and only to the logical state, not to the circuit's identity.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.09334",
  "author_total": 2,
  "authors": [
    {
      "name": "Jiachen Shen"
    },
    {
      "name": "Hui Zhong"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5zj69kjt44d0v.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.09334",
  "fulltext_url": null,
  "id": "5zj69kjt44d0v",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.09334",
  "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 Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7212141151",
  "pdf_url": "https://arxiv.org/pdf/2609.09334",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-08",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5zj69kjt44d0v.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:20:12Z",
      "native_id": "2609.09334",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.09334"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Execution-transcript privacy for fault-tolerant surface-code memories",
  "title_text": "Execution-transcript privacy for fault-tolerant surface-code memories",
  "type": "preprint",
  "updated_at": "2026-10-30T12:20:12Z",
  "url": "https://research.draconitic.com/paper/5zj69kjt44d0v",
  "venue": "arXiv",
  "versions": []
}