pith. sign in

arxiv: 2306.03748 · v3 · submitted 2023-06-06 · 🪐 quant-ph · cs.NI

Architecture and protocols for all-photonic quantum repeaters

Naphan Benchasattabuse , Michal Hajdu\v{s}ek , Rodney Van Meter This is my paper

Pith reviewed 2026-05-24 07:40 UTC · model grok-4.3

classification 🪐 quant-ph cs.NI
keywords all-photonic quantum repeatersrepeater graph statesquantum communication protocolslogical qubit decodingPauli frame correctionemitter-photonic qubitsquantum internet architecture
0
0 comments X

The pith

A new emitter-photonic building block for all-photonic quantum repeaters reduces the number of emissive memories required at end nodes.

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

The paper introduces a new building block made from an emitter and photonic qubits along with a repeater graph state protocol. This design allows end nodes to take part in establishing connections, decodes logical qubits in the graph state, and calculates Pauli frame corrections needed for correct Bell pairs. It cuts down on the emissive quantum memories used at the ends and lets all-photonic and memory-based repeaters work together under one protocol. An algorithm uses graph manipulation rules to decode the logical measurement outcomes. The approach targets tasks like distributed computation and teleportation over the quantum internet.

Core claim

The authors present a new emitter-photonic qubit building block and RGS protocol that incorporates end node involvement in connection establishment, performs decoding of logical qubits within the RGS, and computes the Pauli frame corrections at each node. This building block significantly reduces the total number of emissive quantum memories required for end nodes and seamlessly integrates all-photonic and memory-based repeaters under the same communication protocol. They also give an algorithm for decoding logical measurement results based on graphical reasoning with graph state manipulation rules.

What carries the argument

The emitter-photonic qubit building block that combines an emitter with photonic qubits to support the RGS protocol for logical operations and corrections.

If this is right

  • End nodes can participate directly in repeater connections with reduced memory resources.
  • Logical qubits encoded in the repeater graph state can be decoded using the provided algorithm.
  • Pauli frame corrections ensure the final Bell pair is in the desired state.
  • All-photonic and memory-based repeaters can operate under a unified protocol.
  • The scheme supports distributed quantum computation and teleportation in addition to key distribution.

Where Pith is reading between the lines

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

  • This architecture could enable hybrid networks that mix photonic and memory-based components without protocol changes.
  • The decoding method based on graph rules might apply to other quantum communication protocols using graph states.
  • Lower memory counts at ends could make large-scale quantum networks more practical to build.
  • Testing the protocol with real hardware would need to verify the absence of new error sources.

Load-bearing premise

The emitter-photonic building block and RGS protocol can be implemented without adding new operational errors or photon losses beyond what prior work already considered.

What would settle it

Demonstration of the building block in an experiment showing no excess errors during RGS creation and connection, or failure of the decoding algorithm to produce correct Bell pairs at scale.

Figures

Figures reproduced from arXiv: 2306.03748 by Michal Hajdu\v{s}ek, Naphan Benchasattabuse, Rodney Van Meter.

