{"id":"378b5ae7-ff12-456c-a318-39b7e80069ec","arxiv_id":"2411.12952","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"A gamma-adapted four-qubit code found by biconvex optimization outperforms the standard Leung-Nielsen-Chuang-Yamamoto code against amplitude damping, with analytical recovery achieving Fent = 1 - 1.85 gamma^2.","lead":"The authors use alternating semidefinite programming to optimize both the encoder and recovery of a four-qubit quantum error correction code for amplitude damping noise, and report a new code with improved entanglement fidelity over the prior Leung-Nielsen-Chuang-Yamamoto code. The result is a noise-adapted scheme with both numerical and analytical recovery operators, aimed at superconducting circuits and other systems dominated by energy decay.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Analytical recovery equations (28)-(30) are internally inconsistent; the claimed 1.85γ² fidelity is unsupported by the printed operators.","rationale":"The reader's weakest assumption and my concern identify the same load-bearing section: the analytical recovery operators and the no-jump coefficient equation. I agree that the printed R7 does not reproduce Eq (28), and that this undermines the analytical fidelity claim. My direct calculation gives the |1L> coefficient as (1-γ), whereas the reader states (1-γ)²; the substantive point is the same, so agreement is partial rather than full. I did not find a fatal flaw in the numerical biconvex/SDP portion: the codeword and optimized-recovery claim are plausible and follow standard methods, although the absence of code/data is a separate reproducibility concern. The analytical inconsistency is sufficient to keep the paper conditional: the authors should correct Eqs (23)-(30) or clearly mark them as leading-order schematics, and release the numerical optimization code or data before final acceptance.","tokens_in":8882,"tokens_out":13566,"duration_ms":127952,"concrete_test":"Symbolically evaluate (R7+R8)E0|0L> and (R7+R8)E0|1L> using the printed R7, R8 and codewords (14)-(15), and verify the CPTP condition Σ_i R_i†R_i = I. If the coefficients differ from Eq (28), re-solve the corrected analogue of Eq (29) for α,β, then compute Fent(γ)=1-cγ²+O(γ³) for the corrected analytical recovery. Compare c with the claimed 1.85 and the LNCY value 2.75; the analytical outperformance claim stands only if the re-derived c < 2.75 and preferably is close to 1.85.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The analytical half of the outperformance claim rests on R1-R8 plus the fitted coefficients α,β from Eq (30) and the no-jump relation Eq (28). Directly applying the printed operators to the codewords (14)-(15) gives different coefficients. Let t=1-γ and s=√(1 - t²/2). Then E0|0L> = s|0000> + t³/√2 |1111> and E0|1L> = t|1L>, because each |1L> basis term has two |1>s and A0 multiplies each by t. Applying R7 together with R8, which also acts on the no-jump |0L> components, yields (R7+R8)E0|Ψ> = [(α+β)s + (β-α)t³/√2] C0|0L> + t C1|1L>. Eq (28) instead reports (β-α)(1-γ)/√2 and (1-γ)/2 for these coefficients; both the power of t and the factor of two are wrong. Equations (23)-(24) contain analogous subleading errors, e.g. E1000|0L> is √(γt⁵/2)|0111> rather than √(γt/2)|0111>, and these O(γ^{3/2}) amplitude corrections feed O(γ²) fidelity. Since Eq (29) optimizes α,β against an incorrect target, the quoted α and the resulting Fent=1-1.85γ² are unsubstantiated. This is an internal consistency defect, not a disagreement with consensus, and no code or data is supplied to bypass it.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a four-qubit quantum error correcting code tailored to the amplitude damping channel, obtained by alternating semidefinite programming over the encoding and recovery channels. The central claims are that the optimized code achieves an entanglement fidelity Fent = 1 − 1.09γ² + O(γ³), beating the Leung–Nielsen–Chuang–Yamamoto code's Fent = 1 − 1.25γ² + O(γ³), and that an analytically constructed recovery achieves Fent = 1 − 1.85γ² versus 2.75γ² for the LNCY analytical recovery. The paper also argues that the code satisfies an approximate QEC criterion up to O(γ²) for no-damping and single-damping errors.","tokens_in":9282,"tokens_out":11100,"duration_ms":103400,"significance":"If correct, the proposed code would be a useful noise-adapted QEC scheme for a physically relevant error channel, and the comparison against the external LNCY benchmark is a genuine strength rather than a circular claim. The explicit codeword, the explicit recovery operators, and the use of alternating SDP are attractive features. However, the analytical recovery derivation contains concrete algebraic inconsistencies that leave the analytical outperformance claim unsupported as stated, and the numerical comparison is not backed by code, data, or error bars. The manuscript is therefore promising but requires substantial correction before the main claims can be accepted.","major_comments":[{"comment":"Equation (28) does not follow from the printed recovery operators. With t = 1 − γ, the codewords in Eqs. (14)–(15) give E0|0L⟩ = sqrt(1 − t²/2)|0000⟩ + t⁵/√2 |1111⟩ and E0|1L⟩ = t²|1L⟩. Applying R7 alone gives a |0L⟩ coefficient α sqrt(1 − t²/2) + β t⁵/√2 and a |1L⟩ coefficient t², whereas applying R7 + R8 gives (α+β) sqrt(1 − t²/2) + (β−α) t⁵/√2 for |0L⟩ and t² for |1L⟩. Equation (28) instead reports (β−α)(1−γ)/√2 and (1−γ)/2. The origin of the factor 1/2 and the replacement of t⁵ and t² by t is not explained by any convention in the paper. Since Eq. (29) optimizes α, β against this incorrect target, the quoted α in Eq. (30) and the claimed Fent = 1 − 1.85γ² are unsupported by the printed operators. The analytical half of the outperformance claim needs a corrected derivation or a corrected set of recovery operators.","section":"§III C 2, Eqs. (28)–(31)"},{"comment":"The expansion for the leading diagonal entry of ⟨0L|Ea†Eb|0L⟩ is incorrect. From Eq. (14), ⟨0L|E0†E0|0L⟩ = 1 − t²/2 + t¹⁰/2 with t = 1 − γ, which expands to 1 − 4γ + 22γ² + O(γ³), not 1 − 2γ + O(γ²) as stated in Eq. (A.5). The corresponding |1L⟩ entry is t⁴ = 1 − 4γ + 6γ² + O(γ³), so the difference is still O(γ²) and Eq. (A.2) may survive, but the displayed expansion and the printed expression for A_{1,1} are not well formed. Because Eq. (A.8) uses these matrix elements to claim a maximal QEC-matrix deviation of 1/(2√2)γ + O(γ²), that bound needs to be rederived from corrected matrix elements.","section":"Appendix, Eqs. (A.5) and (A.8)"},{"comment":"The numerical support for the central comparison is incomplete. The codeword ansatz in Eq. (14) is verified only over γ ∈ [0.01, 0.1], while the asymptotic claims in Eq. (18) and the analytical fidelity statement are small-γ statements. No code, SDP solver inputs, or numerical data are provided, and the fitted fidelity coefficients are quoted without error bars or residuals. The authors should specify the full γ range used in Fig. 2, make the data or code available, and verify the codeword over a wider interval so that the claimed γ² coefficients can be checked against contamination by higher-order terms.","section":"§III A and Fig. 3"}],"minor_comments":[{"comment":"The coefficients in these equations are missing powers of (1−γ). A direct calculation gives E1000|0L⟩ = sqrt(γ(1−γ)⁴/2) |0111⟩, not sqrt(γ(1−γ)/2) |0111⟩, and E0110|0L⟩ = γ(1−γ)³/√2 |1001⟩, not γ/√2 |1001⟩. These errors do not change the logical correction action because the relevant states remain proportional to the same syndromes, but the displayed amplitudes should be corrected.","section":"Eqs. (23) and (26)"},{"comment":"The figure caption does not state what is plotted on the axes, whether the curves are raw numerical data or fits, or the γ range used. Adding axis labels, the fitting form, and the fitted coefficient values with uncertainties would greatly improve reproducibility.","section":"Fig. 2"},{"comment":"References [18]–[22] are not cited in the body of the paper, and reference [21] appears to duplicate reference [9]. The reference list should be pruned or the citations should be added.","section":"References"},{"comment":"There is a typo in the first paragraph: \"tolerents\" should be \"tolerates.\" Also, the phrase \"This expression of codeword works for γ ≪ 1\" is vague; a quantitative statement of the validity range and the error incurred outside it would be preferable.","section":"Introduction"}],"recommendation":"major_revision","confidential_remarks":"The numerical part of the paper is plausible, but the analytical recovery section contains load-bearing algebraic errors that must be fixed, and the numerical claims need to be backed by data or code. I would ask the editor to insist on those corrections before considering the paper for publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Clearest thing about this paper: the numerical claim is credible and the code instance is new. The biconvex optimization follows Noh et al. and Kosut-Lidar, and the specific gamma-dependent codeword in Eqs (14)-(15) plus the numerical recovery give Fent = 1 - 1.09γ², a modest but real improvement over the LNCY code's 1 - 1.25γ². The approximate QEC criterion check in the appendix is careful and gives a smaller deviation than LNCY, which is a nice supporting argument. That part deserves a serious referee.\n\nThe analytical recovery section does not hold up as printed. Directly applying R7 and R8 to the no-jump state gives coefficients that do not match Eq (28). For |1L>, R7 has |1L><1L|, so R7 E0 |1L> = (1-γ)|1L>, not (1-γ)/2 as printed. For |0L>, the |0000> and |1111> amplitudes pick up t³/√2 and s factors, giving something quite different from the expression in Eq (28). Eq (23) has a similar subleading error: E1000|0L> should be √(γ t⁵/2)|0111>, not √(γ t/2). These O(γ^{3/2}) amplitude errors feed O(γ²) fidelity. Since Eq (29) optimizes α,β against an incorrect target, the quoted α and the analytical Fent=1-1.85γ² are unsupported. This is an internal inconsistency, not a disagreement with consensus; the numerical results may still be fine.\n\nAlso, no code or data is shipped, so the SDP numbers are not independently checkable. The codeword expression is verified only over γ in [0.01,0.1], which is fine for the stated regime but should be stated as a range.\n\nWho is this for? People working on noise-adapted QEC for superconducting circuits will want to see the numerical code. The analytical recovery is meant for implementation, but as printed it shouldn't be used. The fix is straightforward: redo the derivation and re-optimize α,β against the correct coefficients. I'd send it to peer review with a request for major revision and code release, because the numerical contribution is likely correct and the analytical part is fixable.","headline":"Plausible numerical four-qubit AD code, but the analytical recovery section's printed equations don't support the claimed fidelity; needs correction and code release.","tokens_in":9747,"tokens_out":2757,"would_cite":false,"duration_ms":24984,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P70","90C22"],"pacs":["03.67.Pp","03.65.Yz"],"model":"deepseek-v4-flash","headline":"Co-optimizing encoding and recovery yields a four-qubit amplitude-damping code with entanglement fidelity $1 - 1.09\\gamma^2$, beating the previous $1 - 1.25\\gamma^2$.","keywords":["amplitude damping channel","four-qubit code","biconvex optimization","semidefinite programming","entanglement fidelity","approximate quantum error correction","noise-adapted code"],"falsifier":"Compute the Kraus sum $\\sum_{i=1}^{8} R_i^\\dagger R_i$ for the analytical recovery using Eqs. (30)-(31) and evaluate the entanglement fidelity of the full map on the amplitude-damping channel at, say, $\\gamma=0.01$; if the sum is not the identity or the fidelity deviates from $1 - 1.85\\gamma^2$, the analytical claim fails.","tokens_in":8710,"feed_emoji":"⚛️","tokens_out":8147,"duration_ms":74089,"temperature":0.7,"pith_summary":"Quantum error correction usually targets generic Pauli errors, but real noise like amplitude damping has a specific structure. This paper optimizes the encoding and the recovery together, using alternating semidefinite programming, and reports a four-qubit code tailored to amplitude damping. The optimized code reaches an entanglement fidelity of $1 - 1.09\\gamma^2$ for small damping probability $\\gamma$, beating the earlier Leung-Nielsen-Chuang-Yamamoto four-qubit code at $1 - 1.25\\gamma^2$. An analytical recovery map is also constructed, giving $1 - 1.85\\gamma^2$ versus $2.75\\gamma^2$ for the earlier code with analytical recovery. If correct, the result shows that co-designing the code and its recovery around the actual noise can buy a concrete fidelity advantage with only four qubits.","feed_headline":"New four-qubit code beats the standard amplitude-damping code","feed_subtitle":"Co-optimizing encoding and recovery cuts the leading error term from 1.25γ² to 1.09γ².","key_machinery":"The load-bearing object is the biconvex optimization over the encoding Choi matrix and the combined recovery-decode Choi matrix, solved by alternating semidefinite programming: optimize the recovery for a fixed encoding, then optimize the encoding for that recovery, and iterate. The optimized codewords are extracted from the solution, and the recovery/decoding map is decomposed into Kraus operators. The analytical version is a set of eight recovery operators $R_1$ through $R_8$: $R_1$-$R_4$ correct single-qubit damping on each of the four qubits, $R_5$ and $R_6$ handle two specific two-qubit damping errors on $|0_L\\rangle$, and $R_7$ and $R_8$ restore the logical states after the no-jump error, using fitted coefficients $\\alpha$ and $\\beta$. The approximate QEC criterion, which relaxes the perfect error-correction condition to hold up to $O(\\gamma^2)$, is what licenses the shorter four-qubit block.","core_discovery":"The paper's central claim is that there exists a four-qubit code, with codewords $|0_L\\rangle = \\sqrt{1 - \\tfrac{1}{2}(1-\\gamma)^2}\\,|0000\\rangle + \\tfrac{1}{\\sqrt{2}}(1-\\gamma)\\,|1111\\rangle$ and $|1_L\\rangle = \\tfrac{1}{2}(|0011\\rangle + |0101\\rangle - |1010\\rangle + |1100\\rangle)$, that, combined with a recovery optimized by alternating semidefinite programming, achieves entanglement fidelity $F_{\\mathrm{ent}} = 1 - 1.09\\gamma^2 + O(\\gamma^3)$ over the amplitude damping channel. This outperforms the Leung-Nielsen-Chuang-Yamamoto code, which reaches $1 - 1.25\\gamma^2 + O(\\gamma^3)$ with optimized recovery. The paper also constructs an analytical recovery map whose fidelity is $1 - 1.85\\gamma^2 + O(\\gamma^3)$, against $1 - 2.75\\gamma^2$ for the earlier code's analytical recovery. The code is shown to satisfy an approximate quantum error correction criterion: errors from the no-damping and first-order damping subspaces are suppressed to second order in $\\gamma$, with the maximal deviation from perfect QEC smaller than for the earlier code.","pith_inferences":["If the fidelity gap persists at realistic finite $\\gamma$, the code is a natural candidate for a logical memory experiment on superconducting qubits, where the benchmark would be the logical error rate per memory step as a function of $T_1$.","The same biconvex pipeline could be applied to dephasing or to a channel mixing amplitude damping and dephasing; the resulting code might interpolate between the amplitude-damping code and a stabilizer code.","Because the analytical recovery uses only a few fitted parameters, one could compile it into a concrete circuit and measure the actual fidelity, testing whether the $1 - 1.85\\gamma^2$ prediction holds beyond the model.","The paper's reliance on the $\\Delta M$ bound suggests a stronger statement may be true: that this four-qubit code is near the best possible four-qubit code for amplitude damping, but the paper only establishes the heuristic connection."],"forward_implications":["For small damping probabilities, the new code's leading error term $1.09\\gamma^2$ is smaller than the earlier code's $1.25\\gamma^2$, so in the $\\gamma \\lesssim 0.1$ regime it predicts a measurable fidelity advantage.","The alternating-SDP recipe provides a general template: fix a noise channel, co-optimize encoding and recovery, then read off a code and a recovery from the Choi matrices.","The analytical recovery operators are close to the numerical optimum, suggesting the scheme can be implemented without solving an SDP at runtime.","The approximate-QEC check shows the code corrects all single-qubit damping errors and the no-jump distortion to second order, which is the feature that explains the fidelity gain."],"supporting_citations":[{"why":"Defines the approximate QEC criterion and supplies the four-qubit code whose fidelities serve as the baseline.","marker":"[7]"},{"why":"Shows how to optimize the recovery channel for a fixed encoding by convex optimization, the step reused here.","marker":"[9]"},{"why":"Introduces biconvex optimization of encoding and recovery, the method this paper runs by alternating SDP.","marker":"[10]"},{"why":"Together with [10], establishes the biconvex optimization approach that the numerical search is built on.","marker":"[11]"},{"why":"Defines the entanglement fidelity measure used to compare the codes.","marker":"[12]"},{"why":"Provides the bound linking the QEC-matrix deviation $\\Delta M$ to near-optimal code fidelity, used to explain the gain.","marker":"[17]"}],"fun_headline_variants":["Co-optimized code reduces damping error term by 13%","Four-qubit code beats standard on amplitude damping","Damping-adapted code outperforms LNCY four-qubit code","Error term drops from 1.25γ² to 1.09γ² with new code","Quantum code co-optimizes encoding and recovery for damping"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The analytical outperformance claim stands on the assumption that the recovery operators $R_1$ through $R_8$ with the fitted coefficients $\\alpha,\\beta$ from Eq. (30) form a valid quantum recovery map that really achieves $F_{\\mathrm{ent}} = 1 - 1.85\\gamma^2 + O(\\gamma^3)$.","fun_headline_variants_meta":{"raw":{"variants":["Co-optimized code reduces damping error term by 13%","Four-qubit code beats standard on amplitude damping","Damping-adapted code outperforms LNCY four-qubit code","Error term drops from 1.25γ² to 1.09γ² with new code","Quantum code co-optimizes encoding and recovery for damping"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000856,"raw_usage":{"total_tokens":3719,"prompt_tokens":947,"completion_tokens":2772,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":563,"completion_tokens_details":{"reasoning_tokens":2679}},"tokens_in":563,"tokens_out":2772,"duration_ms":21821,"temperature":1.0,"reasoning_tokens":2679,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T17:02:04.785142+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the Kraus sum $\\sum_{i=1}^{8} R_i^\\dagger R_i$ for the analytical recovery using Eqs. (30)-(31) and evaluate the entanglement fidelity of the full map on the amplitude-damping channel at, say, $\\gamma=0.01$; if the sum is not the identity or the fidelity deviates from $1 - 1.85\\gamma^2$, the analytical claim fails.","supporting_citations":[{"cited_title":"Ekert and C","cited_arxiv_id":null,"evidence_quote":"Defines the approximate QEC criterion and supplies the four-qubit code whose fidelities serve as the baseline."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Shows how to optimize the recovery channel for a fixed encoding by convex optimization, the step reused here."},{"cited_title":"Reimpell and R","cited_arxiv_id":null,"evidence_quote":"Provides the bound linking the QEC-matrix deviation $\\Delta M$ to near-optimal code fidelity, used to explain the gain."}],"review_version":1}