Pith. sign in

REVIEW 3 major objections 4 minor 19 references

Stored entanglement can be kept usable by re-distilling a [[4,2,2]]-encoded logical Bell pair before it decays too far; the paper derives the classical-communication latency bound that makes this wait-and-repair strategy beat BBPSSW.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

A [[4,2,2]] error-detecting code can refresh stored entangled states in place, extending their usable lifetime beyond BBPSSW when classical communication is below a derived threshold.

T0 review reviewed 2026-08-04 challenge →

load-bearing objection Competent analytical treatment of [[4,2,2]]-based distillation and re-distillation, but the lifetime extension claim rests on an unexamined deterministic-success assumption for probabilistic rounds. the 3 major comments →

arxiv 2509.06446 v1 pith:EQC6CNPQ submitted 2025-09-08 quant-ph

Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation

Huidan Zheng , Gunsik Min , Ilkwon Sohn , Jun Heo This is my paper
classification quant-ph
keywords entanglement distillationquantum error-detecting code[[4,2,2]] codequantum memoryfidelity decayclassical communication latencyBBPSSW protocolre-distillation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that entanglement stored in a quantum memory need not be treated as a perishable resource: if Bell pairs are first encoded into a logical entangled state using the [[4,2,2]] quantum error-detecting code, decoherence during storage can be fought by re-running distillation-style parity checks and refreshing the state, rather than regenerating and redistributing entanglement from scratch. The authors derive closed-form expressions for the output fidelity and pass probability of this code-based distillation and compare them with the BBPSSW protocol under the same 2:1 resource ratio. Their central quantitative result is a bound on classical communication time: re-distillation extends the usable waiting time beyond BBPSSW whenever T_cc is below the threshold in Eq. (12), T_cc < (1/2)((t_k - T_BBPSSW_W)/k - T_op). The analysis is carried out under ideal local operations and, in the latency bound, assumes each re-distillation round succeeds; those idealizations set the conditions under which the claimed memory-extension advantage applies. If correct, the work turns quantum memory management into a scheduling problem in which storage lifetime is traded against classical control speed.

Core claim

