Pith. sign in

REVIEW 3 major objections 5 minor 76 references

Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Logical Bell states in ion-trap memories fail to beat unencoded states at current error rates; roughly tenfold gate improvement is needed, and the non-local protocol reaches ~33 Hz over 1-80 km.

desk verdict Useful feasibility simulation with a robust negative result, but Protocol 2's rate and thresholds rest on an unvalidated local-surgery equivalence that likely makes them optimistic. read the letter →

arxiv 2412.01434 v3 pith:RDRCIOBP submitted 2024-12-02 quant-ph

Vladlen Galetsky , Nilesh Vyas , Alberto Comin , Janis Nötzel This is my paper · ORCID
classification quant-ph
keywords quantumrepeatersnetworkslatticesurgerylogicalBellstatesheraldedentanglementBacon-Shorcodessurfaceiontrapmemories
verification ladder T0 review T1 audit T2 compute T3 formal

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 asks whether wrapping a heralded Bell pair in a quantum error-correcting code helps a memory-assisted quantum network once real hardware noise is included. It proposes two lattice-surgery protocols — Protocol 1, where an intermediary node creates the logical Bell pair locally and transmits it, and Protocol 2, where the end nodes merge their stored codes remotely using auxiliary Bell pairs from the intermediary — and simulates both with ion-trap memories, lossy fibers, frequency conversion, and non-destructive photon detection. The central result is that at current gate and readout error rates, small ($d=3,5$) surface and Bacon-Shor logical Bell states do not beat an unencoded heralded Bell state: break-even at a node-to-intermediary distance of $1\,\mathrm{km}$ requires $p_{\mathrm{err}_H}\lesssim 10^{-5}$, $p_{\mathrm{err}_{CX}}\lesssim 10^{-4}$, and $p_{\mathrm{err}_M}\lesssim 10^{-4}$, roughly an order of magnitude better than the Table I hardware values. Under depolarizing noise the codes only help below pseudo-thresholds in the $10^{-3}$ range, and beyond separate thresholds increasing the code distance actually worsens the logical error rate. The more practical non-local protocol still sustains up to $(32.53\pm1.53)\,\mathrm{Hz}$ over $1$–$80\,\mathrm{km}$, so the paper frames logical Bell states as a near-term hardware target rather than a current win.

What carries the argument

Lattice surgery on memory-resident code patches, with the pseudo-threshold as the measuring stick. Two $[\![n,k,d]\!]$ patches are merged for $d$ QEC cycles and then split to create $|\phi^+\rangle_L = (|00\rangle_L + |11\rangle_L)/\sqrt{2}$; Protocol 1 performs this at Charlie before shipping data qubits, while Protocol 2 performs it across Alice and Bob by feeding $d$ auxiliary Bell pairs per cycle into the growing boundary. The pseudo-threshold — the error rate at which the logical and unencoded Bell states give equal logical error — carries the argument, and the per-QEC-cycle time budget ($t_{\mathrm{cycle}}$, $t_{\mathrm{merge}}$, $t_{\mathrm{travel}}$) converts those break-even errors into achievable rates in hertz.

What would settle it

Build a two-node ion-trap testbed implementing Protocol 2's remote merge at $D=1\,\mathrm{km}$ with the Table I parameters and measure the logical Bell-state error per QEC cycle: if it falls below the unencoded baseline, the paper's order-of-magnitude gate-error requirement is wrong, and if it exceeds the depolarizing-model prediction, the remote-merge equivalence assumption is wrong and the stated thresholds and $32.5\,\mathrm{Hz}$ rate are too optimistic.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is a quantified feasibility verdict: quantum error correction in ion-trap memories does not yet pay for itself in heralded entanglement generation. Encoding a Bell pair in S$[\![18,2,3]\!]$, rotated S$[\![18,2,3]\!]$, or BS$[\![18,2,3]\!]$ only lowers the logical error below the unencoded baseline when the physical error rate stays under $(5.5\pm0.2)\times10^{-4}$, $(9.0\pm0.3)\times10^{-4}$, or $(1.5\pm0.2)\times10^{-3}$, respectively, under depolarizing noise; with the physical noise model at $D=1\,\mathrm{km}$, the requirement sharpens to $p_{\mathrm{err}_H}\lesssim 10^{-5}$, $p_{\mathrm{err}_{CX}}\lesssim 10^{-4}$, and $p_{\mathrm{err}_M}\lesssim 10^{-4}$. These break-even numbers are the core deliverable because they convert the abstract promise of QEC into specific hardware specifications. The paper also reports that the non-local protocol reaches success rates up to $(32.53\pm1.53)\,\mathrm{Hz}$ over $1$–$80\,\mathrm{km}$, while the local protocol is set aside because a single lost photon aborts the whole attempt.

Load-bearing premise

The remote merging in Protocol 2 is assumed to behave exactly like local lattice surgery under the same noise model, with no extra errors, no extra decoherence during retries, and no synchronization failures between the two nodes.

Editorial extensions

