{"id":"28743aa7-19a4-4b4b-b457-64c0b2058d3f","arxiv_id":"2502.07075","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For a family of spherically symmetric quantum errors, any non-degenerate quantum code leaves the corrected state no closer to the ideal, and any detected syndrome randomizes the logical qubits.","lead":"Quantum error correcting codes fail to reduce the error for a special class of spherically symmetric noise called isotropic errors. The paper proves that when such a code detects an error, the quantum information is already scrambled, and the code can increase the error variance.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5 only covers a subclass of isotropic densities; for densities peaked beyond π/2 the code reduces the paper's own variance, so the abstract's universal claim is false.","rationale":"The reader's verdict REJECT is correct, but the most load-bearing defect is more internal than the reader's stated weakest assumption. The reader identified the non-phase-invariance of V as the weakest premise and noted separately that Theorem 5 only covers a subclass. Our stress test shows a stronger problem: even if one fully accepts the plain variance V as the error measure, the theorem's proof structure guarantees positivity of V(Φ̃)−V(Ψ) only under conditions (a)–(c). An isotropic density concentrated at an angle θ*∈(π/2,π) makes every expectation in the derived series negative, so the code strictly reduces V. Such densities are perfectly isotropic by Definition 1 and are not exotic: they are smooth Gaussian bumps on the sphere at a fixed latitude. Thus the advertised no-go statement is not merely overbroad relative to an unphysical measure; it is mathematically false for the paper's own definition of 'isotropic' and 'fix'. The uniformization result of Theorem 3 is an interesting and probably correct contribution, and the positivity analysis for non-increasing or left-weighted densities is valid. But because the abstract and conclusions claim universality, and because a genuine subclass of isotropic errors exhibits the opposite sign, the paper cannot support its headline claim. The reader's physical-observability concern remains relevant as a further issue, but the counterexample makes the rejection definitive without relying on that interpretive debate.","tokens_in":14489,"tokens_out":8000,"duration_ms":81453,"concrete_test":"Evaluate the variance-difference formula derived in the proof of Theorem 5 (Section 4) for a smooth isotropic density f_ε(θ₀)=Cε exp(−(θ₀−3π/4)²/ε²) restricted and normalized on [0,π], with a concrete code, e.g., d=4, d′=2. As ε→0 the quantity E[cosθ₀ sin^{2d+2k−2}θ₀] tends to cos(3π/4) sin^{2d+2k−2}(3π/4)<0 for every k≥1, so the derived formula gives V(Φ̃)−V(Ψ)<0. If the numerical computation confirms this negative sign, the abstract's universal claim is directly falsified even under the paper's own variance definition.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The abstract and conclusions assert without qualification that quantum error correcting codes do not fix isotropic errors, citing Theorem 5. Theorem 5, however, proves V(Φ̃)−V(Ψ)≥0 only for isotropic densities satisfying (a) non-increasing f, (b) support in [0,π/2], or (c) f(π/2−θ)≥f(π/2+θ) on [0,π/2]. In the proof of Theorem 5, the difference is given by V(Φ̃)−V(Ψ) = A·Σ_{k≥1} c_k E[cosθ₀ sin^{2d+2k−2}θ₀], where A>0 and c_k>0. For any narrow isotropic density centered at θ*=3π/4, every term E[cosθ₀ sin^{2d+2k−2}θ₀] is negative because cosθ₀<0 and sinθ₀>0 on the support. Therefore V(Φ̃)−V(Ψ)<0 for such a density: the code reduces the variance under the authors' own measure. This is not a borderline technicality; the theorem's conditions are exactly what force the relevant expectations to be nonnegative, and a Gaussian bump centered at 3π/4 violates all three conditions. The central claim 'no code fixes isotropic errors' is therefore false for the very class of errors the paper defines, independent of any debate about whether the plain variance is the right physical measure.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper models isotropic quantum computing errors as random variables on the real sphere associated with an n-qubit state, defines the variance V(X)=E[||X−Φ||²] with respect to the no-error state Φ=|0>, and compares V before and after application of a quantum error correcting code's correction circuit, under the assumption that the correction circuit introduces no new errors. It proves (Theorem 3) that conditional on a nonzero syndrome, the corrected state is uniform over the code subspace, and (Theorem 5) that under certain monotonicity, support, or symmetry conditions on the isotropic density, V(Φ̃)−V(Ψ)≥0, concluding that codes do not fix isotropic errors. The abstract and conclusions state the no-fix result without the conditions of Theorem 5.","tokens_in":14719,"tokens_out":9135,"duration_ms":93065,"significance":"If the unconditional claim were true, it would be a significant negative result for quantum error correction. The paper does contain a clear geometric derivation of the conditional variance comparison, and the uniformization statement for detected isotropic errors is interesting and appears to be a genuine structural observation. However, the central claim as stated is false: Theorem 5 is conditional, and a simple isotropic density concentrated near θ0=3π/4 violates the theorem's conditions and makes the code reduce the paper's own variance. In addition, the paper's chosen measure V is not phase-invariant and hence not a physical error measure, and the no-go does not transfer to the paper's own Vq or to fidelity. The correct conditional statement is much weaker than the title and abstract claim.","major_comments":[{"comment":"The abstract states without qualification that quantum error correcting codes do not fix isotropic errors, citing Theorem 5, but Theorem 5 only proves V(Φ̃)−V(Ψ)≥0 for densities satisfying one of (a) non-increasing, (b) support in [0,π/2], or (c) f(π/2−θ)≥f(π/2+θ). The proof reduces the difference to a positive constant times Σ_{k≥1} c_k E[cosθ0 sin^{2d+2k−2}θ0], so the conclusion depends exactly on these expectations being nonnegative. For an isotropic density concentrated near θ0=3π/4, every such expectation is negative because cosθ0<0 and sinθ0>0 on the support, and all three conditions fail; the code then strictly reduces the authors' own variance V. Thus the paper's central claim is false for the class of errors it defines, and the abstract's and Section 5's statements that isotropic errors are uncontrollable are not supported.","section":"Section 4, Theorem 5; Abstract"},{"comment":"The paper defines 'fix' as reduction of V(X)=E[||Ψ−Φ||²], where Ψ and Φ are represented as points on the real sphere with coordinates including an unphysical global phase. States differing only by a global phase are physically identical, and the paper itself defines Vq(X)=E[min_φ ||Ψ−e^{iφ}Φ||²] and notes that Vq is equivalent to fidelity. Since Vq(X)≤V(X) pointwise, the theorem's conclusion V(Φ̃)≥V(Ψ) does not imply Vq(Φ̃)≥Vq(Ψ); the code could reduce the physically meaningful quantum variance or increase fidelity while increasing V. Hence the title's claim about quantum codes is not established by the theorem. A no-go for Vq or fidelity would be needed to support the physical conclusion.","section":"Section 1, definitions of V and Vq"}],"minor_comments":[{"comment":"In the proof of Theorem 3, the sentence 'this random variable is also constant' should read 'this random variable has constant density'; as written it suggests the corrected state is deterministic, contradicting the uniform distribution established in the same paragraph.","section":"Section 4, proof of Theorem 3"},{"comment":"The variance difference is described as 'positive' in the proof of Theorem 5, but the theorem states nonnegativity; equality can occur, for example, for a uniform isotropic density, for which every E[cosθ0 sin^{2d+2k−2}θ0] vanishes.","section":"Section 4, proof of Theorem 5"},{"comment":"The derivation of Lemma 3(d) is summarized as 'concluded in a simple way' after an infinite series expansion; because this lemma carries the sign information used in Theorem 5, the intermediate algebra should be shown in full.","section":"Section 4, Lemma 3(d)"},{"comment":"The manuscript refers to 'Formula (8)' and 'Figure 4' without equation or figure numbers; numbering and callouts should be added throughout.","section":"General"}],"recommendation":"reject","confidential_remarks":"The self-citation to [13] is natural because the error model is introduced there and the paper builds on it. The central problem is the gap between the abstract and Theorem 5: the unconditional claim is false within the paper's own definitions, and the conditional theorem is too narrow to support the title. The phase-dependence of V further weakens the physical significance of the result. Unless the authors substantially reframe the paper around a much weaker claim, I do not see a path to acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper's one genuinely new and solid result is Theorem 3 — if the correction circuit registers any non-zero syndrome, the corrected logical state is uniform on the code subspace and all encoded information is gone. That is a nice geometric observation and it appears to be proved correctly. The rest of the paper, however, overclaims. Theorem 5 proves V(Φ̃) ≥ V(Ψ) only for isotropic densities that are non-increasing, or supported in [0,π/2], or symmetric decreasing about π/2. The abstract and conclusions drop those conditions and say 'quantum codes do not fix isotropic errors.' That stronger statement is false, even using the authors' own variance. Take a narrow isotropic density concentrated near θ0 = 3π/4. Then every term in their explicit expression for V(Φ̃)−V(Ψ) = A Σ c_k E[cosθ0 sin^{2d+2k−2}θ0] is negative, so the code reduces the variance. The theorem's hypotheses are exactly what force those expectations to be non-negative; they exclude the regime of large errors. This is not a borderline technicality — it is the difference between a qualified result and a universal one.\n\nA second soft spot is the choice of V over the phase-invariant V_q. The paper itself notes global phase is unphysical and defines V_q, then chooses V as 'the one that best reflects the distribution.' That is a modeling choice, but a no-go theorem about V is not directly about any experimentally accessible quantity. Fidelity behaves differently, and the paper's own inequalities show V_q is the more physical measure.\n\nWhat the paper does well: the spherical random-variable framework is carried through carefully, the integration identities check out, and the uniform-on-detection result does not depend on the variance debate. The citation of the authors' prior work is appropriate given the direct continuation.\n\nThis is a paper that should go to review, not be desk rejected, but it needs major revision. The abstract must be narrowed to the class where the theorem actually applies, or the theorem must be strengthened. The authors should also confront the variance-choice issue head on. If the uniform-on-detection result is the takeaway, that alone is worth a short paper; the no-go framing as written will mislead readers.","headline":"A clean uniform-on-detection result, but the headline no-go claim is false as stated: under the paper's own variance, isotropic errors peaked near the antipode are corrected.","tokens_in":15300,"tokens_out":3369,"would_cite":false,"duration_ms":32418,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P70","81P68"],"pacs":["03.67.Pp"],"model":"deepseek-v4-flash","headline":"This paper proves that quantum error-correcting codes cannot reduce the variance of isotropic quantum errors, and that any detected error leaves the corrected logical qubits uniformly distributed.","keywords":["quantum error-correcting codes","isotropic quantum computing errors","quantum computing error variance","random variables on sphere","syndrome detection","uniform distribution","error correction limitation"],"falsifier":"Choose a specific code and an isotropic density that violates all three conditions of Theorem 5, for instance one with a sharp peak at $\\theta_0 = 3\\pi/4$, and numerically evaluate $V(\\tilde{\\Phi})-V(\\Psi)$ from the formulas of Lemma 3; a negative value would refute the unconditional version of the claim. Alternatively, compute the phase-invariant quantum variance $V_q$ before and after correction for a normal isotropic error in a 5-qubit code: if $V_q$ decreases while $V$ does not, the no-go is a property of the chosen variance measure rather than of information recovery.","tokens_in":14240,"feed_emoji":"⚛️","tokens_out":9631,"duration_ms":85871,"temperature":0.7,"pith_summary":"The paper tries to establish a limitation of quantum error correction: for a broad class of noise called isotropic errors, applying the code's correction circuit never reduces the variance of the error, even on the idealized assumption that the correction circuit adds no new noise. It models an n-qubit state as a point on a real sphere and an error as a random variable whose density depends only on the distance from the encoded state. For every isotropic density that is non-increasing on the whole interval, supported only before the equator, or symmetric and decreasing around the equator, the proof shows that the variance after correction is at least the variance before correction. It also proves that whenever a nonzero error syndrome is detected, the corrected logical state is uniformly distributed, so all computing information is already lost. If the argument is correct, standard quantum error correction cannot be said to fix isotropic errors when success is measured by variance.","feed_headline":"Quantum codes cannot fix isotropic errors","feed_subtitle":"Proof: even a faultless correction circuit never lowers the error variance, and a detected error randomizes the logical state.","key_machinery":"The central object is the real-sphere representation of quantum states: an $n$-qubit state is a point on the unit sphere of dimension $2^{n+1}-1$, written in spherical coordinates so that the reference state $\\Phi=|0\\rangle$ sits at the pole and isotropy means the density $f(\\theta_0)$ depends only on the polar angle $\\theta_0$, equivalently only on $\\|\\Phi-\\Psi\\|$. The comparison of variances reduces to a series of integrals of $\\cos(\\theta_0)\\sin^{2d+2k-2}(\\theta_0)$, and Theorem 5 holds exactly when these integrals are nonnegative. The geometric engine of the proof is that an isotropic density is constant on the parallels of the sphere, so projecting onto a syndrome subspace and applying the inverse error operator produces a uniform distribution on the code subspace for every detected error.","core_discovery":"The central claim is Theorem 5: for an isotropic error $\\Psi$ with density $f(\\theta_0)$ that (a) is non-increasing on $[0,\\pi]$, (b) vanishes for $\\theta_0 \\geq \\pi/2$, or (c) satisfies $f(\\pi/2-\\theta) \\geq f(\\pi/2+\\theta)$, the corrected state $\\tilde{\\Phi}$ satisfies $V(\\tilde{\\Phi})-V(\\Psi) \\geq 0$. Because the correction circuit is assumed to introduce no new errors, the gap is an intrinsic property of the code and not a hardware artifact. The mechanism is Theorem 3: for any nonzero syndrome $s$, meaning the measurement has flagged a specific discrete error $E_s$, the post-correction state $E_s^{-1}\\Pi_s \\Psi$ is uniform over the code subspace, so the logical $m$-qubit carries no computational information. The paper's stated conclusion is that quantum error-correcting codes do not fix isotropic errors.","pith_inferences":["The proof establishes nonnegativity for three large but not exhaustive families of isotropic densities; the fully unconditional statement that no code fixes isotropic errors is stronger than what Theorem 5 demonstrates, since the sign of the integrals is what carries the conclusion.","Because the plain variance $V$ depends on the unphysical global phase, the no-go result does not by itself imply that information cannot be recovered; a code might still increase fidelity or reduce the phase-invariant variance $V_q$ for the same isotropic error.","The uniformization mechanism is purely geometric, so a similar no-go may extend to any noise ensemble that is invariant under enough rotations of the state sphere to make the syndrome-subspace projections uniform, not only strictly isotropic errors."],"forward_implications":["Under the conditions of Theorem 5, error correction cannot lower the variance of an isotropic error; the best possible outcome is equality, and for normal isotropic errors the inequality is strict.","If a correction circuit detects a nonzero syndrome for an isotropic error, the corrected logical state is uniform, so the computation cannot be recovered by further correction or post-processing.","These bounds hold in the idealized case where the correction circuit adds no new errors, so they constrain the theoretical capability of any quantum error-correcting code, not a particular implementation.","A code that appears to correct isotropic noise in practice must be judged by a different measure than this variance, or by an error model that is not isotropic."],"supporting_citations":[{"why":"Introduces the random-variable representation of quantum computing errors, the variance measure, and the notion of isotropic errors on which the whole proof rests.","marker":"[13]"},{"why":"Supplies the representation of n-qubit states as points on the unit sphere and the relation between quantum variance and fidelity used to frame the error measure.","marker":"[12]"},{"why":"Provides the stabilizer formalism for quantum codes, including discrete errors and syndrome measurement, which the paper's code model assumes.","marker":"[4]"},{"why":"Provides the optimal 5-qubit code used as the concrete example of a code that corrects all single-qubit errors, the benchmark against which the isotropic no-go result is contrasted.","marker":"[40]"}],"fun_headline_variants":["Quantum codes powerless vs isotropic errors, even perfect circuits","Proof: Quantum codes never lower isotropic error variance","Isotropic errors defeat all quantum codes, even ideal circuits","Even perfect correction fails to fix isotropic errors"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that an error is well described by an isotropic random variable on the state sphere and that its size is the plain variance $V = E[\\|\\Psi-\\Phi\\|^2]$, a measure that depends on the unphysical global phase rather than on a directly observable quantity like fidelity.","fun_headline_variants_meta":{"raw":{"variants":["Quantum codes powerless vs isotropic errors, even perfect circuits","Proof: Quantum codes never lower isotropic error variance","Isotropic errors defeat all quantum codes, even ideal circuits","Even perfect correction fails to fix isotropic errors"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001458,"raw_usage":{"total_tokens":5802,"prompt_tokens":811,"completion_tokens":4991,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":427,"completion_tokens_details":{"reasoning_tokens":4930}},"tokens_in":427,"tokens_out":4991,"duration_ms":32706,"temperature":1.0,"reasoning_tokens":4930,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T13:52:36.183666+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Choose a specific code and an isotropic density that violates all three conditions of Theorem 5, for instance one with a sharp peak at $\\theta_0 = 3\\pi/4$, and numerically evaluate $V(\\tilde{\\Phi})-V(\\Psi)$ from the formulas of Lemma 3; a negative value would refute the unconditional version of the claim. Alternatively, compute the phase-invariant quantum variance $V_q$ before and after correction for a normal isotropic error in a 5-qubit code: if $V_q$ decreases while $V$ does not, the no-go is a property of the chosen variance measure rather than of information recovery.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the random-variable representation of quantum computing errors, the variance measure, and the notion of isotropic errors on which the whole proof rests."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the representation of n-qubit states as points on the unit sphere and the relation between quantum variance and fidelity used to frame the error measure."},{"cited_title":"PhD thesis, California Institute of Technology, 1997","cited_arxiv_id":null,"evidence_quote":"Provides the stabilizer formalism for quantum codes, including discrete errors and syndrome measurement, which the paper's code model assumes."}],"review_version":1}