{"id":"ef9d486f-cb68-4bc0-841c-b5dcf034831f","arxiv_id":"2411.14389","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A single operator-algebra framework, EAOAQEC, unifies the EAQEC, EAOQEC, and EACQ approaches to entanglement-assisted quantum error correction.","lead":"Three older ways of using shared quantum entanglement to protect information are shown to be special cases of one new framework. The framework gives a single error-correction condition, a notion of distance, and a way to build new hybrid codes.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 uses Z(H) without specifying that H must exclude gauge generators, yet §5.1 defines H to include H_G. For such codes Z(H) is smaller than the true centralizer Z(⟨H_I,H_E⟩) of S, so Theorem 1 misclassifies gauge·logical errors as correctable.","rationale":"The reader's weakest assumption concerned the existence of a coset transversal acting as the identity on Bob's ebits. That concern appears not to land: for any code, the map E⊗I ↦ [E⊗I] from P_n/Z(H) to P_{n+e}/Z(S) is injective (E⊗I ∈ Z(S) iff E ∈ Z(H) when H is the subgroup actually extended) and both quotients have size 2^m, so every coset of Z(S) in P_{n+e} contains an element of the form E⊗I. Thus an identity-on-Bob transversal always exists by a counting argument; the paper's specific construction is not essential. The real load-bearing problem is different and more serious. Theorem 1's statement does not constrain the relationship between H and the gauge group G0, and §5.1 explicitly defines the starting group H to include H_G. Under that definition the proof's key step 'E⊗I ∈ N(S) iff E ∈ Z(H)' is false, and Theorem 1 misclassifies gauge·logical errors. Since Theorem 1 is the central unification claim, this is a correctness risk in the main result as written. The issue is fixable by defining H for the code parameters as the subgroup whose generators are extended to form S (i.e., ⟨H_I,H_E⟩), with gauge operators placed in G0, but the paper does not state this and its §5.1 notation actively suggests the opposite. Theorem 2's own proof uses Z(⟨H_I,H_E⟩), confirming that the paper's authors had the correct set in mind for the special case while Theorem 1's notation is inconsistent with it. Given that the mathematical core can likely be repaired by a clarifying revision, a conditional acceptance with a request for this correction is appropriate.","tokens_in":38507,"tokens_out":35982,"duration_ms":320996,"concrete_test":"Implement the [[3,1;1,1]] EAOQEC code given by H = ⟨Z1,X1,Z2,X2⟩, S = ⟨Z1Z4,X1X4⟩, G0 = ⟨Z2,X2⟩, T0 = {I}. Compute N(S) \\ G directly from the generators of S and G, and compute the correctable set predicted by Theorem 1 using Z(H) with H as defined in §5.1. Check membership for E = Z2X3 and for E = X3. If Theorem 1's allowed set does not equal the complement of N(S) \\ G, the theorem as stated is false for this code. Then repeat with H' = ⟨Z1,X1⟩ (gauge moved to G0) and verify that the resulting condition matches Eq. (1) and Theorem 2.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Theorem 1 (Eq. (2)) translates the OAQEC condition (Eq. (1)) into the entanglement-assisted setting using the set Z(H). Its proof asserts that E⊗I ∈ N(S) iff E ∈ Z(H). This equivalence holds only when the generators of H are exactly the operators extended to form S. In §5.1, however, the authors construct EAOQEC codes by taking H = ⟨H_I, H_E, H_G⟩, extending only H_I and H_E to obtain S = ⟨eHI, eHE⟩, and placing H_G in G0. For such codes, E⊗I commutes with S iff E commutes with ⟨H_I, H_E⟩; it need not commute with H_G. Hence Z(S) ∩ (P_n⊗I) = Z(⟨H_I,H_E⟩)⊗I, not Z(H)⊗I. Consequently, Theorem 1's condition is wrong for the very class it claims to specialize to. Concretely, for an [[3,1;1,1]] code with H_E = ⟨Z1,X1⟩, H_G = ⟨Z2,X2⟩, S = ⟨Z1Z4,X1X4⟩, G0 = ⟨Z2,X2⟩, and T0 = {I}, the operator E = Z2X3 lies in P_n \\ Z(H) because Z2 anticommutes with X2 ∈ H_G. Theorem 1 therefore classifies E as correctable. But E⊗I commutes with S (it is supported on qubits 2 and 3) and is not in G = ⟨S,G0,iI⟩, so E⊗I ∈ N(S) \\ G; it is uncorrectable by Eq. (1) and by the paper's own Theorem 2, whose proof explicitly uses Z(⟨H_I,H_E⟩). The claimed unification thus rests on an unstated, inconsistent definition of H.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a framework called EAOAQEC, intended to unify entanglement-assisted quantum error-correcting codes (EAQEC), entanglement-assisted operator quantum error-correcting codes (EAOQEC), and entanglement-assisted hybrid classical-quantum codes (EACQ) by viewing them through operator algebra quantum error correction (OAQEC). The main technical object is a code C(H,S,G0,L0,T0), where H is an n-qubit Pauli subgroup, S is an Abelian extension of part of H on n+e qubits, G0 and L0 are gauge and logical operators, and T0 is a subset of coset representatives. Theorem 1 gives a correctability condition in terms of the centralizer Z(H), Definition 2 defines a code distance from the same set, and subsequent sections specialize this to EAQEC, EAOQEC, EACQ, and provide subsystem-code constructions and characterizations. The paper is built on the stabilizer formalism for OAQEC introduced in [24].","tokens_in":38861,"tokens_out":8526,"duration_ms":78541,"significance":"If the central theorem were correct, the unification would be a useful conceptual and technical contribution: it would reduce correctability questions for all previously known entanglement-assisted code families to one algebraic condition, yield a unified distance notion, and provide new constructions of hybrid and subsystem codes. The paper also contains several worked examples and explicit algorithms, which are valuable for potential applications. However, the central theorem as stated is inconsistent with the paper's own EAOQEC specialization, because the input group H is allowed to contain gauge generators that are not extended into S. This makes the claimed unification currently unsupported. The issue appears fixable within the manuscript's scope by giving H a consistent definition and re-deriving the affected statements, but the correction is substantial.","major_comments":[{"comment":"The paper defines EAOQEC codes by taking H = <H_I, H_E, H_G>, then extending only H_I and H_E to form S, so H includes the gauge generators H_G. Theorem 1, however, uses Z(H) in its correctability condition, and its proof asserts that E⊗I belongs to N(S) if and only if E belongs to Z(H). For such codes, E⊗I commutes with S if and only if E commutes with <H_I, H_E>; it need not commute with H_G. Hence Z(S) ∩ (P_n ⊗ I) is Z(<H_I,H_E>)⊗I, not Z(H)⊗I, and Theorem 1's condition is wrong for the EAOQEC specialization. Concretely, for an [[3,1;1,1]] code with H_E = <Z1,X1>, H_G = <Z2,X2>, S = <Z1Z4,X1X4>, G0 = <Z2,X2>, and T0 = {I}, the operator E = Z2X3 lies outside Z(H) and is therefore classified as correctable by Theorem 1. But E⊗I commutes with S and is not in G = <S,G0,iI>, so E⊗I is in N(S) \\ G and is uncorrectable by Eq. (1) and by Theorem 2. The claimed unification therefore does not hold as stated; the framework needs an unambiguous definition of H (for example, H = <H_I,H_E> for EAOQEC codes) and a re-derivation of Theorem 1 and Definition 2 under that convention.","section":"Section 4, paragraph after Eq. (1)"},{"comment":"The paper asserts that a coset transversal T for an EAOAQEC code can always be chosen so that every T ∈ T has the form T = T^(n) ⊗ I, i.e., acts as the identity on Bob's ebits. This property is load-bearing: Theorem 1 and Definition 2 both rely on it. The support given is only a sketch, based on a set of destabilizer-type operators. Please provide a complete proof or a precise sufficient condition for the existence of such a transversal. If there are valid EA code constructions for which every transversal representative must act nontrivially on the ebits, then Eq. (2) and Eq. (3) would not follow for those codes.","section":"Section 4, paragraph after Eq. (1)"},{"comment":"The proof of the backward direction of Theorem 5 relies on Algorithm 1, but the algorithm's update rule 'Tp → Tp T1_{TpHi=-HiTp}j' uses an undefined indicator-style notation, and the proof that the final sets SQgen and SCgen satisfy the claimed generation, coset, and commutation properties is sketched rather than fully demonstrated. Since Theorem 5 is stated as a complete characterization of EACQ representability, this needs a rigorous proof, especially because the argument invokes Corollary 2 and Lemma 3, whose proofs are also terse.","section":"Section 6.1, Theorem 5 and Algorithm 1"}],"minor_comments":[{"comment":"The phrase 'we perform a symplectic-isotropic decomposition on A and ensure we get the isotropic subgroup to be Z(A)' is confusing: the isotropic subgroup is a subgroup of A, whereas Z(A) generally contains elements outside A. Please clarify the intended decomposition and justify this step.","section":"Lemma 3 proof"},{"comment":"The definition 'H′ = H ∪ {G_Z1, ..., G_Zy}' should read 'H′ = <H, G_Z1, ..., G_Zy>' because H ∪ {generators} is not generally a group.","section":"Section 7.1, gauge fixing construction"},{"comment":"The displayed equation labeled (19) has a stray closing parenthesis after the display, and the phrase 'Equation (19),' at the beginning of the next paragraph should simply be 'Equation (19)'.","section":"Equation (19) and surrounding text"},{"comment":"The notation S_Q^(I) is used in Eqs. (8) through (11) without being defined; it presumably denotes the isotropic subgroup of S_Q, but this should be stated explicitly.","section":"Theorem 4 proof"}],"recommendation":"major_revision","confidential_remarks":"The main correctability criterion is derived by specializing Eq. (1) from [24], a paper with substantial author overlap. This is not by itself a reason to reject, but the manuscript should state more explicitly what is genuinely new beyond importing that condition. The inconsistency between Theorem 1 and the EAOQEC specialization in Section 5.1 is a serious correctness issue, but it appears repairable by redefining H consistently; for that reason I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing you should know: the stress-test note is right, and it kills the paper's central claim. Theorem 1 defines correctability using Z(H), where H includes the gauge generators H_G in the EAOQEC construction of Section 5.1. But those gauge generators are not part of the stabilizer S; they are extended with identity and live in G0. So E⊗I can commute with S without commuting with H_G. Their concrete example—H_E = ⟨Z1,X1⟩, H_G = ⟨Z2,X2⟩, S = ⟨Z1Z4,X1X4⟩—works: E = Z2X3 is classified correctable by Theorem 1 but is actually in N(S)\\G and uncorrectable by their own Theorem 2. That is not a minor gap; it is an internal contradiction between the general theorem and the EAOQEC special case. The unification fails exactly for the subsystem codes it claims to include.\n\nWhat is genuinely good: the paper addresses a real open problem and the operator-algebra viewpoint is sensible. The characterization of EACQ codes as a proper subclass of EA hybrid subspace codes (Lemma 1, Theorem 5) is new and the testable condition is a useful contribution, at least for the G0=∅ case where no gauge generators are mixed into H. The distance bounds (Theorem 4) and the code constructions in Section 7 appear to be correct on the subspace/hybrid side. The color code examples are concrete and checkable.\n\nSoft spots beyond the main bug: several proofs are sketches rather than derivations (e.g., the proof of Theorem 1, Lemma 4, Proposition 1). Algorithm 1 has no correctness proof, and Theorem 5 relies on it. The central theorem is imported as a black box from [24] (three of the same authors), and the reduction is too quick—exactly where the mistake hides. The paper would need: (i) a corrected Theorem 1 using Z(⟨H_I,H_E⟩) or a properly defined H that excludes H_G; (ii) a correctness proof for Algorithm 1; (iii) a benchmark or explicit comparison showing the new constructions actually fall outside earlier frameworks.\n\nWho this is for: QEC theorists working on entanglement-assisted codes. The EACQ characterization and the constructions are worth reading, but the flagship unification claim is wrong as stated and should not be cited until fixed. A serious referee should engage with it; if the authors patch the theorem, the paper could be solid. Recommend: send to peer review, but flag the internal contradiction prominently.","headline":"The unification theorem is wrong for subsystem codes: Theorem 1 misclassifies gauge-type errors, contradicting the paper's own Theorem 2 for EAOQEC.","tokens_in":39468,"tokens_out":5097,"would_cite":false,"duration_ms":45329,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P70","94B60"],"pacs":["03.67.Pp"],"model":"deepseek-v4-flash","headline":"This paper claims that a single algebraic condition, Theorem 1's Eq. (2), governs error correction for every entanglement-assisted quantum code, unifying EAQEC, EAOQEC, and EACQ.","keywords":["entanglement-assisted quantum error correction","operator algebra quantum error correction","stabilizer formalism","subsystem codes","hybrid classical-quantum codes","code distance","EAOAQEC"],"falsifier":"Find or compute a valid EAOAQEC code whose normalizer cosets cannot all be represented by operators of the form $T^{(n)}\\otimes I$; for such a code Eq. (2) and the distance formula Eq. (3) would not follow from Eq. (1), and the unified criterion would fail.","tokens_in":38266,"feed_emoji":"🔐","tokens_out":5098,"duration_ms":43253,"temperature":0.7,"pith_summary":"This paper introduces a single framework for entanglement-assisted quantum error correction, called EAOAQEC, that contains the previously separate EAQEC, EAOQEC, and EACQ code families. The central claim is that every such code can be viewed as an operator-algebra quantum error correcting code built from an extended stabilizer, and that one algebraic condition — membership of $E_a^\\dagger E_b$ in the set of Eq. (2) — decides exactly which error sets are correctable. The generality matters because it converts code design, distance computation, and error correction questions for all entanglement-assisted codes into one uniform formalism. The paper then uses that formalism to define a code distance, to characterize which hybrid classical-quantum codes arise as EACQ codes, and to construct new subsystem and hybrid codes that fall outside the older frameworks.","feed_headline":"One error condition governs all entanglement-assisted quantum codes","feed_subtitle":"The EAOAQEC framework reduces EAQEC, EAOQEC, and EACQ to a single algebraic test.","key_machinery":"The device that carries the argument is the EAOAQEC code $C(H,S,G_0,L_0,T_0)$: start with an $n$-qubit Pauli subgroup $H$, add one ebit for each anticommuting pair so the extended operators generate an Abelian stabilizer $S$ on $n+e$ qubits, then add gauge operators $G_0$, logical operators $L_0$, and a subset $T_0$ of normalizer coset representatives to encode subsystem and classical-hybrid structure. The workhorse is the normalizer-coset structure: because each transversal operator can be written $T=T^{(n)}\\otimes I$, Bob's ebits stay noiseless, and the correction condition of Eq. (1) collapses to the set membership of Eq. (2), with the code distance of Eq. (3) read off as the minimum weight of operators in the complementary set.","core_discovery":"The paper's central discovery is Theorem 1: for an EAOAQEC code $C(H,S,G_0,L_0,T_0)$, a set of errors $\\{E_a\\otimes I\\}$ with $E_a\\in P_n$ is correctable if and only if for all $a,b$, $E_a^\\dagger E_b$ belongs to the set $\\big(\\langle H_I,G_0^{(n)},iI\\rangle \\cup (P_n\\setminus Z(H))\\big)\\cap\\big(P_n\\setminus \\bigcup_{i\\neq j} T_i^{(n)}(T_j^{(n)})^{-1}Z(H)\\big)$, where $Z(H)$ is the centralizer of the original Pauli subgroup $H$. This condition is a direct application of the OAQEC stabilizer-formalism correctability test (Eq. (1)) to errors that act trivially on Bob's ebits. The authors state that this single theorem subsumes the error correction theorems of EAQEC, EAOQEC, EACQ, and ordinary OAQEC, and it yields a natural minimum-weight distance for the whole family.","pith_inferences":["Extension: the Eq. (2) criterion could be used as a search oracle, enumerating Pauli subgroups $H$ and transversal sets $T_0$ to classify all EAOAQEC codes by distance directly without first building the code through an older framework.","Extension: the clean-qubits construction suggests a two-way trade-off: choosing $e$ linearly independent columns of the check matrix to become ebits always yields an EAOAQEC code with distance at least the original, so the construction may double as a distance-amplification tool.","Extension: because EACQ representability is checked algorithmically by the paper's Algorithm 2, one can mechanically test whether a given EA hybrid subspace code admits a classical-quantum stabilizer splitting, which may expose further code families outside EACQ.","Extension: the framework's algebraic form strongly suggests the same Eq. (2) structure will carry over to qudits by replacing $P_n$ with the qudit Pauli group, even though the paper only proves the qubit case."],"forward_implications":["All entanglement-assisted error correction theorems (EAQEC, EAOQEC, EACQ) become special cases of Theorem 1, so existing code results can be re-derived and compared through one criterion.","The distance defined by Eq. (3) gives a uniform notion of minimum distance for every EAOAQEC code, with dressed and bare variants, and a separate distance when Bob's ebits are noisy.","EACQ codes are a proper subclass of EA hybrid subspace codes, characterized by the condition that the represented cosets form a subgroup and by the algebraic containment $H\\subseteq Z(Z(Z(T_0^{(n)})\\cap H))$.","The gauge-fixing, clean-qubits, entanglement-assisted gauge-fixing, and general gauge-fixing constructions produce new EAOAQEC subsystem and hybrid codes, including examples with parameters not captured by the previous frameworks."],"supporting_citations":[{"why":"Supplies the stabilizer formalism for OAQEC codes, including Eq. (1), from which Theorem 1 is derived.","marker":"[24]"},{"why":"Defines operator algebra quantum error correction and the testable conditions that underlie Eq. (1).","marker":"[9,10]"},{"why":"Introduces the original EAQEC framework and the ebit-extension construction that Section 3 generalizes.","marker":"[16]"},{"why":"Introduces EAOQEC subsystem codes, re-derived in Section 5.1 as the trivial-transversal special case.","marker":"[38]"},{"why":"Introduces EACQ classical-quantum codes, shown in Section 6 to be a proper subclass of EA hybrid subspace codes.","marker":"[44]"}],"fun_headline_variants":["One theorem unifies EAQEC, EAOQEC, EACQ, and OAQEC","Single algebraic condition covers all entanglement-assisted codes","All entanglement-assisted quantum codes obey one algebraic rule","EAOAQEC: a single correctability test for every EA framework","Unified error condition generalizes all entanglement-assisted QEC"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument assumes every EAOAQEC code has a coset transversal whose representatives act as the identity on Bob's ebits, which the paper sketches but does not fully prove.","fun_headline_variants_meta":{"raw":{"variants":["One theorem unifies EAQEC, EAOQEC, EACQ, and OAQEC","Single algebraic condition covers all entanglement-assisted codes","All entanglement-assisted quantum codes obey one algebraic rule","EAOAQEC: a single correctability test for every EA framework","Unified error condition generalizes all entanglement-assisted QEC"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000934,"raw_usage":{"total_tokens":3998,"prompt_tokens":946,"completion_tokens":3052,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":562,"completion_tokens_details":{"reasoning_tokens":2963}},"tokens_in":562,"tokens_out":3052,"duration_ms":22825,"temperature":1.0,"reasoning_tokens":2963,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T15:13:33.073805+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find or compute a valid EAOAQEC code whose normalizer cosets cannot all be represented by operators of the form $T^{(n)}\\otimes I$; for such a code Eq. (2) and the distance formula Eq. (3) would not follow from Eq. (1), and the unified criterion would fail.","supporting_citations":[{"cited_title":"General entanglement-assisted quantum error- correcting codes","cited_arxiv_id":null,"evidence_quote":"Introduces EAOQEC subsystem codes, re-derived in Section 5.1 as the trivial-transversal special case."}],"review_version":1}