If this is right

  • At the simulated current hardware parameters, neither Protocol 1 nor Protocol 2 gives a lower logical error rate than an unencoded heralded Bell state at $D=1\,\mathrm{km}$.
  • Ion-trap Hadamard, CNOT, and measurement error rates all need to improve by roughly one order of magnitude before these logical Bell-state protocols become worth using.
  • Moving from $d=3$ to $d=5$ codes only helps below physical error thresholds near $(3.9\pm0.1)\times10^{-3}$ for Bacon-Shor and $(5.8\pm0.2)\times10^{-3}$ for rotated surface codes; above these, larger codes degrade performance.
  • Protocol 2's per-merging-cycle retry design keeps it running at up to about $32.5\,\mathrm{Hz}$ over $1$–$80\,\mathrm{km}$, whereas Protocol 1's abort-on-loss makes it impractical.
  • Bacon-Shor codes carry a higher per-cycle time cost ($t_{\mathrm{cycle}}=4t_M+8t_{CX}+8t_H$) and a lower gate-error-ratio threshold ($\xi=0.41\pm0.01$ versus $1.68\pm0.01$ for rotated surface codes), making surface codes the more favorable small-distance choice.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The most leveragable hardware knob is QNDM capture and state-transfer efficiency: the $400\,\mu\mathrm{s}$ acceptance window accepts only $5.28\pm3.78$ auxiliary Bell pairs per merging cycle at $1\,\mathrm{km}$, so improving multi-photon QNDM or state transfer would raise the $32.5\,\mathrm{Hz}$ ceiling directly.
  • If gate errors reach the stated thresholds, Protocol 2's retry-per-cycle design means entanglement purification before encoding — which the paper counts as an available resource — could push logical Bell fidelity even higher without changing the code.
  • A fairer near-term comparison than the unencoded Bell-state baseline might be a distillation-only heralded protocol; the break-even numbers would shift, and the required hardware improvements could be less severe than a full order of magnitude.
  • The single-photon QNDM constraint suggests that multiplexed QNDM or a multi-mode source would change the rate-distance trade-off substantially, a testable extension of the paper's scheduler logic.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper studies two protocols for generating logical Bell states between distant nodes with an intermediary, using lattice surgery on small surface and Bacon-Shor codes stored in ion-trap quantum memories. Protocol 1 generates the logical Bell pair locally at Charlie and then distributes the data qubits; Protocol 2 distributes auxiliary Bell pairs and attempts a non-local, entanglement-mediated merge across Alice's and Bob's memories. The authors simulate both protocols with Stim and minimum-weight perfect matching under two noise models: a depolarizing model and a physical model with fiber loss, QNDM, frequency conversion, state transfer, gate errors, and decoherence. They report pseudo-thresholds, code-family thresholds, a requirement of roughly perrH <= 1e-5, perrCX <= 1e-4, perrM <= 1e-4 for a 1 km node-to-Charlie distance, and a peak Protocol 2 rate of (32.53 ± 1.53) Hz over 1 to 80 km.

Significance. If the results hold, this is one of the first concrete feasibility studies of logical Bell-state generation in memory-assisted quantum networks, and it provides falsifiable hardware requirements for ion-trap nodes. The paper has clear strengths: it uses a standard QEC simulation pipeline (Stim plus sparse blossom), imports experimental parameters from cited ion-trap and cavity-QED work, compares several small codes, and makes the simulation code publicly available. The qualitative conclusion that current ion-trap gate errors are too high for d=3 logical Bell states, and that an order-of-magnitude-class improvement is needed, is plausible and useful for experimental roadmapping. However, the headline positive rate for Protocol 2 rests on an unvalidated equivalence between local and remote lattice surgery, and the rate computation is not described in enough detail to be reproduced; these issues materially affect the paper's central claims.

major comments (3)
  1. [Section V-B, Protocol 2 steps 4-5; Fig. 3; Section VII-B.3] The non-local protocol is the source of the paper's main positive result, the (32.53 ± 1.53) Hz rate, but the manuscript does not specify how the remote merge is implemented at the circuit level. Protocol 2 step 4 says Alice and Bob 'merge the two codes via entanglement using lattice surgery,' yet a distributed merge requires either teleportation-based CNOTs or entanglement-assisted parity measurements between boundary qubits at Alice and Bob, each adding two-qubit gates, Bell measurements, and classical communication latency. The scheduler in Section VII-B.3 models loss and retry of auxiliary Bell-pairs, but it does not model the effect of a partially completed merge on the logical state, nor the extra idling and T1/T2 decoherence during retries. If the Stim simulation treats the auxiliary Bell-pairs as direct local data-qubit connections, the reported Protocol 2 thresholds and rate are not supported; the authors should either provide and simulate a concrete remote-surgery circuit or explicitly present the rate as an upper bound that ignores distributed-CNOT overhead.
  2. [Abstract and Section VIII] The central quantitative conclusion is stated as requiring an order-of-magnitude reduction in gate error rates, with thresholds perrH <= 1e-5, perrCX <= 1e-4, and perrM <= 1e-4. Compared with the Table I baseline values perrH = 2.1e-4, perrCX = 8.3e-3, and perrM = 7.7e-3, the required reductions are factors of roughly 20, 80, and 80 respectively. Calling this 'an order of magnitude' understates the requirement, and the abstract's shorthand (0.1 perrH, 0.1 perrCX, 0.1 perrM) is inconsistent with the parenthetical thresholds. Please reword the abstract and conclusions to state the actual required factors.
  3. [Section VII-B.3 and Fig. 10] The rate computation is under-specified. The text gives an acceptance window trangeQ = 400 µs and reports average numbers of successful Bell-pairs per merging cycle (5.28 ± 3.78 at 1 km, 2.26 ± 2.41 at 10 km), but it does not provide the formula or event-level model that converts these statistics into the headline rate of 32.53 Hz. Given the stated source frequency fsource = 33 MHz and the efficiencies in Table I, the reported average of 5.28 successful Bell-pairs per cycle is not obviously reproducible, and the role of the serial QNDM constraint ('only a single photon is accepted') is not quantitatively developed. Because the rate is a headline result, the authors should provide a clear rate equation, specify how the d merging cycles and retries enter, and show how the quoted number follows from the stated parameters.