The central discovery is that a logical entangled state |f00⟩ = (|Φ+⟩⊗4 + |Ψ+⟩⊗4)/√2, produced by the [[4,2,2]] EDC-based purification of four noisy Bell pairs, can serve as a reusable memory resource. While a BBPSSW-purified Bell pair stored under dephasing crosses the target fidelity after waiting time T_BBPSSW_W and is then unusable, the logical state can be left in memory and, before decaying too far, refreshed with k rounds of local stabilizer checks and two-way classical communication. The usable waiting time is T_EDC_W = t_k - k(T_op + 2T_cc), where t_k is the deadline at which exactly k refreshes can restore fidelity above target; the protocol beats BBPSSW when T_cc < (1/2)((t_k - T_

What carries the argument

The load-bearing object is the [[4,2,2]] quantum error-detecting code, the smallest code with distance 2 that can detect a single error, and the logical entangled state it produces by encoding four Bell pairs into |f00⟩. The protocol's working is the mirrored parity-check mechanism: because (U_A⊗I)|Φ+⟩ = (I⊗U^T_B)|Φ+⟩, Alice's local stabilizer measurements induce the same syndrome structure on Bob's side, so both parties can decide to keep or discard using only local operations and classical communication. The wait-and-repair cycle is then quantified by the deadline t_k and the re-distillation time T_re(k) = k(T_op + 2T_cc), where T_op includes two single-qubit gates, two two-qubit gates, an

Load-bearing premise

The claimed lifetime extension assumes every refresh attempt succeeds; in reality the protocol's parity check passes only with some probability below one, and a failed attempt destroys the stored state, and that failure rate is left out of the waiting-time formula.

What would settle it

Run the storage experiment with a single logical Bell pair: prepare the [[4,2,2]] logical state at known fidelity, wait a fraction of coherence time, attempt k rounds of re-distillation, and measure the parity-check pass probability, the post-refresh fidelity, and the usable waiting time. If the measured survival-weighted lifetime does not exceed T_BBPSSW_W for the same resource count, the central claim fails in practice.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Quantum memories can keep entanglement usable for a storage time that is not fixed by the memory's bare coherence time; with sufficiently fast classical communication, the stored logical state can be topped up.
  • The protocol delivers two physical Bell pairs on demand, so it fits applications that need a pair of parallel entanglement links; refreshing a BBPSSW pair would sacrifice one link.
  • The maximum allowed classical communication time is a concrete design number: in the (0.9→0.95) scenario, T_cc thresholds around 0.010–0.012 (in units of coherence time) for k=1–3 decide whether re-distillation wins.
  • At initial fidelities above Fin≈0.6675, recursive EDC distillation gives larger per-round fidelity gain than BBPSSW, so the advantage compounds over multiple rounds.
  • Choosing more re-distillation rounds does not always make the latency constraint stricter: in the high-fidelity scenario, k=2 allows a slightly larger T_cc than k=1 because the slower decay gives a longer deadline.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the parity-check success probability p_pass is folded into the wait-and-repair cycle, the expected usable time becomes roughly p_pass^k times the claimed T_EDC_W; at low initial fidelity p_pass is far below 1, so the true lifetime gain may shrink rapidly with k. This is my inference, since the paper's Eq. (8) assumes successful rounds.
  • Because the paper assumes noiseless local operations, a natural next calculation is a gate-error threshold: the [[4,2,2]] circuit has more gates than BBPSSW, so a depolarizing gate-noise model would tell where the extra detection power is outweighed by extra operational noise.
  • The same wait-and-repair logic could be applied to other small error-detecting or error-correcting codes; the likely trade-off is between stronger detection (more rounds and more gates) and longer achievable storage, which this deadline/latency formulation could express.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes an entanglement distillation protocol based on the [[4,2,2]] error-detecting code, with four noisy Bell pairs converted into a logical entangled state that can be either decoded immediately into two high-fidelity physical pairs or stored and later re-distilled. Analytical formulas for output fidelity and yield are presented in Eqs. (4)-(5), and the protocol is benchmarked against BBPSSW under a matched 4-to-2 ratio, yielding a crossover at Fin≈0.6675 and a purification threshold at Fin≈0.6323. The central new contribution is a 'wait-and-repair' strategy for quantum memories: after storage-induced dephasing, the logical state is refreshed by k rounds of re-distillation, giving a usable waiting time T_EDC_W = t_k - k(T_op + 2T_cc) in Eq. (8) and a bound on the allowed classical communication time in Eq. (12). The paper claims this can extend the entanglement lifetime beyond the BBPSSW decay time, with thresholds listed in Table 3.

Significance. If the central claim is correct, the paper provides a useful quantitative framework for code-assisted entanglement distillation combined with memory management: it explicitly constructs the logical entangled state, derives concrete crossover and threshold values, and connects protocol viability to classical communication latency. The idea of treating distilled entanglement as a refreshable resource rather than a perishable one is timely and potentially useful for quantum repeater and quantum network design. However, the manuscript's most important quantitative claim—that re-distillation extends usable storage time—currently rests on an unstated deterministic-success assumption, and the derivations of the key formulas are relegated to a Supplementary Information file not included in the preprint. These issues prevent the results from being taken at face value in the present form. The paper does not ship machine-checked proofs, code, or experimental data; its contribution is analytical and would benefit from verifiable derivations.

major comments (3)
  1. [Fidelity decay and re-distillation feasibility (Eqs. (8)-(12), Table 3)] The core lifetime-extension claim assumes that each re-distillation round succeeds with certainty. The manuscript itself defines re-distillation as the parity-check procedure of the same EDC protocol, and Table 2 reports pass probabilities as low as p_pass=0.4669 for a single round in the (0.8→0.9) scenario. A failed parity check discards the stored logical state (Table 1). Therefore the usable waiting time is not t_k - k(T_op+2T_cc) with certainty; the survival probability is at most ∏ p_pass(i), and for k=3 with p_pass≈0.47 it is about 10%. The expected usable time should be something like P_success·(t_k - Tre(k)), or the threshold in Eq. (12) should be replaced by a success-probability-constrained comparison. As written, Eq. (12) and Table 3 give too generous T_cc thresholds because they assume deterministic success. The qualitative remark in the Discussion that the state can be 'prob
  2. [Supplementary Information (Eqs. (2), (4)-(5), dephasing models, t_k values)] The manuscript repeatedly defers central derivations to a Supplementary Information file that is not present in the posted preprint: the derivation of Eq. (2) for the logical state, the explicit forms of Eqs. (4)-(5), the analytical dephasing models behind Figure 5, and the computation of t_k and T_BBPSSW_W. These quantities are load-bearing: the crossover and threshold values in Figure 3 and the deadlines in Table 3 cannot be independently checked without them. The authors should include the derivations in the main text or supply the Supplementary Information as part of the submission.
  3. [Fidelity decay and re-distillation feasibility (assumption on logical fidelity)] The statement that the logical fidelity 'directly reflects' the fidelity of the decoded Bell pairs rests on the assumption that decoherence primarily causes leakage into states orthogonal to the target code space. This assumption is not justified or quantified in the main text, and no dephasing model is given. Since the entire comparison with BBPSSW depends on the temporal fidelity decay curves in Figure 5, this needs a precise definition and derivation, or at least a clear statement of the regime in which it holds.
minor comments (4)
  1. [Throughout] Several typos and formatting issues: 'Fig. 1)' should be 'Fig. 1'; 'withits' should be 'with its'; subscripts and superscripts such as T_BBPSSW_W and F_in are inconsistently typeset; the phrase 'exactly k rounds' in the definition of t_k should be reconciled with the probabilistic nature of the protocol.
  2. [Table 2] The p_pass values for BBPSSW are listed for the parallel 2→1 setting, but it is not stated whether these are per-round or joint success probabilities for both parallel operations. Clarify the definition to make the comparison with the EDC column unambiguous.
  3. [Results, iterative distillation] The paper correctly notes that the output of each round is not generally a Werner state and assumes twirling before the next round. This is acceptable, but it should be stated earlier in the derivations, since Eqs. (4)-(5) are used recursively.
  4. [Discussion] The limitation concerning ideal, noiseless quantum operations is acknowledged. It would strengthen the paper to add a short quantitative estimate of how much gate noise would shift the crossover and threshold values, rather than only a qualitative caveat.

Circularity Check

0 steps flagged

No significant circularity: the EDC distillation formulas are direct model calculations, the BBPSSW benchmark is an independent external standard, and the re-distillation timing bound is algebraic from stated definitions.

full rationale

The paper's central outputs — p_EDC_pass, F_EDC_out, and the re-distillation timing bound — are derived from the [[4,2,2]] stabilizer structure and the stated depolarizing/dephasing model, not from fitting to a target or from a self-citation chain. The BBPSSW comparison uses the textbook Bennett et al. formulas (Eqs. 13–14) as an external benchmark. Gate and measurement times are taken from the superconducting/ion-trap literature, and Eq. 12 is straightforward algebra from Eqs. 8–11. The only self-reference is to the authors' own Supplementary Information for derivations of Eq. (2) and the dephasing models; that is an omitted-proof/support issue, not a circular reduction, since the main text states the assumptions and the formulas are checkable. The skeptical concern about p_pass < 1 being omitted from T_EDC_W and Eq. 12 is a modeling/optimism limitation, not circularity: the paper nowhere defines the advantage in terms of the re-distillation success probability, so it is not a fitted input renamed as a prediction. No load-bearing step reduces by construction to its own input.

Axiom & Free-Parameter Ledger

2 free parameters · 5 axioms · 0 invented entities

The central claims rest on the [[4,2,2]] code properties (standard), the Werner/depolarizing noise model (standard), the ideal-gate assumption (stated), the dephasing leakage assumption (stated but unverified), and the deterministic-success assumption in the waiting-time analysis (implicit). The paper also relies on a missing Supplementary for several derivations. Gate times are hand-picked typical values rather than fitted.

free parameters (2)
  • Gate and measurement times T_s, T_d, T_m = T_s=2e-5, T_d=1e-4, T_m=1e-3 (normalized by coherence time)
    Chosen as representative values from superconducting and ion-trap processors; they set T_op and enter the latency thresholds in Table 3. They are not fitted to data, but the numerical bounds depend on them.
  • Dephasing decay model parameters = not given (in Supplementary)
    The fidelity evolution during storage follows an unspecified dephasing model whose parameters are not stated in the main text.
axioms (5)
  • domain assumption Local operations and measurements are ideal (noiseless)
    Explicitly stated in the Discussion as a major limitation; all derived fidelities assume perfect gates.
  • domain assumption Input states are Werner states with fidelity F_in after the depolarizing channel
    Standard assumption in BBPSSW and used for the EDC protocol formulas.
  • ad hoc to paper Re-distillation rounds succeed deterministically in the waiting-time model
    Eq. (8)-(12) treat k rounds as a fixed cost without modeling p_pass; this is an implicit and optimistic assumption.
  • ad hoc to paper Storage decoherence primarily causes leakage into states orthogonal to the target code space
    Stated in the 'Fidelity decay and re-distillation feasibility' section; used to equate logical fidelity to decoded Bell-pair fidelity.
  • standard math The matrix identity (U_A ⊗ I_B)|Φ+⟩ = (I_A ⊗ U_T_B)|Φ+⟩ holds for multi-qubit operators
    Used in the Methods to justify local stabilizer measurement on Bell states.

reviewed 2026-08-04 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation." pith.science (2026). https://pith.science/paper/EQC6CNPQ

@misc{pith2026250906446,
  author       = {Pith},
  title        = {Pith review of: Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EQC6CNPQ}},
  note         = {Machine review of arXiv:2509.06446}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4,2,2]] quantum error-detecting code, deriving analytical expressions for its output fidelity and yield, and benchmarking it against the BBPSSW protocol. In addition to initial distillation, we investigate a re-distillation strategy in which stored logical entangled states are refreshed using only local operations and classical communication, avoiding the need to regenerate and redistribute entanglement from scratch. Our analysis shows that this method can extend the effective storage lifetime beyond BBPSSW,with its performance advantage primarily determined by classical communication delay. We derive upper bounds on classical communication latency required for the approach to maintain superiority. This work introduces a framework for treating quantum memories as reusable resources and links distillation strategy to practical implementation constraints, offering quantitative guidance for designing resilient quantum networks.

