Execution-transcript privacy for fault-tolerant surface-code memories

• URL: http://arxiv.org/abs/2609.09334v1
• Date: Tue, 08 Sep 2026 18:20:46 GMT
• Title: Execution-transcript privacy for fault-tolerant surface-code memories
• Abstract summary: A fault-tolerant quantum computer runs behind a telemetry stream logging syndromes.<n>Can it reveal the logical input?<n>Fault tolerance does not grant transcript privacy. It relocates it, and only to the logical state, not to the circuit's identity.
• Score: 2.8225611777999906
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Threshold Behavior of ZX and ZY Surface Codes Under Circuit-Level Biased and Crosstalk Noise [0.0]
  Previous work demonstrated that replacing $Z$-type stabilizers with $Y$-type stabilizers significantly improves the surface code threshold under code-capacity level dephasing noise.<n>In this work, we construct and study a $ZY$ surface code by replacing the $X$-type stabilizers with $Y$-type stabilizers.
  arXiv  Detail & Related papers  (2026-09-09T22:34:27Z)
• Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks [38.61040361525374]
  An input may activate few hidden units even when different inputs collectively use an entire network.<n>We study the statistical complexity of this input-dependent sparsity in the one-hidden-layer ReLU model.
  arXiv  Detail & Related papers  (2026-09-08T17:53:03Z)
• Verified Pythagorean Composition for Adaptive Cryptographic Games: Noise Flooding in Homomorphic Encryption [45.00791460144501]
  Noise flooding is a standard defense against decryption attacks on approximate homomorphic encryption.<n>Our proof constructs a new relational program logic over SSProve semantics.
  arXiv  Detail & Related papers  (2026-08-14T00:40:29Z)
• Quantum error correction at ultra-low overhead [0.0]
  Suppressing errors is the central challenge for useful large-scale quantum computing.<n>We introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes.<n>Results bring demonstrations of ultra-low overhead quantum error correction within the reach of near-term quantum processors.
  arXiv  Detail & Related papers  (2026-08-03T18:13:57Z)
• Biased-Noise Quantum Reed-Solomon Codes and a Tornado Concatenation for Cat Qubits [0.9485024320296608]
  We build a bit-flip-only quantum Reed-Solomon (RS) code.<n>Errors are decoded by an optimal bounded-distance syndrome-lookup table.<n>Monte-Carlo simulation shows that at a physical bit-flip rate $p = 0.1$ the Tornado code reaches a logical error rate $p_L approx 5.3 times 10-3$, below both parent codes.
  arXiv  Detail & Related papers  (2026-07-14T09:42:53Z)
• Evolving Quantum Error-Correcting Encodings for Molecular Simulation [0.6372261626436676]
  We study a language model edits a program, an external verifier scores the result, and high-scoring programs are retained and remutated.<n>As a case study, we apply this loop to the Generalized Superfast (GSE), a fermion-to-qubit encoding.<n>To our knowledge these are the first GSE/superfast encodings beyond distance $3$ for dense molecular Hamiltonians.
  arXiv  Detail & Related papers  (2026-06-24T14:19:43Z)
• FibQuant: Universal Vector Quantization for Random-Access KV-Cache Compression [35.73320708128261]
  We introduce textscFibQuant, a universal fixed-rate vector quantizer.<n>The codebook combines Beta-quantile radii, Fibonacci,/,Roberts--Kronecker quasi-Max refinement.<n>On GPT-2 small KV caches, textscFibQuant traces a memory--fidelity frontier.
  arXiv  Detail & Related papers  (2026-05-12T03:45:53Z)
• Quantum $(r,δ)$-locally recoverable codes [37.306043163932905]
  We introduce the quantum counterpart of those codes by defining quantum $(r,delta)$-locally recoverable codes.<n>We show that there is an equivalence between the classical and quantum concepts of $(r,delta)$-local recoverability.
  arXiv  Detail & Related papers  (2024-12-21T11:45:32Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Exact results on finite size corrections for surface codes tailored to biased noise [0.0]
  We study the XY and XZZX surface codes under phase-biased noise. We find exact solutions at a special disordered point. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate.
  arXiv  Detail & Related papers  (2024-01-08T16:38:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.