{"id":"e6dee69a-6f27-4cc6-b632-aa6fdf2a6d75","arxiv_id":"2608.06304","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Time-reversal-invariant logical qubits on an odd number of spins have automatically scalar even-weight Pauli errors, so single-qubit error detection implies correction and every such code has odd distance.","lead":"Time reversal on an odd number of spins makes every even-weight Pauli error act as a scalar on a protected logical qubit, so detecting all single-qubit errors automatically corrects them. The paper derives this selection rule and reinterprets the Rains shadow enumerator as an overlap with the time-reversed code.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The shadow section's Eq. (17) is false as printed: for M=Y, fM=YMY=Y but ΘYΘ^{-1}=-Y. The Kramers/KL argument is unaffected; a transpose in Eq. (15) would repair the shadow claim.","rationale":"I read the central result as the Kramers selection rule for qubit codes: for Θ = (iY K)^{⊗n} and an odd-n invariant 2D code, every even-weight Hermitian Pauli compresses to a scalar and every odd-weight one to a traceless logical operator. That derivation is self-contained and correct. I checked the antiunitary conjugation (all three single-qubit Paulis flip, giving Eq. 2), the Kramers-pair compression (Hermitian even operators are scalar on the pair, Hermitian odd operators are traceless), and the K-L step for t=1 including phase-i products, which reduce to i times a Hermitian Pauli whose compression is already scalar or zero. Eq. 9 therefore holds. The only genuine defect I found is Eq. 17: the paper's own Eq. 15 defines spin flip without the transpose, and for Hermitian M one has ΘMΘ^{-1}=Y^{⊗n}M^T Y^{⊗n} ≠ Y^{⊗n} M Y^{⊗n} in general, with counterexample M=Y. Since the shadow reinterpretation and Rains-even/odd equivalences rest on Eq. 17, that part needs correction. The fix is local and plausibly matches the intended definition, so the overall verdict should remain conditional rather than moving to reject. This agrees with the reader's weakest-assumption analysis.","tokens_in":5640,"tokens_out":23050,"duration_ms":254515,"concrete_test":"Evaluate Eq. (17) on a single-qubit Pauli Y: compute fY = Y^{⊗1} Y Y^{⊗1} = Y and ΘYΘ^{-1} with Θ = iYK. Direct matrix action gives ΘYΘ^{-1} = -Y, so the equality fails. Then repeat the shadow derivation with the corrected definition fM = Y^{⊗n} M^T Y^{⊗n}; if Eq. (16)'s S_w is computed with this f, verify that fP = ΘPΘ^{-1} for any projector P and hence the overlap interpretation holds. This separates a typographical fix from a substantive flaw.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Eq. (15) defines fM = Y^{⊗n} M Y^{⊗n}, and Eq. (17) asserts fM = ΘMΘ^{-1}. This identity fails already for n=1, M=Y: fY = YYY = Y, while ΘYΘ^{-1} = -Y. More generally, for Hermitian M, ΘMΘ^{-1} = Y^{⊗n} \\bar{M} Y^{⊗n} = Y^{⊗n} M^T Y^{⊗n}, because Θ = (iY K)^{⊗n} and K M K = \\bar{M}. Thus the correct spin-flip operation requires the transpose, which Eq. (15) omits. Consequently the statements 'the spin flip is precisely time reversal' (Eq. 17-18), 'fP is the projector onto the time-reversed code', and the shadow-coefficient overlap interpretation are unsupported as written. This is load-bearing because the abstract advertises the shadow reinterpretation as a main result. However, the Kramers selection rule and the K-L reduction are independent of Eqs. (15)-(20): Eq. (6), the inference of even-weight K-L conditions, and the d≥2 ⇒ d≥3 corollary depend only on Eqs. (2)-(9) and remain valid.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript derives selection rules for quantum error correction from canonical time reversal on n spin-1/2 qubits. It argues that for a two-dimensional code invariant under Θ=(iY K)^{⊗n}, Eq. (2) turns time-reversal parity into Pauli-weight parity, so even-weight Pauli operators compress to scalars and odd-weight Pauli operators compress to traceless logical operators. This yields automatic Knill–Laflamme conditions for all even-weight error products, the implication d≥2⇒d≥3 for single-qubit error correction, and the claim that every time-reversal-invariant logical qubit has odd distance. The paper also proposes a reinterpretation of the Rains shadow enumerator as an overlap between the code and its time-reversed image, and extends the parity-grading idea to single spins and heterogeneous registers.","tokens_in":5913,"tokens_out":12514,"duration_ms":125901,"significance":"If the Kramers/KL portion holds, it is a useful conceptual unification: antiunitary symmetry reduces the KL constraints by roughly half, gives a symmetry explanation of why single-qubit detection implies correction, and applies without assuming a stabilizer or transversal structure. The derivation in Eqs. (1)-(9) is compact, parameter-free, and directly grounded in the definitions of Θ and the Kramers theorem. The shadow reinterpretation is attractive, but the manuscript currently contains an algebraic error in that section; because the error is local and fixable, the core contribution remains publishable after revision.","major_comments":[{"comment":"Equation (17) is false as printed. With fM defined in Eq. (15) as fM = Y^{⊗n} M Y^{⊗n}, the asserted identity fM = ΘMΘ^{-1} fails already at n=1, M=Y: fY = Y Y Y = Y, whereas ΘYΘ^{-1} = -Y. The correct statement is ΘMΘ^{-1} = Y^{⊗n} \\bar{M} Y^{⊗n} = Y^{⊗n} M^T Y^{⊗n}, since Θ=(iY K)^{⊗n} and K M K = \\bar{M} for Hermitian M. Thus the spin-flip in Eq. (15) must include the transpose (or Eq. (17) must be redefined as the time-reversal conjugation of M). This affects the shadow reinterpretation in Eqs. (16)-(20), the equivalences in Eq. (18), and the abstract's claim that the shadow coefficients are time-reversed overlaps. The Kramers/KL argument in Eqs. (1)-(9) does not depend on this identity and remains valid.","section":"Eqs. (15)-(17)"}],"minor_comments":[{"comment":"The displayed reduction is garbled: '3n+9 \\binom{n}{2} -/∫hortrightarrow 3n' should read '3n+9\\binom{n}{2} \\to 3n'. Please also clarify that the count refers to the number of low-weight Pauli errors, not to the number of Knill–Laflamme conditions.","section":"Eq. (10)"},{"comment":"The sentence 'Equivalently, every Kramers code has odd distance: if d≥2, then d≥3' is not an equivalence as written. The odd-distance conclusion follows from the stronger statement that every even-weight Pauli acts as a scalar, so every nontrivial logical operator must have odd weight; this should be stated explicitly.","section":"Eq. (9) and surrounding text"},{"comment":"The notation 'P EP|_C = a_0 I_L + a·σ_L' is slightly ambiguous; writing 'P E P restricted to C' would help readers distinguish the compression from the ambient operator.","section":"Eq. (3)"},{"comment":"Reference [10] is cited as a 2026 draft textbook with a URL; if a published version is available, it should be cited instead of or in addition to the draft.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The core Kramers/KL section is sound and likely publishable after a focused revision. The error in Eqs. (15)-(17) appears to be a missing transpose in the definition of the spin-flip; if the authors make that correction, the shadow reinterpretation can be repaired without changing the main selection-rule results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core result here is real. For a time-reversal-invariant logical qubit on an odd number of spin-1/2 constituents, every even-weight Pauli acts as a scalar and every odd-weight Pauli is traceless on the codespace. That directly gives the Knill-Laflamme reduction and the striking corollary that single-qubit detection implies correction. The derivation from Eqs. (1) through (9) is self-contained and internally consistent; you do not need the authors' earlier real-code construction. This is a fresh connection between Kramers degeneracy and QEC, and it is a useful conceptual tool.\n\nThe shadow section, however, has a real flaw that the stress-test note correctly identifies. Eq. (17) claims fM = ΘMΘ^{-1} with fM = Y^{⊗n} M Y^{⊗n}. That identity is false: for M=Y, fY = Y but ΘYΘ^{-1} = -Y. The correct spin-flip under time reversal is Y^{⊗n} M^T Y^{⊗n}, which means Eq. (15) is missing the transpose. This undercuts the advertised reinterpretation of shadow coefficients as overlaps with the time-reversed code. It is repairable: the Kramers/KL argument does not depend on Eqs. (15)-(20), and with the transpose inserted the shadow claim probably goes through. But as printed, one of the two headline results is unsupported.\n\nThe paper's other soft spots are minor. The single-spin spherical-tensor analogue is already in Gross (2021) and the authors cite it. The self-citations to their own prior work are appropriate: the real-code construction is cited as a sufficient route, not as the source of the effect. Eq. (10) has a typo that looks like a LaTeX artifact, but it does not affect the mathematics. The generalization to heterogeneous spin registers is sketched rather than proved, but it is a natural extension and clearly labeled as such.\n\nWho should read this? Anyone working on QEC codes with symmetry structure, and anyone using Rains shadow enumerators in LP bounds. The core selection rule deserves to be known, but the shadow half of the paper needs a careful revision before publication.\n\nMy recommendation: send this to peer review, but flag the transpose error prominently. The referee should insist on a corrected Eq. (15)-(17) and a re-check of the shadow claims. The central KL result is solid and should not be delayed by the repair.","headline":"The Kramers/Knill-Laflamme selection rule is a genuinely new and clean result; the shadow reinterpretation has a concrete transpose error that needs fixing before the paper is publishable.","tokens_in":6469,"tokens_out":1142,"would_cite":true,"duration_ms":12900,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P70","81R05"],"pacs":["03.67.Pp"],"model":"deepseek-v4-flash","headline":"Time reversal forces every even-weight Pauli to act as a scalar on a protected logical qubit, so detecting all single-qubit errors is enough to correct them.","keywords":["time-reversal symmetry","Kramers degeneracy","Knill-Laflamme conditions","quantum error correction","Pauli-weight parity","quantum shadow enumerators","logical qubit","spherical tensor operators"],"falsifier":"Take any explicit two-dimensional $\\Theta$-invariant subspace on an odd number of qubits that detects all weight-one Pauli errors and compute the Knill–Laflamme matrix $P E_a^\\dagger E_b P$ for every pair of single-qubit errors; an off-diagonal failure for any distinct pair would refute the claim that time-reversal invariance upgrades detection to correction.","tokens_in":5381,"feed_emoji":"⚛️","tokens_out":14424,"duration_ms":139217,"temperature":0.7,"pith_summary":"Time reversal, long a source of spectral protection in quantum mechanics, is shown here to be a structural principle for quantum error correction. For a logical qubit encoded in an odd number of spin-1/2 qubits and left invariant by time reversal, the encoded doublet is a Kramers pair, and the antiunitary grading forces every even-weight Pauli error to act as a scalar multiple of the identity while every odd-weight Pauli error is traceless on the code. Because products of two low-weight errors inherit this parity, all even-weight Knill–Laflamme conditions hold automatically: detecting all single-qubit errors is already enough to correct an arbitrary single-qubit error, and any such code has odd distance. The paper also gives the Rains quantum shadow enumerator a direct meaning, rewriting each coefficient as an overlap between the code and its time-reversed image.","feed_headline":"Time reversal upgrades error detection into correction","feed_subtitle":"A Kramers-invariant logical qubit has odd distance, so single-qubit detection already fixes single-qubit errors.","key_machinery":"The machine is the Kramers doublet: on an odd number of spin-1/2 qubits, exact invariance under $\\Theta=(iYK)^{\\otimes n}$, which squares to $-1$, forces the two-dimensional code to be a Kramers pair whose two states are exchanged by $\\Theta$. The selection rule is carried by the parity identity $\\Theta E\\Theta^{-1}=(-1)^{\\operatorname{wt}(E)}E$, which identifies time-reversal parity with Pauli-weight parity, together with the decomposition of any operator into time-reversal-even and time-reversal-odd parts. Comparing the compression of those parts on the invariant code yields Eq. (5) and hence Eq. (6): the even sector is a scalar and the odd sector is traceless. For the shadow part, the spin flip $fM=Y^{\\otimes n}MY^{\\otimes n}$ is presented as conjugation by time reversal, so the shadow coefficient $S_w$ becomes a sum of error-resolved overlaps between $C$ and $\\Theta C$; Rains-even and Rains-odd codes are then time-reversal-invariant codes and codes orthogonal to their time-reversed images.","core_discovery":"The central claim is the operator-level selection rule of Eq. (6): for a time-reversal-invariant code subspace $C$ on an odd number of qubits, with projector $P$ and canonical $\\Theta=(iYK)^{\\otimes n}$, an even-weight Hermitian Pauli $E$ compresses to $P E P = c_E P$ with $c_E=\\tfrac{1}{2}\\operatorname{Tr}(PE)$, and an odd-weight $E$ compresses to a traceless logical Pauli $P E P = a\\cdot\\sigma_L$. Combined with the fact that $E_a^\\dagger E_b$ for weight-$\\le t$ errors has weight $\\le 2t$, this makes every even-weight Knill–Laflamme condition automatic and reduces the constraints to odd weights $1,3,\\dots,2t-1$. For $t=1$ the result is $\\Theta C=C,\\ d\\ge 2 \\Rightarrow d\\ge 3$, so single-qubit error detection implies correction. The same Kramers mechanism is extended from Pauli-weight parity to spherical-tensor-rank parity for a single spin-$j$, and the Rains shadow is identified with the time-reversed code overlap.","pith_inferences":["Editorial inference: because any local $SU(2)$ rotation commutes with $\\Theta$, rotating a real transversal code yields new complex nontransversal Kramers codes with the same distance; this suggests a search strategy that the paper does not fully explore.","Editorial inference: if shadow coefficients are overlaps with the time-reversed code, then linear-programming bounds on code existence become geometric statements about how far a code can be from its own time-reversed image, which may support new bounds for small codes.","Editorial inference: a direct numerical check would generate random $\\Theta$-invariant two-dimensional subspaces for small odd $n$, verify the odd-weight Knill–Laflamme conditions, and confirm that all even-weight conditions hold automatically without being imposed."],"forward_implications":["Every time-reversal-invariant logical qubit on an odd number of qubits has odd distance; a code that detects all single-qubit errors automatically corrects them.","To build a distance-$(2t+1)$ code in this symmetry class, only odd-weight Knill–Laflamme conditions through weight $2t-1$ need to be imposed; the required error count drops from $O(n^{2t})$ to $O(n^{2t-1})$.","For stabilizer codes in this class, the odd-weight condition $A(E)=0$ rules out odd-weight stabilizers, while even-weight errors, even beyond the code's distance, already satisfy the Knill–Laflamme condition.","Rains-even codes are exactly time-reversal-invariant codes and Rains-odd codes are orthogonal to their time-reversed images; the zeroth shadow coefficient $S_0$ measures the symmetry defect.","In a single spin-$j$ register, detecting the linear-spin errors $\\{J_x,J_y,J_z\\}$ suffices for their correction, and heterogeneous spin registers inherit a selection rule graded by total tensor rank."],"supporting_citations":[{"why":"Supplies the antiunitary representation of time reversal and the fact that it squares to $-1$ for half-integer spin.","marker":"[1]"},{"why":"Sources the Kramers degeneracy mechanism that underlies the doublet structure.","marker":"[2]"},{"why":"Defines the Knill–Laflamme conditions that the selection rule is shown to satisfy automatically.","marker":"[6]"},{"why":"Defines the spin-flip shadow enumerator that the paper reinterprets through time reversal.","marker":"[7]"},{"why":"Provides the earlier real $X/Z$-transversal construction used as one sufficient route to Kramers invariance.","marker":"[8]"},{"why":"Supplies the Shor–Laflamme weight enumerators $A(E)$ and $B(E)$ used for the term-by-term reading.","marker":"[9]"},{"why":"Provides the general Kramers error-selection principle of which the qubit rule is presented as a special case.","marker":"[11]"}],"fun_headline_variants":["Time-reversal parity rules upgrade quantum error correction","Kramers-invariant qubits: detection implies correction","Odd qubit codes: time reversal forces distance 3 from 2","Time reversal makes even-weight errors harmless in odd qubit codes","Kramers doubles: automatic Knill–Laflamme for even weights"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the code is exactly invariant under canonical spin-1/2 time reversal $\\Theta=(iYK)^{\\otimes n}$; for the shadow identification, the spin flip must include the transpose that the printed equality omits, otherwise the claimed identity with time reversal fails for operators such as a single $Y$.","fun_headline_variants_meta":{"raw":{"variants":["Time-reversal parity rules upgrade quantum error correction","Kramers-invariant qubits: detection implies correction","Odd qubit codes: time reversal forces distance 3 from 2","Time reversal makes even-weight errors harmless in odd qubit codes","Kramers doubles: automatic Knill–Laflamme for even weights"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000218,"raw_usage":{"total_tokens":1405,"prompt_tokens":877,"completion_tokens":528,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":493,"completion_tokens_details":{"reasoning_tokens":440}},"tokens_in":493,"tokens_out":528,"duration_ms":4911,"temperature":1.0,"reasoning_tokens":440,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:54:16.532582+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take any explicit two-dimensional $\\Theta$-invariant subspace on an odd number of qubits that detects all weight-one Pauli errors and compute the Knill–Laflamme matrix $P E_a^\\dagger E_b P$ for every pair of single-qubit errors; an off-diagonal failure for any distinct pair would refute the claim that time-reversal invariance upgrades detection to correction.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Sources the Kramers degeneracy mechanism that underlies the doublet structure."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the spin-flip shadow enumerator that the paper reinterprets through time reversal."},{"cited_title":"Quantum Weight Enumerators for Real Codes with $X$ and $Z$ Exactly Transversal","cited_arxiv_id":"2306.12526","evidence_quote":"Provides the earlier real $X/Z$-transversal construction used as one sufficient route to Kramers invariance."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Shor–Laflamme weight enumerators $A(E)$ and $B(E)$ used for the term-by-term reading."},{"cited_title":"Kubischta,Quantum Codes from Symmetry, Ph.D","cited_arxiv_id":null,"evidence_quote":"Provides the general Kramers error-selection principle of which the qubit rule is presented as a special case."}],"review_version":1}