Figure 1
Figure 1. Figure 1: Two graph state representations of the same quantum state are depicted at the top. Here, vertices represent qubits in the quantum circuit, and [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An overview of the RGS scheme. The three steps shown here have corresponding actions to the memory-based repeater scheme, where inner encoded [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An example of half-RGS and the transformation of two half-RGSs into [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Architectures supporting the RGS scheme where the photonic states generated at end nodes are different. (a) The architecture proposed in [ [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Segments constituting RGSS (repeater graph state source, in light blue) and ABSA (advanced Bell state analyzer, omitted) nodes are treated as virtual [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: (a) Emission of a photon with side effect labelled. (b) The push-out operation, photon emission followed by a Hadamard gate. This operation does [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: The tracking of side effect propagation at each step, the resolution of physical and logical measurement results, and the rationale behind the Pauli [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
read the original abstract

The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offering a fast Bell pair generation rate limited only by the RGS creation time (rather than enforced round-trip waits). While existing research has predominantly focused on RGS generation and secret key sharing rate analysis, there is a need to extend investigations to encompass broader applications, such as distributed computation and teleportation, the main tasks envisioned for the Quantum Internet. Here we propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations: end node involvement in connection establishment, decoding of logical qubits within the RGS, and computing the Pauli frame corrections at each participating node to ensure the desired correct end-to-end Bell pair state. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes and seamlessly integrates all-photonic and memory-based repeaters under the same communication protocol. We also present an algorithm for decoding logical measurement results, employing graphical reasoning based on graph state manipulation rules.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a new emitter-photonic qubit building block together with an associated repeater graph state (RGS) protocol for all-photonic quantum repeaters. The work addresses end-node participation in Bell-pair generation, logical-qubit decoding inside the RGS, and computation of Pauli-frame corrections. It claims that the building block reduces the total number of emissive quantum memories required at end nodes and permits a single communication protocol to encompass both all-photonic and memory-based repeaters. An algorithm that performs logical decoding via graph-state manipulation rules is also presented.

Significance. If the resource-reduction and integration claims are substantiated, the architecture would lower the hardware overhead at network endpoints and supply a unified protocol layer, both of which are practically relevant for scaling quantum networks toward distributed computation and teleportation tasks. The graphical decoding procedure offers a concrete implementation route that could be checked against existing RGS error models.

major comments (2)
  1. [Proposed building block and RGS protocol] The central claim that the new emitter-photonic building block reduces the number of emissive memories at end nodes while preserving the loss and error resilience of prior RGS analyses is load-bearing, yet the manuscript supplies no explicit re-derivation or bounding of additional error channels introduced by end-node involvement and logical decoding (see the sections describing the building block and the RGS protocol).
  2. [Integration and decoding algorithm] The assertion of seamless integration between all-photonic and memory-based repeaters under one protocol rests on the assumption that the new decoding algorithm and Pauli-correction procedure introduce no extra classical overhead or failure modes; no quantitative comparison or simulation supporting this assumption is provided.
minor comments (2)
  1. [Decoding algorithm] Notation for the logical-qubit encoding and the graph-manipulation rules should be defined more explicitly before the decoding algorithm is introduced, to allow readers to follow the graphical reasoning without ambiguity.
  2. [Abstract] The abstract states that the scheme is limited only by RGS creation time; a brief reminder of the relevant prior RGS timing analysis would help anchor this statement.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. We address each major comment below and will revise the manuscript accordingly to strengthen the supporting analysis.

read point-by-point responses

  1. Referee: [Proposed building block and RGS protocol] The central claim that the new emitter-photonic building block reduces the number of emissive memories at end nodes while preserving the loss and error resilience of prior RGS analyses is load-bearing, yet the manuscript supplies no explicit re-derivation or bounding of additional error channels introduced by end-node involvement and logical decoding (see the sections describing the building block and the RGS protocol).

    Authors: We agree that an explicit re-derivation is needed to fully substantiate preservation of resilience. The building block reuses the same RGS structure and local operations as prior analyses, shifting only the timing of certain measurements to end nodes without adding new loss channels. In the revised manuscript we will add a subsection that re-derives the error bounds, explicitly accounting for end-node involvement and the logical decoding step, and shows that the additional channels remain bounded by the same parameters used in existing RGS literature. revision: yes

  2. Referee: [Integration and decoding algorithm] The assertion of seamless integration between all-photonic and memory-based repeaters under one protocol rests on the assumption that the new decoding algorithm and Pauli-correction procedure introduce no extra classical overhead or failure modes; no quantitative comparison or simulation supporting this assumption is provided.

    Authors: The decoding algorithm is based on standard graph-state manipulation rules that apply uniformly, and the Pauli-frame corrections are computed locally at each node using the same classical messages already required for RGS protocols. We acknowledge that a direct quantitative comparison is absent. In the revision we will add a section with analytical overhead estimates and Monte-Carlo simulations under standard depolarizing and loss models, comparing the unified protocol against separate all-photonic and memory-based implementations to confirm that classical communication volume and logical failure rates remain comparable. revision: yes

Circularity Check

0 steps flagged

Architectural proposal contains no circular derivations or self-referential fittings.

full rationale

The manuscript is a design proposal for a new emitter-photonic building block and RGS protocol. Central claims (reduced end-node emissive memories, seamless integration of repeater types, and a graphical decoding algorithm) follow directly from the described architecture and graph-state manipulation rules. No equations, fitted parameters, or predictions are present that reduce by construction to inputs; no load-bearing self-citations or uniqueness theorems imported from prior author work are invoked to force the result. The derivation chain is therefore self-contained as an engineering proposal.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities; ledger left empty pending full text.

pith-pipeline@v0.9.0 · 5727 in / 1007 out tokens · 22900 ms · 2026-05-24T07:40:18.321628+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages · 2 internal anchors

  1. [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, Oct. 2018, doi:10.1126/science.aam9288

    work page doi:10.1126/science.aam9288 2018

  2. [2]

    Architectural Principles for a Quantum Internet,

    W. Kozlowski et al., “Architectural Principles for a Quantum Internet,” RFC 9340, Mar. 2023, doi:10.17487/RFC9340

    work page doi:10.17487/rfc9340 2023

  3. [3]

    Quantum Communications,

    M. Hajdušek and R. Van Meter, “Quantum Communications,” Nov. 2023, doi:10.48550/arXiv.2311.02367

    work page doi:10.48550/arxiv.2311.02367 2023

  4. [4]

    Quantum repeaters: From quantum networks to the quantum internet,

    K. Azuma et al. , “Quantum repeaters: From quantum networks to the quantum internet,” Reviews of Modern Physics, vol. 95, no. 4, p. 045006, Dec. 2023, doi:10.1103/RevModPhys.95.045006

    work page doi:10.1103/revmodphys.95.045006 2023

  5. [5]

    Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication,

    H.-J. Briegel, W. Dür, J. I. Cirac, and P. Zoller, “Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication,” Physical Review Letters , vol. 81, no. 26, pp. 5932–5935, Dec. 1998, doi:10.1103/PhysRevLett.81.5932

    work page doi:10.1103/physrevlett.81.5932 1998

  6. [6]

    Long-distance quan- tum communication with atomic ensembles and linear optics,

    L.-M. Duan, M. D. Lukin, J. I. Cirac, and P. Zoller, “Long-distance quan- tum communication with atomic ensembles and linear optics,” Nature, vol. 414, no. 6862, pp. 413–418, Nov. 2001, doi:10.1038/35106500

    work page doi:10.1038/35106500 2001

  7. [7]

    Quan- tum repeaters based on atomic ensembles and linear optics,

    N. Sangouard, C. Simon, H. De Riedmatten, and N. Gisin, “Quan- tum repeaters based on atomic ensembles and linear optics,” Re- views of Modern Physics , vol. 83, no. 1, pp. 33–80, Mar. 2011, doi:10.1103/RevModPhys.83.33

    work page doi:10.1103/revmodphys.83.33 2011

  8. [8]

    All-photonic quantum re- peaters,

    K. Azuma, K. Tamaki, and H.-K. Lo, “All-photonic quantum re- peaters,” Nature Communications , vol. 6, no. 1, p. 6787, Apr. 2015, doi:10.1038/ncomms7787

    work page doi:10.1038/ncomms7787 2015

  9. [9]

    One-Way Quantum Repeater Based on Near-Deterministic Photon-Emitter Interfaces,

    J. Borregaard, H. Pichler, T. Schröder, M. D. Lukin, P. Lodahl, and A. S. Sørensen, “One-Way Quantum Repeater Based on Near-Deterministic Photon-Emitter Interfaces,” Physical Review X, vol. 10, no. 2, p. 021071, Jun. 2020, doi:10.1103/PhysRevX.10.021071

    work page doi:10.1103/physrevx.10.021071 2020

  10. [10]

    All-photonic Gottesman-Kitaev-Preskill–qubit repeater us- ing analog-information-assisted multiplexed entanglement ranking,

    F. Rozp˛ edek, K. P. Seshadreesan, P. Polakos, L. Jiang, and S. Guha, “All-photonic Gottesman-Kitaev-Preskill–qubit repeater us- ing analog-information-assisted multiplexed entanglement ranking,” Physical Review Research , vol. 5, no. 4, p. 043056, Oct. 2023, doi:10.1103/PhysRevResearch.5.043056

    work page doi:10.1103/physrevresearch.5.043056 2023

  11. [11]

    All-photonic one-way quantum repeaters with measurement-based error correc- tion,

    D. Niu, Y . Zhang, A. Shabani, and H. Shapourian, “All-photonic one-way quantum repeaters with measurement-based error correc- tion,” npj Quantum Information , vol. 9, no. 1, pp. 1–9, Oct. 2023, doi:10.1038/s41534-023-00775-9

    work page doi:10.1038/s41534-023-00775-9 2023

  12. [12]

    Rate-distance tradeoff and resource costs for all-optical quantum repeaters,

    M. Pant, H. Krovi, D. Englund, and S. Guha, “Rate-distance tradeoff and resource costs for all-optical quantum repeaters,” Physical Review A, vol. 95, no. 1, p. 012304, Jan. 2017, doi:10.1103/PhysRevA.95.012304

    work page doi:10.1103/physreva.95.012304 2017

  13. [13]

    Deterministic Gen- eration of All-Photonic Quantum Repeaters from Solid-State Emit- ters,

    D. Buterakos, E. Barnes, and S. E. Economou, “Deterministic Gen- eration of All-Photonic Quantum Repeaters from Solid-State Emit- ters,” Physical Review X , vol. 7, no. 4, p. 041023, Oct. 2017, doi:10.1103/PhysRevX.7.041023

    work page doi:10.1103/physrevx.7.041023 2017

  14. [14]

    Deterministic Generation of Loss-Tolerant Photonic Cluster States with a Single Quantum Emitter,

    Y . Zhan and S. Sun, “Deterministic Generation of Loss-Tolerant Photonic Cluster States with a Single Quantum Emitter,” Phys- ical Review Letters , vol. 125, no. 22, p. 223601, Nov. 2020, doi:10.1103/PhysRevLett.125.223601

    work page doi:10.1103/physrevlett.125.223601 2020

  15. [15]

    Modular architectures to deterministically generate graph states,

    H. Shapourian and A. Shabani, “Modular architectures to deterministically generate graph states,” Quantum, vol. 7, p. 935, Mar 2023, doi:10.22331/q-2023-03-02-935

    work page doi:10.22331/q-2023-03-02-935 2023

  16. [16]

    Generation of arbitrary all- photonic graph states from quantum emitters,

    A. Russo, E. Barnes, and S. E. Economou, “Generation of arbitrary all- photonic graph states from quantum emitters,” New Journal of Physics , vol. 21, no. 5, p. 055002, May 2019, doi:10.1088/1367-2630/ab193d

    work page doi:10.1088/1367-2630/ab193d 2019

  17. [17]

    Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits,

    P. Hilaire, E. Barnes, and S. E. Economou, “Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits,” Quantum, vol. 5, p. 397, Feb. 2021, doi:10.22331/q-2021-02-15-397

    work page doi:10.22331/q-2021-02-15-397 2021

  18. [18]

    Photonic resource state generation from a minimal number of quantum emitters,

    B. Li, S. E. Economou, and E. Barnes, “Photonic resource state generation from a minimal number of quantum emitters,” npj Quantum Information, vol. 8, no. 1, pp. 1–7, Feb. 2022, doi:10.1038/s41534-022- 00522-6

    work page doi:10.1038/s41534-022- 2022

  19. [19]

    Resource-efficient and loss-aware photonic graph state preparation using an array of quantum emit- ters, and application to all-photonic quantum repeaters,

    E. Kaur, A. Patil, and S. Guha, “Resource-efficient and loss-aware photonic graph state preparation using an array of quantum emit- ters, and application to all-photonic quantum repeaters,” Feb. 2024, doi:10.48550/arXiv.2402.00731

    work page doi:10.48550/arxiv.2402.00731 2024

  20. [20]

    Optimization of deterministic photonic graph state generation via local operations,

    S. Ghanbari, J. Lin, B. MacLellan, L. Robichaud, P. Roztocki, and H.-K. Lo, “Optimization of deterministic photonic graph state generation via local operations,” Dec. 2023, doi:10.48550/arXiv.2401.00635

    work page doi:10.48550/arxiv.2401.00635 2023

  21. [21]

    Experimental time-reversed adaptive Bell measure- ment towards all-photonic quantum repeaters,

    Y . Hasegawa et al., “Experimental time-reversed adaptive Bell measure- ment towards all-photonic quantum repeaters,” Nature Communications, vol. 10, no. 1, p. 378, Jan. 2019, doi:10.1038/s41467-018-08099-5

    work page doi:10.1038/s41467-018-08099-5 2019

  22. [22]

    Experimental quantum repeater without quantum memory,

    Z.-D. Li et al. , “Experimental quantum repeater without quantum memory,” Nature Photonics , vol. 13, no. 9, pp. 644–648, Sep. 2019, doi:10.1038/s41566-019-0468-5

    work page doi:10.1038/s41566-019-0468-5 2019

  23. [23]

    Photonic fusion of entangled resource states from a quantum emitter,

    Y . Meng et al. , “Photonic fusion of entangled resource states from a quantum emitter,” Dec. 2023, doi:10.48550/arXiv.2312.09070

    work page doi:10.48550/arxiv.2312.09070 2023

  24. [24]

    Engineering challenges in all-photonic quantum repeaters,

    N. Benchasattabuse, M. Hajdušek, and R. Van Meter, “Engineering challenges in all-photonic quantum repeaters,” IEEE Network , pp. 1– 1, 2024, doi:10.1109/MNET.2024.3411802

    work page doi:10.1109/mnet.2024.3411802 2024

  25. [25]

    Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels,

    C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels,” Phys. Rev. Lett. , vol. 70, pp. 1895–1899, Mar 1993, doi:10.1103/PhysRevLett.70.1895

    work page doi:10.1103/physrevlett.70.1895 1993

  26. [26]

    Stim: A fast stabilizer circuit simulator,

    C. Gidney, “Stim: A fast stabilizer circuit simulator,” Quantum, vol. 5, p. 497, Jul. 2021, doi:10.22331/q-2021-07-06-497

    work page doi:10.22331/q-2021-07-06-497 2021

  27. [27]

    Multiparty entanglement in graph states,

    M. Hein, J. Eisert, and H. J. Briegel, “Multiparty entanglement in graph states,” Physical Review A , vol. 69, no. 6, p. 062311, Jun. 2004, doi:10.1103/PhysRevA.69.062311

    work page doi:10.1103/physreva.69.062311 2004

  28. [28]

    Entanglement in Graph States and its Applications

    M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. V . den Nest, and H.-J. Briegel, “Entanglement in Graph States and its Applications,” arXiv:quant-ph/0602096, Feb. 2006, doi:10.48550/arXiv.quant-ph/0602096

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.quant-ph/0602096 2006

  29. [29]

    Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing,

    A. Patil and S. Guha, “Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing,” Dec. 2023, doi:10.48550/arXiv.2312.02377

    work page doi:10.48550/arxiv.2312.02377 2023

  30. [30]

    Persistent Entanglement in Arrays of Interacting Particles,

    H. J. Briegel and R. Raussendorf, “Persistent Entanglement in Arrays of Interacting Particles,” Physical Review Letters , vol. 86, no. 5, pp. 910–913, Jan. 2001, doi:10.1103/PhysRevLett.86.910. 10

    work page doi:10.1103/physrevlett.86.910 2001

  31. [31]

    Stabilizer codes and quantum error correction,

    D. E. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, Jul 2004, doi:10.7907/RZR7-DT72

    work page doi:10.7907/rzr7-dt72 2004

  32. [32]

    Graphical description of the action of local clifford transformations on graph states,

    M. Van den Nest, J. Dehaene, and B. De Moor, “Graphical description of the action of local clifford transformations on graph states,” Phys. Rev. A, vol. 69, p. 022316, Feb 2004, doi:10.1103/PhysRevA.69.022316

    work page doi:10.1103/physreva.69.022316 2004

  33. [33]

    Graphs, quadratic forms, and quantum codes,

    M. Grassl, A. Klappenecker, and M. Rotteler, “Graphs, quadratic forms, and quantum codes,” in Proceedings IEEE International Symposium on Information Theory,, 2002, p. 45, doi:10.1109/ISIT.2002.1023317

    work page doi:10.1109/isit.2002.1023317 2002

  34. [34]

    Stabilizer codes can be realized as graph codes

    D. Schlingemann, “Stabilizer codes can be realized as graph codes,” Quantum Info. Comput. , vol. 2, no. 4, p. 307–323, jun 2002, doi:10.48550/arXiv.quant-ph/0111080

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.quant-ph/0111080 2002

  35. [35]

    Loss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction,

    M. Varnava, D. E. Browne, and T. Rudolph, “Loss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction,” Physical Review Letters , vol. 97, no. 12, p. 120501, Sep. 2006, doi:10.1103/PhysRevLett.97.120501

    work page doi:10.1103/physrevlett.97.120501 2006

  36. [36]

    Quisp: a quantum internet simulation package,

    R. Van Meter et al., “A Quantum Internet Architecture,” in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). Broomfield, CO, USA: IEEE, Sep. 2022, pp. 341–352, doi:10.1109/QCE53715.2022.00055

    work page doi:10.1109/qce53715.2022.00055 2022

  37. [37]

    Photonic graph state generation from quantum dots and color centers for quantum commu- nications,

    A. Russo, E. Barnes, and S. E. Economou, “Photonic graph state generation from quantum dots and color centers for quantum commu- nications,” Physical Review B , vol. 98, no. 8, p. 085303, Aug. 2018, doi:10.1103/PhysRevB.98.085303

    work page doi:10.1103/physrevb.98.085303 2018

  38. [38]

    Local equivalence of complete bipartite and repeater graph states,

    I. Tzitrin, “Local equivalence of complete bipartite and repeater graph states,” Physical Review A , vol. 98, no. 3, p. 032305, Sep. 2018, doi:10.1103/PhysRevA.98.032305

    work page doi:10.1103/physreva.98.032305 2018

  39. [39]

    Per- formance analysis of quantum repeaters enabled by deterministically generated photonic graph states,

    Y . Zhan, P. Hilaire, E. Barnes, S. E. Economou, and S. Sun, “Per- formance analysis of quantum repeaters enabled by deterministically generated photonic graph states,” Quantum, vol. 7, p. 924, Feb. 2023, doi:10.22331/q-2023-02-16-924

    work page doi:10.22331/q-2023-02-16-924 2023

  40. [40]

    Design and analysis of communication protocols for quantum repeater networks,

    C. Jones, D. Kim, M. T. Rakher, P. G. Kwiat, and T. D. Ladd, “Design and analysis of communication protocols for quantum repeater networks,”New Journal of Physics, vol. 18, no. 8, p. 083015, Aug. 2016, doi:10.1088/1367-2630/18/8/083015

    work page doi:10.1088/1367-2630/18/8/083015 2016

  41. [41]

    High- speed quantum networking by ship,

    S. J. Devitt, A. D. Greentree, A. M. Stephens, and R. Van Meter, “High- speed quantum networking by ship,” Scientific Reports, vol. 6, no. 1, p. 36163, Nov. 2016, doi:10.1038/srep36163

    work page doi:10.1038/srep36163 2016

  42. [42]

    Quisp: a quantum internet simulation package,

    R. Satoh et al. , “Quisp: a quantum internet simulation package,” in 2022 IEEE International Conference on Quantum Computing and Engi- neering (QCE). Broomfield, CO, USA: IEEE, Sep 2022, p. 353–364, doi:10.1109/QCE53715.2022.00056

    work page doi:10.1109/qce53715.2022.00056 2022

  43. [43]

    QuIP: A P4 Quantum Internet Protocol Prototyping Framework,

    W. Kozlowski, F. Kuipers, R. Smets, and B. Turkovic, “QuIP: A P4 Quantum Internet Protocol Prototyping Framework,” IEEE Journal on Selected Areas in Communications , pp. 1–1, 2024, doi:10.1109/JSAC.2024.3380096

    work page doi:10.1109/jsac.2024.3380096 2024

  44. [44]

    Scalable Timing Coordination of Bell State Analyzers in Quantum Networks,

    Y . Mori et al. , “Scalable Timing Coordination of Bell State Analyzers in Quantum Networks,” May 2024, doi:10.48550/arXiv.2405.09881

    work page doi:10.48550/arxiv.2405.09881 2024

  45. [45]

    Optically Generated 2-Dimensional Photonic Cluster State from Coupled Quantum Dots,

    S. E. Economou, N. Lindner, and T. Rudolph, “Optically Generated 2-Dimensional Photonic Cluster State from Coupled Quantum Dots,” Physical Review Letters , vol. 105, no. 9, p. 093601, Aug. 2010, doi:10.1103/PhysRevLett.105.093601

    work page doi:10.1103/physrevlett.105.093601 2010

  46. [46]

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

    X. Wu et al. , “Sequence: a customizable discrete-event simulator of quantum networks,” Quantum Science and Technology , vol. 6, no. 4, p. 045027, 2021, doi:10.1088/2058-9565/ac22f6

    work page doi:10.1088/2058-9565/ac22f6 2021

  47. [47]

    Coopmans et al., NetSquid, a NETwork simulator for QUantum information using discrete events, Communi- cations Physics4, 10.1038/s42005-021-00647-8 (2021)

    T. Coopmans et al. , “Netsquid, a network simulator for quantum information using discrete events,” Communications Physics , vol. 4, no. 1, p. 164, 2021, doi:10.1038/s42005-021-00647-8. 11

    work page doi:10.1038/s42005-021-00647-8 2021