Figures

Figures reproduced from arXiv: 2509.06446 by GunSik Min, Huidan Zheng, Ilkwon Sohn, Jun Heo.

Figure 1
Figure 1. Figure 1: Conceptual schematic of a probabilistic EDP. An initial set of n entangled pairs is distributed through a noisy quantum channel. Alice and Bob perform local operations and measurements, exchange outcomes via two-way classical communication, and post-select by retaining or discarding pairs based on the results. Pairs that pass the parity check are then decoded. The basic structure of this detection-based ap… view at source ↗
Figure 2
Figure 2. Figure 2: Quantum circuit for the EDP using the [[4,2,2]] code. Four entangled pairs are processed to prepare a logical entangled state, with local Hadamard, CNOT gates, and stabilizer measurements performed by Alice and Bob. Classical communication determines whether to retain or discard this logical entangled state, which can then be decoded into two high-fidelity Bell pairs. where p is the depolarizing probabilit… view at source ↗
Figure 3
Figure 3. Figure 3: Output fidelity Fout and yield Y of the [[4,2,2]] EDC-based EDP and BBPSSW protocol versus input fidelity Fin. Solid curves show output fidelities and dash-dotted lines indicate the corresponding yields under a 2:1 distillation ratio. The red star marks the threshold Fout = Fin at Fin ≈ 0.6323, and the red dot marks the crossover at Fin ≈ 0.6675 where the EDC-based EDP begins to outperform BBPSSW [PITH_FU… view at source ↗
Figure 4
Figure 4. Figure 4: illustrates the performance of the two protocols under iterative application across various initial fidelity regimes. Note that while both the EDC-based EDP and BBPSSW protocol operate under the Werner state assumption, the output after each distillation round is generally not a Werner state. In practice, a twirling operation would be applied before the next round to restore the Werner form. This step is n… view at source ↗
Figure 5
Figure 5. Figure 5: Fidelity evolution of stored entangled states under a dephasing noise model for three scenarios: (a) (Fin,Ftarget) = (0.8,0.9), (b) (0.85,0.9), and (c) (0.9,0.95). Blue curves show Bell pairs from BBPSSW, red curves show logical entangled states from the EDC-based EDP. The deadline tk is the time at which the fidelity decays to a level where exactly k rounds of re-distillation are required to restore it ab… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

19 extracted references · 14 canonical work pages

  1. [1]

    & Horodecki, K

    Horodecki, R., Horodecki, P., Horodecki, M. & Horodecki, K. Quantum entanglement.Rev. Mod. Phys.81, 865–942 (2009)

    2009

  2. [2]

    H.et al.Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels.Phys

    Bennett, C. H.et al.Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels.Phys. review letters70, 1895 (1993)

    work page 1993

  3. [3]

    Bennett, C. H. & Brassard, G. Quantum cryptography: Public key distribution and coin tossing.Theor. computer science 560, 7–11 (2014)

    work page 2014

  4. [4]

    Li, Z.et al.Entanglement-assisted quantum networks: Mechanics, enabling technologies, challenges, and research directions.IEEE Commun. Surv. & Tutorials25, 2133–2189 (2023). 5.Tanimura, S.et al.Quantum state transmission in noisy quantum channels.Phys. Rev. A89, 032313 (2014). 6.Zurek, W. H. Decoherence, einselection, and the quantum origins of the classi...

    work page 2023

  5. [7]

    H.et al.Purification of noisy entanglement and faithful teleportation via noisy channels.Phys

    Bennett, C. H.et al.Purification of noisy entanglement and faithful teleportation via noisy channels.Phys. Rev. Lett.76, 722–725 (1996). 8.Shor, P. W. Scheme for reducing decoherence in quantum computer memory.Phys. Rev. A52, R2493–R2496 (1995). 9.Steane, A. M. Error correcting codes in quantum theory.Phys. Rev. Lett.77, 793–797 (1996)

    work page 1996

  6. [10]

    H., DiVincenzo, D

    Bennett, C. H., DiVincenzo, D. P., Smolin, J. A. & Wootters, W. K. Mixed-state entanglement and quantum error correction. Phys. Rev. A54, 3824–3851 (1996). 11.Aschauer, H.Quantum communication in noisy environments. Ph.D. thesis, lmu (2005)

    work page 1996

  7. [12]

    qubit applications (qap)

    Simon, C.et al.Quantum memories: A review based on the european integrated project "qubit applications (qap)".The Eur. Phys. J. D58, 1–22 (2010)

    work page 2010

  8. [13]

    Deutsch, D.et al.Quantum privacy amplification and the security of quantum cryptography over noisy channels.Phys. Rev. Lett.77, 2818–2821 (1996)

    work page 1996

  9. [14]

    M., Krovi, H

    Wilde, M. M., Krovi, H. & Brun, T. A. Convolutional entanglement distillation. In2010 IEEE International Symposium on Information Theory, 2657–2661 (IEEE, 2010)

    work page 2010

  10. [15]

    & Briegel, H

    Dür, W. & Briegel, H. J. Entanglement purification and quantum error correction.Reports on Prog. Phys.70, 1381–1424, DOI: 10.1088/0034-4885/70/8/r03 (2007)

    doi:10.1088/0034-4885/70/8/r03 2007

  11. [16]

    & Guha, S

    Shi, Y ., Patil, A. & Guha, S. Stabilizer entanglement distillation and efficient fault-tolerant encoders.PRX Quantum6, 010339 (2025). 17.Cheng, S. & Rengaswamy, N. Adaptive error correction for entanglement distillation (2025). 2504.11670

    work page arXiv 2025

  12. [18]

    & Rengaswamy, N

    Patil, A., Pacenti, M., Vasi´c, B., Guha, S. & Rengaswamy, N. Entanglement routing using quantum error correction for distillation (2024). 2405.00849. 19.Gottesman, D.Stabilizer codes and quantum error correction. Ph.D. thesis, California Institute of Technology (1997)

    arXiv 2024

  13. [20]

    A., Ding, Y

    Liu, C., Wang, M., Stein, S. A., Ding, Y . & Li, A. Quantum memory: A missing piece in quantum computing units (2023). 2309.14432. 21.Grassl, M., Beth, T. & Pellizzari, T. Codes for the quantum erasure channel.Phys. Rev. A56, 33 (1997)

    Pith/arXiv arXiv 2023

  14. [22]

    J., Azuma, K., Tamaki, K

    Munro, W. J., Azuma, K., Tamaki, K. & Nemoto, K. Inside quantum repeaters.IEEE J. Sel. Top. Quantum Electron.21, 78–90, DOI: 10.1109/JSTQE.2015.2392076 (2015). 23.Muralidharan, S.et al.Optimal architectures for long distance quantum communication.Sci. reports6, 20463 (2016). 24.Wehner, S., Elkouss, D. & Hanson, R. Quantum internet: A vision for the road a...

    work page arXiv 2015

  15. [26]

    Technol.6, 025020 (2021)

    Jurcevic, P.et al.Demonstration of quantum volume 64 on a superconducting quantum computing system.Quantum Sci. Technol.6, 025020 (2021). 27.Wright, K.et al.Benchmarking an 11-qubit quantum computer.Nat. communications10, 5464 (2019). 28.Preskill, J. Quantum computing in the nisq era and beyond.Quantum2, 79 (2018). 29.Eisert, J.et al.Quantum certification...

    work page 2021

  16. [30]

    Dür, W., Briegel, H.-J., Cirac, J. I. & Zoller, P. Quantum repeaters based on entanglement purification.Phys. Rev. A59, 169 (1999)

    work page 1999

  17. [31]

    & Verstraete, F

    Dehaene, J., Van den Nest, M., De Moor, B. & Verstraete, F. Local permutations of products of bell states and entanglement distillation.Phys. Rev. A67, 022310, DOI: 10.1103/PhysRevA.67.022310 (2003)

    work page doi:10.1103/physreva.67.022310 2003

  18. [32]

    & Chuu, D

    Hsieh, J., Li, C.-M. & Chuu, D. A simplification of entanglement purification.Phys. Lett. A328, 94–101, DOI: 10.1016/j.physleta.2004.06.005 (2003)

    work page doi:10.1016/j.physleta.2004.06.005 2004

  19. [33]

    & Sheng, Y

    Zhou, L., Zhong, W. & Sheng, Y . Purification of the residual entanglement.Opt. express28 2, 2291–2301, DOI: 10.1364/oe.383499 (2020). 34.Maneva, E. N. & Smolin, J. A. Improved two-party and multi-party purification protocols (2000). quant-ph/0003099. 35.Dür, W. & Briegel, H.-J. Entanglement purification for quantum computation.Phys. review letters90, 067...

    Pith/arXiv arXiv 2020

This paper was first reviewed by deepseek-v4-flash on August 4, 2026.