minor comments (5)
  1. [Section VI-B.1 and Table I] The choice eta_trs = 0.5 and eta_conv = 0.9 is labelled optimistic, but the text should state explicitly that these are above current experimental demonstrations (0.426 for photon-to-ion transfer and 0.35 for conversion) and explain the sensitivity of the main conclusions to these values.
  2. [Section VII-A.1] The sentence 'These results apply to both protocols' under the depolarizing model is not fully justified because Protocol 2 involves auxiliary Bell-pair generation and remote merging, which are not present in Protocol 1; please clarify whether the depolarizing simulation for Protocol 2 includes any additional operations or whether it simply uses the same local circuit.
  3. [Equation (6) and Section VI-B.1] The total transmission probability eta_tot in Eq. (6) is written as a product of independent efficiencies, but dark counts are then introduced separately as pdark = 0.03; the text should clarify how dark counts enter the simulation and whether they are treated as false-positive heralding events.
  4. [Section IV-C] The exclusion of BB and hybrid S|BS codes is motivated by non-separability, but the definition of code separability in Definition 1 requires that both subcodes retain the same distance d; for lattice surgery this condition is stronger than what is needed for the comparison, and the text should justify why a distance-preserving split is the relevant criterion.
  5. [Appendix XI-B] The time-budget equations tcycle = 4tM + 8tCX + 8tH for BS and tcycle = 2tH + 4tCX + tM for surface codes should be connected to Table II so that a reader can verify the tcycle entries from the gate times in Table I.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: all claimed thresholds and rates are simulation outputs compared against an external unencoded Bell-state baseline, with parameters imported from cited experimental data.

full rationale

The paper's central results are Monte Carlo simulation outputs under explicitly stated depolarizing and physical noise models. The pseudo-thresholds are defined by comparing simulated logical error rates with the unencoded Bell-state error rate, which is an external comparator rather than a quantity fitted to the target conclusion. The physical gate, loss, conversion, memory, and QNDM parameter values are taken from cited experimental work or explicitly labeled optimistic assumptions; none of these parameters is chosen to reproduce the reported thresholds or the 32.53 Hz rate. The comparison of d=3 versus d=5 codes to locate code-family thresholds is again a direct simulation comparison, not a fitted prediction. The paper does cite two works involving one of the authors (QuReed [24] and QuNetSim [25]), but these appear only as related-work tool references and are not load-bearing for any derived claim. The remote lattice surgery modeling concern for Protocol 2 is a substantive modeling assumption about whether distributed merging is equivalent to local surgery under the same noise model, but it is an assumption about omitted physical errors, not a circular reduction of the result to its inputs. No step in the paper defines a quantity in terms of the quantity it is used to predict, nor renames a fitted parameter as a prediction. Accordingly, the circularity score is 0.

Assumptions & free parameters 5 free parameters · 5 assumptions · 0 invented entities

The central thresholds depend on a small set of imported experimental parameters and two unvalidated modeling assumptions: that remote lattice surgery behaves like local surgery, and that several photonic efficiencies are near-optimistic theoretical values. No new physical entities are introduced.

free parameters (5)
  • QNDM detection efficiency P(0a|1iq) = 0.95 (assumed; experimental range cited as 0.45 to 0.74)
    Section VI-B.1 and Appendix XI-C. This efficiency gates whether photons are heraldable before storage; assuming 0.95 is an optimistic input that increases Protocol 2 success rates.
  • Photon-to-ion state transfer efficiency eta_trs = 0.5
    Section VI-B.3. Adopted as optimistic relative to demonstrated 0.426; loss here reduces the number of Bell pairs available for merging.
  • Frequency conversion efficiency eta_conv = 0.9
    Section VI-B.2. Projected from equal waveguide losses; demonstrated values cited are 0.265 to 0.35, so this is an optimistic input.
  • Gate error rates perrH, perrCX, perrM = 2.1e-4, 8.3e-3, 7.7e-3
    Table I. Taken from IonQ Forte calibration; these set the baseline against which the required improvements are measured.
  • Decoherence times T1, T2 = 3 s, 0.5 s
    Table I. Assumed memory coherence times on the order of seconds; the threshold comparison over storage time depends on them.
assumptions (5)
  • standard math Stabilizer measurements and MWPM decoding correctly identify and correct errors for surface and Bacon-Shor codes under the simulated noise models.
    Used throughout Section VII; relies on Stim and sparse blossom.
  • domain assumption Remote entanglement-assisted lattice surgery in Protocol 2 is equivalent to local lattice surgery under the same error model.
    Protocol 2 step 4 and Fig. 3; no experimental validation is cited for distributed merge operations.
  • ad hoc to paper Code separability is a necessary condition for a code to be usable in the protocols, excluding BB and hybrid S|BS codes.
    Section IV-C; this restricts the set of codes studied and shapes the comparison.
  • domain assumption Idle qubits undergo depolarizing noise during gate operations, extending the model of ref. [28].
    Section VI-A; this choice lowers pseudo-thresholds relative to [28].
  • domain assumption Fidelity loss from non-destructive photonic detection is negligible.
    Section VI-B.1; this assumption underlies all heralding steps.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks." pith.science (2026). https://pith.science/paper/RDRCIOBP

@misc{pith2026241201434,
  author       = {Pith},
  title        = {Pith review of: Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RDRCIOBP}},
  note         = {Machine review of arXiv:2412.01434}
}
abstract

This study explores the feasibility of utilizing quantum error correction (QEC) to generate and store logical Bell states in heralded quantum entanglement protocols, crucial for quantum repeater networks. Two lattice surgery-based protocols (local and non-local) are introduced to establish logical Bell states between distant nodes using an intermediary node. We simulate the protocols using realistic experimental parameters, including ion trap memories, noisy optical channels, frequency conversion, and non-destructive detection of photonic qubits. The study evaluates rotated and planar surface codes alongside Bacon-Shor codes for small code distances ($d = 3, 5$) under depolarizing and physical noise models. Pseudo-thresholds are identified, with physical error rates above $p_{\text{err}} \sim 10^{-3}$ offering no advantage over unencoded Bell states under depolarizing noise. Pseudo-thresholds are also reevaluated in terms of gate error rates $p_{\text{err}_H}$, $p_{\text{err}_{CX}}$, and $p_{\text{err}_M}$. For a distance of 1 km between the end node and the intermediary, an advantage over unencoded Bell-state heralded protocols requires reducing gate error rates by an order of magnitude ($0.1p_{\text{err}_H}$, $0.1p_{\text{err}_{CX}}$, and $0.1p_{\text{err}_M}$). These results highlight the need for significant hardware improvements to implement logical Bell state protocols with quantum memories. Additionally, the non-local protocol rate was analyzed, achieving rates up to $(32.53 \pm 1.53) \, \mathrm{Hz}$ over distances of $1$ to $80 \, \mathrm{km}$ between the end node and the intermediary node.

