arXiv:2610.02786
Quantum Error-Corrected Memories Keep Proper Time
Sebastian P. Kish, Simon J. Devitt
Abstract
What does quantum error correction do to relativistic proper time? We show that when two error-corrected quantum memories follow distinct worldlines and are controlled by local references, their local correction histories factor exactly from the proper-time difference between them. Error correction therefore does not erase time dilation: when the memories are compared, the accumulated difference appears as a relational phase rotation. During locally referenced operation this rotation is invisible to every local error syndrome; at discrete phases admitted by a code, the final relational evolution instead returns exactly as a deterministic logical gate, including an $S$-type Clifford gate at a $π/2$ excursion. These results connect fault-tolerant quantum information with relativistic clocks and establish protected quantum memories as a platform for preserving proper-time information and for long-coherence tests of quantum evolution involving relativistic proper time.
AI Summary
The paper asks whether quantum error correction removes the phase associated with relativistic proper-time differences between quantum memories. It considers two qubit registers following distinct worldlines, each controlled by a co-moving oscillator locked to its local transition. Under an explicit covariance assumption for local operations and noise, an interaction-picture argument factors any correction history into a rotation-free local circuit followed, in the final comparison frame, by $U_{\mathrm{rel}}=\exp[-i\omega_0\Delta\tau\sum_i Z_i/2]$. Local syndrome distributions contain no information about this relational phase. The paper separates this factorisation from logical sensitivity. For a code preserved by continuous collective $Z$ rotations, the logical amplification satisfies $\mathcal A\le n$, attained by the GHZ repetition encoding; detecting every single-qubit $Z_i$ forces $\mathcal A=0$. A stabilizer-normalizer expansion then describes finite-angle code-space response. Existing transversal-rotation conditions yield deterministic logical gates at selected excursions: a logical Pauli at $\pi$ when $Z^{\otimes n}$ is a nontrivial logical operator, an $S$-type gate for Steane at $\pi/2$, and $T^\dagger$ for the 15-qubit Reed–Muller code at $\pi/4$. In the distance-three examples, phase miscalibration produces quadratic rejection probability but sixth-order conditional process infidelity. For an 8.037-GHz transition separated vertically by 450 m, these excursions require approximately 1267, 634, and 317 s. No circuit-level lifetime analysis is supplied: feasibility requires sufficiently low accumulated logical failure and independent phase tracking. The factorisation is conditional on frame covariance; shared-reference control is a different protocol. Protected clock/no-clock interferometry and extensions beyond qubit encodings remain undeveloped.
Error found: The logical-gate corollary incorrectly asserts a universal Bell-state transformation and logical-Z-parity readout, although its hypothesis also permits logical Z gates that leave that parity unchanged. The Discussion's logical-Z-correlation readout does not distinguish the stated logical Bell states after diagonal S- or T-type gates without an additional basis-changing measurement. The three-qubit bit-flip and phase-flip repetition codes have ordinary quantum distance 1, so labeling them [[3,1,3]] confuses error-type-specific protection with quantum code distance.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.