Figures

Figures reproduced from arXiv: 2412.01434 by the authors.

Figure 1
Figure 1. Example of d = 3 rotated surface code, with respective Z and X syndrome measurements. The set of X-stabilizers is associated with red plaquettes, while Z-stabilizers correspond to blue plaquettes. Since neighbor￾ing plaquettes always share two vertices, the stabilizers commute for any arrangement of plaquettes. The order of operations is presented with arrows between the X/Z syndrome qubits and data qubits. IV. PREL… view at source ↗
Figure 3
Figure 3. Proposed protocols for QEC on a quantum memory for heralded entanglement protocol. Protocol 1 (left) and Protocol 2 (right) represent the local/non [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Simulation overflow for both Protocol 1 and Protocol 2. The various noise levels, as detailed in SectionVI-B, are represented using color gradients [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figures from the paper (5 more)
Figure 6
Figure 6. Figure 6: The analysis involves 10 iterations of quantum error correction [PITH_FULL_IMAGE:figures/full_fig_p008_6.png]
Figure 7
Figure 7. Figure 7: The scheduler monitors the number of auxiliary Bell-pairs that are ready for the next QEC iteration. Due to the limited capture efficiency of QNDM, [PITH_FULL_IMAGE:figures/full_fig_p009_7.png]
Figure 8
Figure 8. Figure 8: The time dependency for Surface and Bacon-Shor codes with a code distance of [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: We examine a single iteration of quantum error correction (QEC) [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 10
Figure 10. Figure 10: Protocol rate in terms of operational distance between Charlie and [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

76 extracted references · 32 canonical work pages

  1. [28]

    Direct measurement of bacon-shor code stabilizers,

    M. Li, D. Miller, and K. R. Brown, “Direct measurement of bacon-shor code stabilizers,” Phys. Rev. A, vol. 98, p. 050301, Nov 2018. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.98.050301

    doi:10.1103/physreva.98.050301 2018

  2. [1]

    Quantum internet: A vision for the road ahead,

    S. Wehner, D. Elkouss, and R. Hanson, “Quantum internet: A vision for the road ahead,” Science, vol. 362, no. 6412, p. eaam9288, 2018. [Online]. Available: https://www.science.org/doi/abs/10.1126/science. aam9288

    doi:10.1126/science 2018

  3. [2]

    Quantum internet protocol stack: A comprehensive survey,

    J. Illiano, M. Caleffi, A. Manzalini, and A. S. Cacciapuoti, “Quantum internet protocol stack: A comprehensive survey,” Computer Networks, vol. 213, p. 109092, 2022. [Online]. Available: https: //www.sciencedirect.com/science/article/pii/S1389128622002250

    work page 2022

  4. [3]

    Optimal architectures for long distance quantum communication,

    S. Muralidharan, L. Li, J. Kim, N. Lütkenhaus, M. D. Lukin, and L. Jiang, “Optimal architectures for long distance quantum communication,” Scientific Reports , vol. 6, 2015. [Online]. Available: https://api.semanticscholar.org/CorpusID:14597684

    work page 2015

  5. [4]

    Quantum repeaters: From quantum networks to the quantum internet,

    K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, “Quantum repeaters: From quantum networks to the quantum internet,” Rev. Mod. Phys. , vol. 95, p. 045006, Dec

    work page

  6. [5]

    Quantum repeaters and computation by a single module: Remote nondestructive parity measurement,

    K. Azuma, H. Takeda, M. Koashi, and N. Imoto, “Quantum repeaters and computation by a single module: Remote nondestructive parity measurement,” Physical Review A , vol. 85, no. 6, Jun. 2012. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.85.062309

    work page doi:10.1103/physreva.85.062309 2012

  7. [6]

    Heralded entanglement distribution between two absorptive quantum memories,

    X. Liu, J. Hu, Z.-F. Li, X. Li, P.-Y . Li, P.-J. Liang, Z.-Q. Zhou, C.-F. Li, and G.-C. Guo, “Heralded entanglement distribution between two absorptive quantum memories,” Nature, vol. 594, no. 7861, pp. 41–45, Jun. 2021

    work page 2021

  8. [7]

    Telecom-heralded entanglement between multimode solid-state quantum memories,

    D. Lago-Rivera, S. Grandi, J. V . Rakonjac, A. Seri, and H. de Riedmat- ten, “Telecom-heralded entanglement between multimode solid-state quantum memories,” Nature, vol. 594, no. 7861, p. 37–40, Jun. 2021. [Online]. Available: http://dx.doi.org/10.1038/s41586-021-03481-8

    doi:10.1038/s41586-021-03481-8 2021

Show all 76 references
  1. [8]

    Realization of a multinode quantum network of remote solid-state qubits,

    M. Pompili, S. L. N. Hermans, S. Baier, H. K. C. Beukers, P. C. Humphreys, R. N. Schouten, R. F. L. Vermeulen, M. J. Tiggelman, L. dos Santos Martins, B. Dirkse, S. Wehner, and R. Hanson, “Realization of a multinode quantum network of remote solid-state qubits,” Science, vol. ...

    2021 doi

  2. [9]

    Entanglement of trapped-ion qubits separated by 230 meters,

    V . Krutyanskiy, M. Galli, V . Krcmarsky, S. Baier, D. Fioretto, Y . Pu, A. Mazloom, P. Sekatski, M. Canteri, M. Teller, J. Schupp, J. Bate, M. Meraner, N. Sangouard, B. Lanyon, and T. Northup, “Entanglement of trapped-ion qubits separated by 230 meters,” Physical Review Lette...

    2023 doi

  3. [10]

    Long-lived quantum memory enabling atom-photon entanglement over 101 km of telecom fiber,

    Y . Zhou, P. Malik, F. Fertig, M. Bock, T. Bauer, T. van Leent, W. Zhang, C. Becher, and H. Weinfurter, “Long-lived quantum memory enabling atom-photon entanglement over 101 km of telecom fiber,” PRX Quantum , vol. 5, p. 020307, Apr 2024. [Online]. Available: https://link.aps....

    2024 doi

  4. [11]

    Quantum repeater node demonstrating unconditionally secure key distribution,

    S. Langenfeld, P. Thomas, O. Morin, and G. Rempe, “Quantum repeater node demonstrating unconditionally secure key distribution,” Phys. Rev. Lett. , vol. 126, p. 230506, Jun 2021. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.126.230506

    2021 doi

  5. [12]

    A multinode quantum network over a metropolitan area,

    J.-L. Liu, X.-Y . Luo, Y . Yu, C.-Y . Wang, B. Wang, Y . Hu, J. Li, M.-Y . Zheng, B. Yao, Z. Yan, D. Teng, J.-W. Jiang, X.-B. Liu, X.-P. Xie, J. Zhang, Q.-H. Mao, X. Jiang, Q. Zhang, X.-H. Bao, and J.-W. Pan, “A multinode quantum network over a metropolitan area,” 2023. [Onlin...

    2023 arXiv

  6. [13]

    Demonstration of quantum network protocols over a 14-km urban fiber link,

    S. Kucera, C. Haen, E. Arenskötter, T. Bauer, J. Meiers, M. Schäfer, R. Boland, M. Yahyapour, M. Lessing, R. Holzwarth, C. Becher, and J. Eschner, “Demonstration of quantum network protocols over a 14-km urban fiber link,” 2024. [Online]. Available: https: //arxiv.org/abs/2404.04958

    2024 arXiv

  7. [14]

    Entangling logical qubits with lattice surgery,

    A. Erhard, H. Poulsen Nautrup, M. Meth, L. Postler, R. Stricker, M. Stadler, V . Negnevitsky, M. Ringbauer, P. Schindler, H. J. Briegel, R. Blatt, N. Friis, and T. Monz, “Entangling logical qubits with lattice surgery,” Nature, vol. 589, no. 7841, pp. 220–224, Jan 2021. [Onlin...

    2021 doi

  8. [15]

    Quantum teleportation of physical qubits into logical code spaces,

    Y .-H. Luo, M.-C. Chen, M. Erhard, H.-S. Zhong, D. Wu, H.-Y . Tang, Q. Zhao, X.-L. Wang, K. Fujii, L. Li, N.-L. Liu, K. Nemoto, W. J. Munro, C.-Y . Lu, A. Zeilinger, and J.-W. Pan, “Quantum teleportation of physical qubits into logical code spaces,” Proceedings of the National...

    2021 doi

  9. [16]

    Creating entangled logical qubits in the heavy-hex lattice with topological codes,

    B. Hetényi and J. R. Wootton, “Creating entangled logical qubits in the heavy-hex lattice with topological codes,” PRX Quantum , vol. 5, p. 040334, Dec 2024. [Online]. Available: https://link.aps.org/doi/10. 1103/PRXQuantum.5.040334

    2024

  10. [17]

    Surface code quantum communication,

    A. G. Fowler, D. S. Wang, C. D. Hill, T. D. Ladd, R. Van Meter, and L. C. L. Hollenberg, “Surface code quantum communication,” Phys. Rev. Lett. , vol. 104, p. 180503, May 2010. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.104.180503

    2010 doi

  11. [18]

    Surfacenet: Fault-tolerant quantum networks with surface codes,

    T. Hu, J. Wu, and Q. Li, “Surfacenet: Fault-tolerant quantum networks with surface codes,” 2023. [Online]. Available: https: //arxiv.org/abs/2310.13628

    2023 arXiv

  12. [19]

    Stim: a fast stabilizer circuit simulator,

    C. Gidney, “Stim: a fast stabilizer circuit simulator,” Quantum, vol. 5, p. 497, Jul. 2021. [Online]. Available: https://doi.org/10.22331/ q-2021-07-06-497

    2021

  13. [20]

    A high performance compiler for very large scale surface code computations,

    G. Watkins, H. M. Nguyen, K. Watkins, S. Pearce, H.-K. Lau, and A. Paler, “A high performance compiler for very large scale surface code computations,” Quantum, vol. 8, p. 1354, May 2024. [Online]. Available: http://dx.doi.org/10.22331/q-2024-05-22-1354

    2024 doi

  14. [21]

    Synthesis of arbitrary quantum circuits to topological assembly,

    A. Paler, S. J. Devitt, and A. G. Fowler, “Synthesis of arbitrary quantum circuits to topological assembly,” Scientific Reports , vol. 6, no. 1, p. 30600, Aug 2016. [Online]. Available: https://doi.org/10.1038/srep30600

    2016 doi

  15. [23]

    Sequence: a customizable discrete-event simulator of quantum networks,

    X. Wu, A. Kolar, J. Chung, D. Jin, T. Zhong, R. Kettimuthu, and M. Suchara, “Sequence: a customizable discrete-event simulator of quantum networks,” Quantum Science and Technology , vol. 6, no. 4, p. 045027, Sep. 2021. [Online]. Available: http://dx.doi.org/10.1088/ 2058-9565/ac22f6

    2021

  16. [24]

    Sekav ˇcnik, K

    S. Sekav ˇcnik, K. H. El-Safty, and J. Nötzel, “Qureed,” 2024. [Online]. Available: https://arxiv.org/abs/2406.07638

    2024 arXiv

  17. [25]

    Qunetsim: A software framework for quantum networks,

    S. Diadamo, J. Notzel, B. Zanger, and M. M. Bese, “Qunetsim: A software framework for quantum networks,” IEEE Transactions on Quantum Engineering , vol. 2, p. 1–12, 2021. [Online]. Available: http://dx.doi.org/10.1109/TQE.2021.3092395

    2021

  18. [26]

    A distributed simulation framework for quantum networks and channels,

    B. Bartlett, “A distributed simulation framework for quantum networks and channels,” 2018. [Online]. Available: https://arxiv.org/abs/1808. 07047

    2018

  19. [27]

    Simulaqron—a simulator for developing quantum internet software,

    A. Dahlberg and S. Wehner, “Simulaqron—a simulator for developing quantum internet software,” Quantum Science and Technology , vol. 4, no. 1, p. 015001, Sep. 2018. [Online]. Available: http: //dx.doi.org/10.1088/2058-9565/aad56e

    2018 doi

  20. [29]

    Surface code quantum computing by lattice surgery,

    D. Horsman, A. G. Fowler, S. Devitt, and R. V . Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics, vol. 14, no. 12, p. 123011, Dec. 2012. [Online]. Available: http://dx.doi.org/10.1088/1367-2630/14/12/123011

    2012 doi

  21. [30]

    CSS code surgery as a universal construction,

    A. Cowtan and S. Burton, “CSS code surgery as a universal construction,” Quantum, vol. 8, p. 1344, May 2024. [Online]. Available: https://doi.org/10.22331/q-2024-05-14-1344

    2024 doi

  22. [31]

    A flow- map model for analyzing pseudothresholds in fault-tolerant quantum computing,

    K. M. Svore, A. W. Cross, I. L. Chuang, and A. V . Aho, “A flow- map model for analyzing pseudothresholds in fault-tolerant quantum computing,” 2006. [Online]. Available: https://arxiv.org/abs/quant-ph/ 0508176

    2006

  23. [32]

    Constant- overhead fault-tolerant quantum computation with reconfigurable atom arrays,

    Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasi ´c, M. D. Lukin, L. Jiang, and H. Zhou, “Constant- overhead fault-tolerant quantum computation with reconfigurable atom arrays,” Nature Physics , vol. 20, no. 7, pp. 1084–1090, Jul 202...

    2024 doi

  24. [33]

    Low-overhead fault-tolerant quantum computing using long-range connectivity,

    L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, “Low-overhead fault-tolerant quantum computing using long-range connectivity,” Science Advances , vol. 8, no. 20, May 2022. [Online]. Available: http://dx.doi.org/10.1126/sciadv.abn1717

    2022 doi

  25. [34]

    Balanced product quantum codes,

    N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Transactions on Information Theory , vol. 67, no. 10, p. 6653–6674, Oct. 2021. [Online]. Available: http://dx.doi.org/10.1109/ TIT.2021.3097347

    2021

  26. [35]

    High-threshold and low-overhead fault-tolerant quantum memory,

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, “High-threshold and low-overhead fault-tolerant quantum memory,” Nature, vol. 627, no. 8005, pp. 778–782, Mar 2024. [Online]. Available: https://doi.org/10.1038/s41586-024-07107-7

    2024 doi

  27. [36]

    A game of surface codes: Large-scale quantum computing with lattice surgery,

    D. Litinski, “A game of surface codes: Large-scale quantum computing with lattice surgery,” Quantum, vol. 3, p. 128, Mar. 2019. [Online]. Available: http://dx.doi.org/10.22331/q-2019-03-05-128

    2019 doi

  28. [37]

    Efficient synthesis of universal repeat-until-success quantum circuits,

    A. Bocharov, M. Roetteler, and K. M. Svore, “Efficient synthesis of universal repeat-until-success quantum circuits,” Phys. Rev. Lett. , vol. 114, p. 080502, Feb 2015. [Online]. Available: https://link.aps.org/doi/ 10.1103/PhysRevLett.114.080502

    2015 doi

  29. [38]

    A sat scalpel for lattice surgery: Representation and synthesis of subroutines for surface-code fault-tolerant quantum computing,

    D. B. Tan, M. Y . Niu, and C. Gidney, “A sat scalpel for lattice surgery: Representation and synthesis of subroutines for surface-code fault-tolerant quantum computing,” in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA). IEEE, Jun. 2024, p. 3...

    2024

  30. [39]

    The ZX calculus is a language for surface code lattice surgery,

    N. de Beaudrap and D. Horsman, “The ZX calculus is a language for surface code lattice surgery,” Quantum, vol. 4, p. 218, Jan. 2020. [Online]. Available: https://doi.org/10.22331/q-2020-01-09-218

    2020 doi

  31. [40]

    Less bacon more threshold,

    C. Gidney and D. Bacon, “Less bacon more threshold,” 2023. [Online]. Available: https://arxiv.org/abs/2305.12046

    2023 arXiv

  32. [41]

    Inside quantum repeaters,

    W. J. Munro, K. Azuma, K. Tamaki, and K. Nemoto, “Inside quantum repeaters,” IEEE Journal of Selected Topics in Quantum Electronics , vol. 21, no. 3, pp. 78–90, 2015

    2015

  33. [42]

    Heralded entanglement distribution between two absorptive quantum memories,

    X. Liu, J. Hu, Z.-F. Li, X. Li, P.-Y . Li, P.-J. Liang, Z.-Q. Zhou, C.-F. Li, and G.-C. Guo, “Heralded entanglement distribution between two absorptive quantum memories,” Nature, vol. 594, no. 7861, pp. 41–45, Jun 2021. [Online]. Available: https://doi.org/10.1038/ s41586-021-03505-3

    2021

  34. [43]

    Netsquid, a network simulator for quantum information using discrete events,

    T. Coopmans, R. Knegjens, A. Dahlberg, D. Maier, L. Nijsten, J. de Oliveira Filho, M. Papendrecht, J. Rabbie, F. Rozp˛ edek, M. Skrzypczyk, L. Wubben, W. de Jong, D. Podareanu, A. Torres- Knoop, D. Elkouss, and S. Wehner, “Netsquid, a network simulator for quantum information ...

    2021 doi

  35. [44]

    Nondestructive detection of photonic qubits,

    D. Niemietz, P. Farrera, S. Langenfeld, and G. Rempe, “Nondestructive detection of photonic qubits,” Nature, vol. 591, no. 7851, p. 570–574, Mar. 2021. [Online]. Available: http://dx.doi.org/10.1038/ s41586-021-03290-z

    2021

  36. [45]

    Nondestructive detection of an optical photon,

    A. Reiserer, S. Ritter, and G. Rempe, “Nondestructive detection of an optical photon,” Science, vol. 342, no. 6164, p. 1349–1351, Dec. 2013. [Online]. Available: http://dx.doi.org/10.1126/science.1246164

    2013 doi

  37. [46]

    Kuhn, Cavity Induced Interfacing of Atoms and Light

    A. Kuhn, Cavity Induced Interfacing of Atoms and Light . Cham: Springer International Publishing, 2015, pp. 3–38. [Online]. Available: https://doi.org/10.1007/978-3-319-19231-4_1

    2015 doi

  38. [47]

    Qutip: An open-source python framework for the dynamics of open quantum systems,

    J. Johansson, P. Nation, and F. Nori, “Qutip: An open-source python framework for the dynamics of open quantum systems,” Computer Physics Communications , vol. 183, no. 8, p. 1760–1772, Aug. 2012. [Online]. Available: http://dx.doi.org/10.1016/j.cpc.2012.02.021

    2012 doi

  39. [48]

    A photon–photon quantum gate based on a single atom in an optical resonator,

    B. Hacker, S. Welte, G. Rempe, and S. Ritter, “A photon–photon quantum gate based on a single atom in an optical resonator,” Nature, vol. 536, no. 7615, pp. 193–196, Aug 2016. [Online]. Available: https://doi.org/10.1038/nature18592

    2016 doi

  40. [49]

    Quantum frequency down-conversion of single photons in nonlinear optical waveguides,

    S. Zaske, “Quantum frequency down-conversion of single photons in nonlinear optical waveguides,” 2013

    2013

  41. [50]

    Periodically poled lithium niobate waveguide sum-frequency generator for efficient single-photon detection at communication wavelengths,

    R. V . Roussev, C. Langrock, J. R. Kurz, and M. M. Fejer, “Periodically poled lithium niobate waveguide sum-frequency generator for efficient single-photon detection at communication wavelengths,” Opt. Lett. , vol. 29, no. 13, pp. 1518–1520, Jul 2004. [Online]. Available: http...

    2004

  42. [51]

    High-fidelity entanglement between a trapped ion and a telecom photon via quantum frequency conversion,

    M. Bock, P. Eich, S. Kucera, M. Kreis, A. Lenhard, C. Becher, and J. Eschner, “High-fidelity entanglement between a trapped ion and a telecom photon via quantum frequency conversion,” Nature Communications, vol. 9, no. 1, May 2018. [Online]. Available: http://dx.doi.org/10.103...

    2018 doi

  43. [52]

    Low noise quantum frequency conversion of photons from a trapped barium ion to the telecom o-band,

    U. Saha, J. D. Siverns, J. Hannegan, Q. Quraishi, and E. Waks, “Low noise quantum frequency conversion of photons from a trapped barium ion to the telecom o-band,” 2023. [Online]. Available: https://arxiv.org/abs/2305.01205

    2023 arXiv

  44. [53]

    Polarisation-preserving photon frequency conversion from a trapped- ion-compatible wavelength to the telecom c-band,

    V . Krutyanskiy, M. Meraner, J. Schupp, and B. P. Lanyon, “Polarisation-preserving photon frequency conversion from a trapped- ion-compatible wavelength to the telecom c-band,” Applied Physics B, vol. 123, no. 9, p. 228, Aug 2017. [Online]. Available: https://doi.org/10.1007/s...

    2017 doi

  45. [54]

    Robust quantum memory in a trapped-ion quantum network node,

    P. Drmota, D. Main, D. P. Nadlinger, B. C. Nichol, M. A. Weber, E. M. Ainley, A. Agrawal, R. Srinivas, G. Araneda, C. J. Ballance, and D. M. Lucas, “Robust quantum memory in a trapped-ion quantum network node,” Phys. Rev. Lett. , vol. 130, p. 090803, Mar 2023. [Online]. Availa...

    2023 doi

  46. [55]

    Telecom-wavelength quantum repeater node based on a trapped-ion processor,

    V . Krutyanskiy, M. Canteri, M. Meraner, J. Bate, V . Krcmarsky, J. Schupp, N. Sangouard, and B. P. Lanyon, “Telecom-wavelength quantum repeater node based on a trapped-ion processor,” Phys. Rev. Lett. , vol. 130, p. 213601, May 2023. [Online]. Available: https://link.aps.org/...

    2023 doi

  47. [56]

    Multimode ion-photon entanglement over 101 kilometers,

    V . Krutyanskiy, M. Canteri, M. Meraner, V . Krcmarsky, and B. Lanyon, “Multimode ion-photon entanglement over 101 kilometers,” PRX Quantum , vol. 5, p. 020308, Apr 2024. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.5.020308

    2024 doi

  48. [57]

    Interface between trapped-ion qubits and traveling photons with close-to-optimal efficiency,

    J. Schupp, V . Krcmarsky, V . Krutyanskiy, M. Meraner, T. Northup, and B. Lanyon, “Interface between trapped-ion qubits and traveling photons with close-to-optimal efficiency,” PRX Quantum , vol. 2, p. 020331, Jun 2021. [Online]. Available: https://link.aps.org/doi/10.1103/ PR...

    2021

  49. [58]

    Sparse blossom: correcting a million errors per core second with minimum-weight matching,

    O. Higgott and C. Gidney, “Sparse blossom: correcting a million errors per core second with minimum-weight matching,” 2023. [Online]. Available: https://arxiv.org/abs/2303.15933

    2023 arXiv

  50. [59]

    Surface code compilation via edge-disjoint paths,

    M. Beverland, V . Kliuchnikov, and E. Schoute, “Surface code compilation via edge-disjoint paths,” PRX Quantum , vol. 3, no. 2, May 2022. [Online]. Available: http://dx.doi.org/10.1103/PRXQuantum. 3.020342

    2022 doi

  51. [60]

    Architecture for fast implementation of qldpc codes with optimized rydberg gates,

    C. Poole, T. M. Graham, M. A. Perlin, M. Otten, and M. Saffman, “Architecture for fast implementation of qldpc codes with optimized rydberg gates,” 2024. [Online]. Available: https://arxiv.org/abs/2404. 18809

    2024

  52. [61]

    Decoding algorithms for surface codes,

    A. deMarti iOlius, P. Fuentes, R. Orús, P. M. Crespo, and J. Etxezarreta Martinez, “Decoding algorithms for surface codes,” Quantum, vol. 8, p. 1498, Oct. 2024. [Online]. Available: https: //doi.org/10.22331/q-2024-10-10-1498

    2024 doi

  53. [62]

    Suppressing quantum errors by scaling a surface code logical qubit,

    R. Acharya, I. Aleiner, R. Allen, T. I. Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, J. Atalaya, R. Babbush, D. Bacon, J. C. Bardin, J. Basso, A. Bengtsson, S. Boixo, G. Bortoli, A. Bourassa, J. Bovaird, L. Brill, M. Broughton, B. B. Buckley, D. A. Buell, T. Burger, B. B...

    2023

  54. [63]

    Subsystem fault tolerance with the bacon- shor code,

    P. Aliferis and A. W. Cross, “Subsystem fault tolerance with the bacon- shor code,” Phys. Rev. Lett. , vol. 98, p. 220502, May 2007. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.98.220502

    2007 doi

  55. [64]

    Fault-tolerant operation of a quantum error-correction code,

    L. Egan, D. M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K. R. Brown, M. Cetina, and C. Monroe, “Fault-tolerant operation of a quantum error-correction code,” 2021. [Online]. Available: https://arxiv.org/abs/2009.11482

    2021 arXiv

  56. [65]

    Transversality and lattice surgery: Exploring realistic routes toward coupled logical qubits with trapped-ion quantum processors,

    M. Gutiérrez, M. Müller, and A. Bermúdez, “Transversality and lattice surgery: Exploring realistic routes toward coupled logical qubits with trapped-ion quantum processors,” Phys. Rev. A, vol. 99, p. 022330, Feb

  57. [66]

    Topological fault- tolerance in cluster state quantum computation,

    R. Raussendorf, J. Harrington, and K. Goyal, “Topological fault- tolerance in cluster state quantum computation,” New Journal of Physics, vol. 9, no. 6, p. 199–199, Jun. 2007. [Online]. Available: http://dx.doi.org/10.1088/1367-2630/9/6/199

    2007 doi

  58. [67]

    Surface codes: Towards practical large-scale quantum computation,

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, no. 3, Sep. 2012. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.86.032324

    2012 doi

  59. [68]

    Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,

    D. Gottesman and I. L. Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature, vol. 402, no. 6760, pp. 390–393, Nov 1999. [Online]. Available: https://doi.org/10.1038/46503

    1999 doi

  60. [69]

    Universal quantum computation with ideal clifford gates and noisy ancillas,

    S. Bravyi and A. Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,” Phys. Rev. A, vol. 71, p. 022316, Feb

  61. [73]

    1), where d is the code distance which corresponds to the maximum length of error chains that can be reliably detected and corrected by the decoding algorithm

    Surface codes: Surface codes encode d2 data qubits into a single logical qubit, requiring d2 − 1 syndrome qubits to measure X and Z syndromes per error correction cycle (Fig. 1), where d is the code distance which corresponds to the maximum length of error chains that can be r...

    2023

  62. [74]

    Each horizontal and vertical connection between qubits corresponds to X ⊗ X and Z ⊗ Z measurements, respectively

    Bacon-Shor codes: Bacon-Shor codes [63] work simi- larly as surface codes, however they are built on a L×L planar lattice where 2(L − 1) weight-2L stabilizers are inferred from measurements of (L − 1)2 weight-2 gauge operators built as two-qubit parity measurements as seen in ...

  63. [75]

    |r⟩: reflection back into the cavity from the resonator, 2) r0 : reflection back into the fiber cladding due to imperfect fiber-cavity mode matching,

  64. [76]

    |t⟩: resonator transmission losses,

  65. [77]

    |m⟩: absorption and scattering losses in the fiber-cavity mirrors,

  66. [78]

    |a⟩: atomic losses. The coherent state amplitudes for these modes are described as follows: r0a,1a = 1 − µ2 F C 2κr N g2 i∆a+γ + i∆c + κ ! α, (11) r0 0a,1a = q 1 − µ2 F CµF C 2κr N g2 i∆a+γ + i∆c + κ α, (12) t0a,1a = µF C 2√κrκt N g2 i∆a+γ + i∆c + κ α, (13) m0a,1a = µF C 2√κrκ...

  67. [2005]

    Available: https://link.aps.org/doi/10.1103/PhysRevA

    [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA. 71.022316 XI. A PPENDIX A. Indepth view of QEC codes

    doi

  68. [2023]

    Available: https://link.aps.org/doi/10.1103/RevModPhys

    [Online]. Available: https://link.aps.org/doi/10.1103/RevModPhys. 95.045006

    doi

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.