pith. sign in

arxiv: 2606.22316 · v1 · pith:UX6DCP6Tnew · submitted 2026-06-21 · 🪐 quant-ph · cs.NI

Making Quantum Networks Work: Routing, Calibration, and Programmable Quantum Repeaters

Vinay Kumar This is my paper

Pith reviewed 2026-06-26 10:44 UTC · model grok-4.3

classification 🪐 quant-ph cs.NI
keywords quantum networksroutingcalibrationquantum repeatersNV centersentanglement distributionfidelityprogrammable nodes
0
0 comments X

The pith

Partial knowledge of repeater quality enables reliable routing and calibration in quantum networks.

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

The paper develops routing methods for quantum repeater networks that use only topology and end-to-end estimates rather than full link details, showing that partial node-quality information improves fidelity and cuts path blocking. It derives an optimal calibration schedule for linear chains that balances operation time against overhead, then extends this via a greedy heuristic to networks with shared links. Finally it defines an instruction set architecture that lets NV-center repeaters be programmed coherently so physical operations connect directly to network protocols. These steps address the constraints of probabilistic entanglement, decoherence, and hardware drift that classical network abstractions ignore. A reader would care because the methods aim to make scalable entanglement distribution feasible on real hardware without assuming uniform nodes or complete information.

Core claim

Routing under heterogeneous repeater efficiencies demonstrates that partial knowledge of node quality improves end-to-end fidelity and reduces blocking; a grey-box approach that relies solely on topology and end-to-end estimates then achieves robustness and fairness without detailed link-state data. A calibration-aware model that separates activation and calibration phases yields an optimal schedule for linear chains and a greedy orchestration heuristic for general topologies. An instruction set architecture for NV-center repeaters supplies coherent programmability that links low-level physical operations to higher-layer protocols.

What carries the argument

Grey-box routing that selects paths from topology and end-to-end estimates alone, together with a calibration-aware model separating activation and calibration phases and an instruction set architecture for NV-center nodes.

If this is right

  • Partial knowledge of node quality improves fidelity and reduces path blocking compared with homogeneous assumptions.
  • Grey-box routing achieves robustness and fairness without requiring detailed link information.
  • An optimal calibration schedule for linear chains balances operation time against calibration overhead.
  • A greedy heuristic extends the calibration schedule to general topologies with shared links.
  • The instruction set architecture enables coherent programmability that connects physical operations to network protocols.

Where Pith is reading between the lines

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

  • The same grey-box logic could be tested on other repeater platforms whose efficiency statistics are only partially known.
  • Calibration schedules derived for linear chains may need adjustment when entanglement generation rates fluctuate faster than the model assumes.
  • Programmable nodes could allow dynamic switching between different entanglement purification protocols without hardware redesign.

Load-bearing premise

End-to-end estimates and topology information alone suffice for robust path selection and that separating activation from calibration phases accurately reflects hardware behavior.

What would settle it

A simulation or experiment in which grey-box routing produces lower fidelity than full-information routing once node efficiencies differ by more than the model's assumed range.

Figures

Figures reproduced from arXiv: 2606.22316 by Vinay Kumar.

Figure 2.1
Figure 2.1. Figure 2.1: Examples of different types of entanglement. a) a bipartite entangled state depicted by the Bell state; b) two forms of tripartite entanglement, one following the GHZ state and the other the W state; c) a bipartite hyperentanglement in two degrees of freedom, combining polarisation and spatial modes (taken from [3]) In general, an 𝑛-qubit quantum gate corresponds to a matrix of dimension of 2 𝑛 . 2.1.2 E… view at source ↗
Figure 2.2
Figure 2.2. Figure 2.2: a) Teleportation: Teleportation of Alice’s qubit 𝐴1 from state |Ψ⟩0 to Bob’s qubit 𝐵 (yielding state |Ψ⟩ with fidelity |⟨Ψ0 |Ψ⟩|2 ) is achieved via a Bell state measurement on qubits 𝐴1 and 𝐴2. Alice then communicates the resulting classical bits (𝑚0𝐴 and 𝑚1𝐴) to Bob, who applies the appropriate quantum operations on 𝐵 based on these outcomes. b) Entanglement Swapping: Entanglement swapping between Alice… view at source ↗
Figure 2.3
Figure 2.3. Figure 2.3: Using extra qubit resources to boost error resilience. a) Entanglement purification: Each EPR pair is paired with an additional, sacrificial EPR pair to enhance its fidelity (modified from [5]); b) Quantum error correction: Each EPR pair is supported by extra qubits arranged as encoded EPR pairs to reduce the error rate (modified from [44]) 16 [PITH_FULL_IMAGE:figures/full_fig_p046_2_3.png] view at source ↗
Figure 2.4
Figure 2.4. Figure 2.4: Entanglement generation schemes. a) MeetInTheMiddle: Each of two distant stations holds one half of an EPR pair. The entangled qubits are sent to an intermediate station, where entanglement swapping establishes a direct end-to-end entanglement between the remote stations; b) SenderRecever: An entangled qubit generated at the source station is transmitted to the destination station. Here, entanglement swa… view at source ↗
Figure 2.5
Figure 2.5. Figure 2.5: A schematic of the global quantum internet. quantum computer capable of running specific quantum applications while connected to the quantum internet. These devices are equipped with quantum processors to handle the execution of quantum applications and quantum memories to manage incoming entangled quantum states. Quantum links: The quantum links are the quantum and classical channels that connect two ne… view at source ↗
Figure 3.1
Figure 3.1. Figure 3.1: Generations of quantum repeaters based on the method used to correct the error (modified from [96]). 3.4 Generations of quantum repeater Quantum repeaters, as introduced in Section 2.3, are essential for the distribution of end-to-end entanglement, especially in a long-distance regime. However, two major challenges complicate this task: photon loss and operational errors. Photon loss occurs when photons,… view at source ↗
Figure 3.2
Figure 3.2. Figure 3.2: Routing: selection of route. Forwarding: execution of entanglement swapping and purification procedure. Scheduling: selection of end-to-end entanglement in a time-slot (taken from [3]). Today, the industry and academy are working towards realising stable 1G quantum repeaters, which are not yet ready for mass production and field deployment. For this reason, many of the scientific papers published, includ… view at source ↗
Figure 3.3
Figure 3.3. Figure 3.3: a) Advanced entanglement generation: The Path is chosen out of a reduced topology constructed out of successful entanglement links. b) On-demand entanglement generation: Successful entanglement links are established on a chosen path (taken from [3]). devices. The network operates using specific protocols for entanglement generation [7], entanglement purification [97–99], and quantum error correction [100… view at source ↗
Figure 3.4
Figure 3.4. Figure 3.4: State-of-the-art quantum internet protocol stacks. Van Meter et al. [110], Wehner et al. [111], and Dür et al. [112] (taken from [3]). 3.6 Quantum internet protocol stack For efficient and scalable network development, a protocol stack is indispensable, as it offers a structured framework enabling the independent development of each layer. Numerous research groups have put forth proposals for a quantum i… view at source ↗
Figure 4.1
Figure 4.1. Figure 4.1: Quantum network architecture 1. Quantum Repeater: Fundamental component in quantum networks, which allows for long-distance end-to-end entanglement. 2. Quantum Device: Quantum computer capable of running quantum applications connected to the quantum network. 3. Storage and Controller: A logically centralised entity that maintains the net￾work topology and an estimate of the end-to-end fidelity between pa… view at source ↗
Figure 2
Figure 2. Figure 2: c). The process is as follows [PITH_FULL_IMAGE:figures/full_fig_p067_2.png] view at source ↗
Figure 4.2
Figure 4.2. Figure 4.2: The timing diagram Algorithm 2. This phase is represented with duration 𝜏𝑟 in [PITH_FULL_IMAGE:figures/full_fig_p069_4_2.png] view at source ↗
Figure 4.3
Figure 4.3. Figure 4.3: A general schematic of a quantum network with heterogeneous quantum repeaters. Across both aspects, in this work, the network topology is modelled as an undirected graph 𝐺(𝑉 , 𝐸), which is static and known to the controller. Such an assumption is reasonable for a local or metropolitan quantum network that is owned or operated by the same entity, and it is, in fact, valid for intra-domain routing protocol… view at source ↗
Figure 5.1
Figure 5.1. Figure 5.1: Topology of the quantum network for 𝑛𝑠𝑑 = 5 and 25 grid nodes. Source nodes 𝑠𝑛 (in red), destination nodes 𝑑𝑛 (in light blue), and grid nodes (in dark blue). In a regular network structure, the source-destination (SD) pairs are positioned farther apart, leading to a probability mass function (PMF) with less diversity in path lengths and a higher proportion of longer paths compared to a random network (ta… view at source ↗
Figure 5.2
Figure 5.2. Figure 5.2: a) & b) Fidelity vs 𝜉 for Grid network, c) & d) Fidelity vs. 𝜉 for Cylindrical network of the second aspect is restricted to the range 0.5 < 𝜉 < 1. Considering network configurations with 𝜉 < 0.5 would further degrade performance, as such scenarios correspond to networks dominated by lower-quality nodes, offering limited additional insight. This restriction is adopted to improve clarity and facilitate a … view at source ↗
Figure 5.3
Figure 5.3. Figure 5.3: Fidelity vs. 𝜉 𝜉 < 0.32 in the grid network and for 𝜉 < 0.36 in the cylindrical network, fidelity is almost zero apart from outliers. Hence, it is of no use to upgrade 32% in the grid network and 36% in the cylindrical network of LQ nodes to the more expensive/sophisticated HQ nodes. The LQ nodes are observed to be bottlenecks in the performance for both grid and cylindrical networks. Fidelity is barely … view at source ↗
Figure 5.4
Figure 5.4. Figure 5.4: Fidelity vs. 𝜃 for 𝜉 = 0.8 5.4.3 Efficiency Awareness Study In this case-study, we study the efficiency awareness approach against the standard shortest-path approach in the cylindrical-core-based quantum network. We keep 𝐹¯ = 0 but consider two possible mapping functions as follows: 𝑓shortest−path = 1 ∀ 𝜂 (5.5) 𝑓efficiency−aware = ( 100 if 𝜂 = 𝜂𝑙 1 if 𝜂 = 𝜂ℎ (5.6) In the standard shortest-path selection… view at source ↗
Figure 5.5
Figure 5.5. Figure 5.5: Blocking Probability vs. 𝜉 quality (LQ) nodes for later paths [PITH_FULL_IMAGE:figures/full_fig_p084_5_5.png] view at source ↗
Figure 5
Figure 5. Figure 5: illustrates the relationship between blocking probability and [PITH_FULL_IMAGE:figures/full_fig_p084_5.png] view at source ↗
Figure 5.6
Figure 5.6. Figure 5.6: Fidelity vs. 𝜉 with fidelity threshold highlight that when 𝜉 < 0.35, none of the paths achieved fidelity levels exceeding their respective thresholds. Consequently, these paths are designated as blocked and are subsequently excluded from the plot. Notably, a lower 𝐹¯ corresponds to a reduced blocking probability, as fewer paths fall below the threshold value regardless of the approach employed. In the co… view at source ↗
Figure 5.7
Figure 5.7. Figure 5.7: Blocking probability (BP) as a function of the fraction of high-quality nodes (𝜉) in a randomised transport network. Parameters are set with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. only in better network performance but also in motivating better traffic management by assigning requests to path orders depending upon their fidelity threshold. The major bottleneck in t… view at source ↗
Figure 5.8
Figure 5.8. Figure 5.8: Probability mass function (PMF) of path length in a randomised transport network with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. 5.5.1 Blocking Probability Random Topology [PITH_FULL_IMAGE:figures/full_fig_p087_5_8.png] view at source ↗
Figure 5.9
Figure 5.9. Figure 5.9: Blocking probability (BP) as a function of the fraction of high-quality nodes (𝜉) in a regular transport network. Parameters are set with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. for a regular topology, alongside the corresponding probability mass function (PMF) of path lengths depicted in [PITH_FULL_IMAGE:figures/full_fig_p088_5_9.png] view at source ↗
Figure 5
Figure 5. Figure 5: ) [PITH_FULL_IMAGE:figures/full_fig_p088_5.png] view at source ↗
Figure 5.10
Figure 5.10. Figure 5.10: Probability mass function (PMF) of path length in a regular transport network with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. 0.5 0.6 0.7 0.8 0.9 1.0 0.970 0.975 0.980 0.985 0.990 0.995 1.000 Fairness Random Topology Shortest-path Knowledge-aware kx0 path-selection kx1 path-selection k shortest-path [PITH_FULL_IMAGE:figures/full_fig_p089_5_10.png] view at source ↗
Figure 5.11
Figure 5.11. Figure 5.11: Fairness as a function of the fraction of high-quality nodes (𝜉) in a randomised transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. 59 [PITH_FULL_IMAGE:figures/full_fig_p089_5_11.png] view at source ↗
Figure 5.12
Figure 5.12. Figure 5.12: Fidelity as a function of path-order (𝜃) in a randomised transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 12. 60 [PITH_FULL_IMAGE:figures/full_fig_p090_5_12.png] view at source ↗
Figure 5.13
Figure 5.13. Figure 5.13: Fidelity as a function of path-order (𝜃) in a randomised transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5 [PITH_FULL_IMAGE:figures/full_fig_p091_5_13.png] view at source ↗
Figure 5
Figure 5. Figure 5: presents the fairness among network users, quantified using [PITH_FULL_IMAGE:figures/full_fig_p091_5.png] view at source ↗
Figure 5.14
Figure 5.14. Figure 5.14: Fairness as a function of the fraction of high-quality nodes (𝜉) in a regular transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. The majority of the approaches evaluated exhibit comparable levels of fairness and increase their fairness as 𝜉 increases, with the notable exception of the KSP approach, which demonstrates significantly lower fairness and de… view at source ↗
Figure 5.15
Figure 5.15. Figure 5.15: Fidelity as a function of path-order (𝜃) in a regular transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5. fidelity threshold would be an over-utilisation of resources and can be considered as not a fully optimised approach. The optimisation capability of the 𝑘𝑥0 path-selection approach is visible from [PITH_FULL_IMAGE:figures/full_fig_p093_5_15.png] view at source ↗
Figure 5
Figure 5. Figure 5: shows the corresponding fidelity distribution for each path order ( [PITH_FULL_IMAGE:figures/full_fig_p093_5.png] view at source ↗
Figure 5.16
Figure 5.16. Figure 5.16: Blocking probability (BP) as a function of the fraction of high-quality nodes (𝜉) in a randomized transport network with a fidelity threshold (𝐹𝑡ℎ) of 0.53, shown for source-destination counts (𝑛𝑠𝑑 ) of: a) 8, b) 10, and c) 12. structure of the regular topology, enhance the effect of preferential consumption of high-quality nodes in the regular topology. Although the blocking probability of the KA polic… view at source ↗
Figure 5
Figure 5. Figure 5: , it does not serve the paths fairly as in Fig. 5.14. [PITH_FULL_IMAGE:figures/full_fig_p094_5.png] view at source ↗
Figure 5
Figure 5. Figure 5: delineates the relationship between the BP/E and the parameter [PITH_FULL_IMAGE:figures/full_fig_p095_5.png] view at source ↗
Figure 5.17
Figure 5.17. Figure 5.17: Blocking probability per edge (BP/E) as a function of the fraction of high-quality nodes (𝜉) in a randomized transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5, for varying Waxman parameter values (𝛽). helps us better grasp how each new link addition individually affects the network. Specifically, we capture this effect by modelling the performance diff… view at source ↗
Figure 5.18
Figure 5.18. Figure 5.18: Blocking probability per edge (BP/E) as a function of the fraction of high-quality nodes (𝜉) in a randomized transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of 5, to model the performance of the 𝑘𝑥0 path-selection algorithm. 5.5.5 Robustness As described in Section 4.6.1, the end-to-end fidelity data acquired through sampling is central to the 𝑘𝑥0 path-se… view at source ↗
Figure 5
Figure 5. Figure 5: a for [PITH_FULL_IMAGE:figures/full_fig_p097_5.png] view at source ↗
Figure 5.19
Figure 5.19. Figure 5.19: Robustness test: Blocking probability (BP) as a function of the fraction of high-quality nodes (𝜉) in a randomised transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 ) of a) 5, b) 8. The robustness parameter (𝜆) models end-to-end fidelity inaccuracy, with 𝜆 ∈ {1, 8, 16}, corresponding to decreasing noise magnitude. (𝑛𝑠𝑑 = 8) in low and moderate inaccuracies ca… view at source ↗
Figure 5
Figure 5. Figure 5: illustrates the correlation between the blocking probability and the Waxman [PITH_FULL_IMAGE:figures/full_fig_p098_5.png] view at source ↗
Figure 5.20
Figure 5.20. Figure 5.20: Robustness test: Blocking probability (BP) as a function of the fraction of high-quality nodes (𝜉) in a regular transport network, with a fidelity threshold (𝐹𝑡ℎ) of 0.53 and a source-destination count (𝑛𝑠𝑑 = 5). The robustness parameter (𝜆) models end-to-end fidelity inaccuracy, with 𝜆 ∈ {1, 8, 16}, corresponding to decreasing noise magnitude. parameter (𝛽), with algorithm configurations, i.e., 𝑘 = 10 … view at source ↗
Figure 5.21
Figure 5.21. Figure 5.21: Blocking probability vs. Average degree (𝛽) with a fidelity threshold (𝐹𝑡ℎ) = 0.53, number of source and destination (𝑛𝑠𝑑 ) = 5 in a random topology, and having a range of efficiency figures of quantum repeaters. Comparison of shortest-path with grey-box algorithms having algorithm configuration parameter: a) 𝑘 = 10, b) 𝑘 = 50. 5.5.7 Conclusions and future works In the above aspect of routing of this wo… view at source ↗
Figure 6.1
Figure 6.1. Figure 6.1: Experimental polarisation/fidelity drift on the fiber link of [19]. (a) Time evolution of polarisation states {𝐴, 𝐷, 𝐻, 𝐿, 𝑅,𝑉 }. (b) The averaged fidelity decay over the activation period is well described by an exponential-family model (see fitted curve), motivating the exponential decay assumption adopted in the system model. ∼ 10,000 s (∼166 min), after which a ∼2 min calibration restores the link. S… view at source ↗
Figure 6.2
Figure 6.2. Figure 6.2: An example of a two-link quantum network. Fidelity vs. Time for each link with a) No calibration and b) With periodic calibration. The initial fidelity of the generated entangled pair decays over a fidelity period (𝑇𝑓 ). A fixed calibration period (𝜏𝑐 ) is required to rejuvenate each link. 6.2.1 Calibration modelling We now define the calibration of the quantum network links and their types, and establis… view at source ↗
Figure 6.3
Figure 6.3. Figure 6.3: Allowed region for a quantum linear chain of two links with end-to-end fidelity 𝐹𝑒𝑡𝑒 ≥ 0.8. 0.800 0.825 0.850 0.875 0.900 0.925 0.950 0.975 1.000 Fidelity 0.00 0.01 0.02 0.03 Throughput T (0.8923, 0.0365) Throughput vs. Fm 0 and Fm 1 T(Fm 0 ) T(Fm 1 ) Max T=0.0365 at F0=0.8923 [PITH_FULL_IMAGE:figures/full_fig_p117_6_3.png] view at source ↗
Figure 6.4
Figure 6.4. Figure 6.4: Throughput variation at the boundary of the allowed region for a two-link network with an end-to-end fidelity threshold of 0.8. Constants: 𝐶 = 1, 𝑐𝑒 = 1, 𝐹 𝑀 𝑒 = 0.99, Γ𝑒 = 0.6. the inequality of the activation period. For example, for a constant 𝐹 𝑚 0 > 0.8923, with increase in 𝐹 𝑚 1 , the inequality between the activation periods goes from 𝑎𝑒0 < 𝑎𝑒𝑡𝑒 < 𝑎𝑒1 on the boundry to 𝑎𝑒0 < 𝑎𝑒1 = 𝑎𝑒𝑡𝑒 at 𝐹 𝑚 1 = … view at source ↗
Figure 6.5
Figure 6.5. Figure 6.5: Allowed region for a quantum linear chain of two links with end-to-end fidelities 𝐹𝑒𝑡𝑒 ≥ 0.8 and 𝐹𝑒𝑡𝑒 ≥ 0.9. 0.800 0.825 0.850 0.875 0.900 0.925 0.950 0.975 1.000 Fm 0 0.800 0.825 0.850 0.875 0.900 0.925 0.950 0.975 1.000 F m 1 Throughput Heatmap with Allowed Regions Boundary for Fete 0.8 0.00000 0.00025 0.00050 0.00075 0.00100 0.00125 0.00150 0.00175 0.00200 Throughput (a) Throughput region, 𝐹𝑒𝑡𝑒 ≥ 0.8.… view at source ↗
Figure 6.6
Figure 6.6. Figure 6.6: Heat maps of allowed throughput regions for a two-link quantum linear chain. activation period even smaller, which transitions to inequality of 𝑎𝑒0 < 𝑎𝑒1 < 𝑎𝑒𝑡𝑒 . Even further increasing 𝐹 𝑚 1 leads to the transition line 𝐹 𝑚 1 = 𝐹 𝑚 0 where the activation periods are related as 𝑎𝑒0 = 𝑎𝑒1 < 𝑎𝑒𝑡𝑒 . A slight increase now will transition the inequality to 𝑎𝑒1 < 𝑎𝑒0 < 𝑎𝑒𝑡𝑒 . The same observation can be done … view at source ↗
Figure 7.1
Figure 7.1. Figure 7.1: Two-node example. A classical controller broadcasts the instruction vector I(𝑡). Each node decodes it into nuclear register preparation and microwave (MW) or radio-frequency (RF) pulse sequences that realise the selected electron spin operation. instruction round 𝑡 corresponds to a network-wide control slot during which all nodes complete the operations specified by I(𝑡) before proceeding to the next rou… view at source ↗
Figure 7.2
Figure 7.2. Figure 7.2: Entanglement transfer from electron-electron spin to nuclear-nuclear spin in neighbouring NV-center nodes. and timing parameters would differ based on hardware characteristics. The abstraction layer (Section 7.4) is designed to accommodate such variations through architecture￾specific backend implementations. 7.3.2 Deterministic Register Control In the deterministic mode defined by the ISA, the nuclear-s… view at source ↗
Figure 7
Figure 7. Figure 7: schematically illustrates the corresponding procedure in a realistic network [PITH_FULL_IMAGE:figures/full_fig_p134_7.png] view at source ↗
Figure 7.3
Figure 7.3. Figure 7.3: Programmability modes. Deterministic mode initialises the nuclear register in a basis state that selects one operation. Coherent mode prepares and reads the register in a rotated basis to enact a linear combination of operations on the electron spin. Finally, a projective measurement12 is performed on the electron spins. Conditioning on the measurement outcome, the nuclear spins are left in an entangled … view at source ↗
Figure 7.4
Figure 7.4. Figure 7.4: An example: BBPSSW purification protocol in NV-center nodes. The post-operation state is then 𝑈repeater |𝜓𝑁 ⟩ ⊗ [PITH_FULL_IMAGE:figures/full_fig_p137_7_4.png] view at source ↗
Figure 7.5
Figure 7.5. Figure 7.5: Per-electron round throughput 𝑅 vs Per-nuclear spin reset time 𝜏reset for register sizes 𝑟 ∈ {1, 2, 4, 8, 16} with fixed overheads (𝑡MW+𝑡RF+𝑡meas+𝑡class). Larger 𝑟 expands the ISA address space (more programmable operation choices) but increases re-initialisation time. subject to controller and crosstalk constraints between spins. For multi-round protocols such as BBPSSW purification (Sec. 7.4), the time… view at source ↗
Figure 7
Figure 7. Figure 7: shows that as [PITH_FULL_IMAGE:figures/full_fig_p146_7.png] view at source ↗
read the original abstract

The quantum internet enables distribution of quantum states across distant nodes, supporting secure communication, distributed computing, and quantum sensing. Unlike classical networks, it is constrained by the no cloning theorem, probabilistic entanglement generation, decoherence, and hardware drift, making classical abstractions inadequate. Scalable quantum networking therefore requires new architectures, protocols, and optimisation methods that explicitly account for these limitations. This thesis studies the architecture, routing, and operation of quantum networks under realistic constraints, focusing on bipartite entanglement distribution over quantum repeater networks. Key metrics include end to end fidelity, throughput, scalability, and fairness. At the network layer, routing strategies are developed beyond assumptions of homogeneous nodes and full network knowledge. Routing under heterogeneous repeater efficiencies shows how partial knowledge of node quality improves fidelity and reduces path blocking. A grey box routing approach is then introduced, where path selection relies only on topology and end to end estimates, achieving robustness and fairness without detailed link information. At the link layer, calibration and hardware drift are addressed through a calibration aware model separating activation and calibration phases. For linear repeater chains, an optimal calibration schedule is derived to balance operation time and calibration overhead. This is extended to general topologies with shared links, where a greedy orchestration heuristic is proposed. Finally, the thesis connects network protocols with hardware via an instruction set architecture for programmable quantum repeater nodes based on NV centers, enabling coherent programmability and linking physical operations to higher layer protocols.

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

0 major / 2 minor

Summary. The thesis develops routing strategies for bipartite entanglement distribution in quantum repeater networks that account for node heterogeneity and limited information, including a grey-box approach relying only on topology and end-to-end estimates. It derives an optimal calibration schedule for linear chains that balances operation time against overhead and extends this via a greedy heuristic to general topologies with shared links. It also proposes an instruction set architecture for NV-center-based programmable repeaters to enable coherent programmability linking physical operations to network protocols. Key metrics addressed are end-to-end fidelity, throughput, scalability, and fairness, with performance assessed via model-based simulations.

Significance. If the simulation-based evaluations hold, the work offers concrete architectural contributions toward operational quantum networks by addressing realistic constraints like heterogeneous efficiencies, hardware drift, and the need for programmability. The grey-box routing and calibration orchestration provide practical methods that reduce reliance on full link-state knowledge. The ISA bridges hardware and higher layers. Credit is due for the model-based derivations of the calibration schedule and the heuristic extensions evaluated in simulations, which constitute falsifiable, architecture-level predictions.

minor comments (2)
  1. The abstract remains high-level with no quantitative simulation outcomes (e.g., fidelity gains or throughput numbers); adding one or two key results would strengthen the summary of contributions.
  2. Notation for end-to-end estimates and node efficiencies should be defined consistently in the main text to aid readers unfamiliar with the specific models.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper develops routing strategies for heterogeneous repeaters, a grey-box approach relying on topology and end-to-end estimates, an optimal calibration schedule derived for linear chains and extended via greedy heuristic, and an ISA for NV-center nodes. These rest on explicit model assumptions about activation/calibration separation and partial knowledge sufficiency, with performance evaluated in simulations. No equations, self-citations, or derivations are quoted that reduce any prediction or result to its inputs by construction (e.g., no fitted parameters renamed as predictions or ansatzes smuggled via self-citation). The abstract and thesis description indicate self-contained model-based content without load-bearing circular steps. This matches the common honest finding of score 0-2 for papers whose central claims have independent content from their stated models.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only abstract available; no specific free parameters, axioms, or invented entities are detailed enough to enumerate.

pith-pipeline@v0.9.1-grok · 5780 in / 1087 out tokens · 33973 ms · 2026-06-26T10:44:25.147301+00:00 · methodology

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

173 extracted references · 6 linked inside Pith

  1. [1]

    npj Quantum Information , volume=

    Remote quantum clock synchronization without synchronized clocks , author=. npj Quantum Information , volume=. 2018 , publisher=

    2018

  2. [2]

    Nature Reviews Physics , volume=

    Quantum certification and benchmarking , author=. Nature Reviews Physics , volume=. 2020 , publisher=

    2020

  3. [3]

    Nature , volume=

    An integrated space-to-ground quantum communication network over 4,600 kilometres , author=. Nature , volume=. 2021 , publisher=

    2021

  4. [4]

    Nature , volume=

    Satellite-to-ground quantum key distribution , author=. Nature , volume=. 2017 , publisher=

    2017

  5. [5]

    Optics Express , volume=

    Non-local polarization alignment and control in fibers using feedback from correlated measurements of entangled photons , author=. Optics Express , volume=. 2023 , publisher=

    2023

  6. [6]

    Optics Express , volume=

    Efficient polarization-entangled state compensation in quantum entanglement distribution , author=. Optics Express , volume=. 2025 , publisher=

    2025

  7. [7]

    EPJ quantum technology , volume=

    A study of polarization compensation for quantum networks , author=. EPJ quantum technology , volume=. 2023 , publisher=

    2023

  8. [8]

    IEEE Transactions on Quantum Engineering , year=

    On-demand Resource Allocation for A Quantum Network Hub , author=. IEEE Transactions on Quantum Engineering , year=

  9. [9]

    Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=

    Quantum network optimization: From optimal routing to fair resource allocation , author=. Proceedings of the ACM on Measurement and Analysis of Computing Systems , volume=. 2025 , publisher=

    2025

  10. [10]

    arXiv preprint arXiv:2502.20240 , year=

    Entanglement buffering with multiple quantum memories , author=. arXiv preprint arXiv:2502.20240 , year=

    arXiv

  11. [11]

    Nature , volume=

    Entanglement of nanophotonic quantum memory nodes in a telecom network , author=. Nature , volume=. 2024 , publisher=

    2024

  12. [12]

    PRX Quantum , volume=

    Automated distribution of polarization-entangled photons using deployed New York City fibers , author=. PRX Quantum , volume=. 2024 , publisher=

    2024

  13. [13]

    Nature , volume=

    Qubit teleportation between non-neighbouring nodes in a quantum network , author=. Nature , volume=. 2022 , publisher=

    2022

  14. [14]

    Physical Review Letters , volume=

    Entanglement of trapped-ion qubits separated by 230 meters , author=. Physical Review Letters , volume=. 2023 , publisher=

    2023

  15. [15]

    Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA , volume=

    A quantitative measure of fairness and discrimination , author=. Eastern Research Laboratory, Digital Equipment Corporation, Hudson, MA , volume=

  16. [16]

    npj Quantum Information , volume=

    Designing quantum networks using preexisting infrastructure , author=. npj Quantum Information , volume=. 2022 , publisher=

    2022

  17. [17]

    IEEE Transactions on Network Science and Engineering , year=

    Maximizing entanglement routing rate in quantum networks: Approximation algorithms , author=. IEEE Transactions on Network Science and Engineering , year=

  18. [18]

    arXiv preprint arXiv:1610.05238 , year=

    Shortcuts to quantum network routing , author=. arXiv preprint arXiv:1610.05238 , year=

    Pith/arXiv arXiv

  19. [19]

    IEEE Journal on Selected Areas in Communications , volume=

    Optimal remote entanglement distribution , author=. IEEE Journal on Selected Areas in Communications , volume=. 2020 , publisher=

    2020

  20. [20]

    IEEE journal on selected areas in communications , volume=

    Routing of multipoint connections , author=. IEEE journal on selected areas in communications , volume=. 2002 , publisher=

    2002

  21. [21]

    npj Quantum Information , volume=

    A benchmarking procedure for quantum networks , author=. npj Quantum Information , volume=. 2023 , publisher=

    2023

  22. [22]

    Optica , volume=

    Heralding quantum entanglement between two room-temperature atomic ensembles , author=. Optica , volume=. 2021 , publisher=

    2021

  23. [23]

    IEEE Journal on Selected Areas in Communications , volume=

    On optimum entanglement purification scheduling in quantum networks , author=. IEEE Journal on Selected Areas in Communications , volume=. 2024 , publisher=

    2024

  24. [24]

    Science , volume=

    Realization of a multinode quantum network of remote solid-state qubits , author=. Science , volume=. 2021 , publisher=

    2021

  25. [25]

    arXiv preprint arXiv:2111.13124 , year=

    An architecture for meeting quality-of-service requirements in multi-user quantum networks , author=. arXiv preprint arXiv:2111.13124 , year=

    arXiv

  26. [26]

    IEEE Transactions on Quantum Engineering , volume=

    A connection-oriented entanglement distribution design in quantum networks , author=. IEEE Transactions on Quantum Engineering , volume=. 2022 , publisher=

    2022

  27. [27]

    Journal of Statistical Physics , volume=

    Quantum detection and estimation theory , author=. Journal of Statistical Physics , volume=. 1969 , publisher=

    1969

  28. [28]

    IEEE Transactions on Quantum Engineering , volume=

    DQRA: Deep quantum routing agent for entanglement routing in quantum networks , author=. IEEE Transactions on Quantum Engineering , volume=. 2022 , publisher=

    2022

  29. [29]

    ICC 2023-IEEE International Conference on Communications , pages=

    Learning-Based Route Selection in Noisy Quantum Communication Networks , author=. ICC 2023-IEEE International Conference on Communications , pages=. 2023 , organization=

    2023

  30. [30]

    2024 International Conference on Quantum Communications, Networking, and Computing (QCNC) , pages=

    Reinforcement Learning Based Proactive Entanglement Swapping for Quantum Networks , author=. 2024 International Conference on Quantum Communications, Networking, and Computing (QCNC) , pages=. 2024 , organization=

    2024

  31. [31]

    Proceedings of the 24th International Conference on Distributed Computing and Networking , pages=

    Greedy algorithms for finding entanglement swap paths in quantum networks , author=. Proceedings of the 24th International Conference on Distributed Computing and Networking , pages=

  32. [32]

    2023 Biennial Symposium on Communications (BSC) , pages=

    Entangled Pair Resource Allocation Under Uncertain Fidelity Requirements , author=. 2023 Biennial Symposium on Communications (BSC) , pages=. 2023 , organization=

    2023

  33. [33]

    IEEE/ACM Transactions on Networking , volume=

    Entanglement routing design over quantum networks , author=. IEEE/ACM Transactions on Networking , volume=. 2023 , publisher=

    2023

  34. [34]

    IEEE Journal on Selected Areas in Communications , volume=

    A probability-based optimization approach for entanglement distribution and source position in quantum networks , author=. IEEE Journal on Selected Areas in Communications , volume=. 2024 , publisher=

    2024

  35. [35]

    2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) , pages=

    Online entanglement routing in quantum networks , author=. 2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS) , pages=. 2022 , organization=

    2022

  36. [36]

    IEEE INFOCOM 2022-IEEE Conference on Computer Communications , pages=

    E2E fidelity aware routing and purification for throughput maximization in quantum networks , author=. IEEE INFOCOM 2022-IEEE Conference on Computer Communications , pages=. 2022 , organization=

    2022

  37. [37]

    npj Quantum Information , volume=

    Effective routing design for remote entanglement generation on quantum networks , author=. npj Quantum Information , volume=. 2021 , publisher=

    2021

  38. [38]

    arXiv preprint arXiv:2303.12864 , year=

    Entanglement routing based on fidelity curves , author=. arXiv preprint arXiv:2303.12864 , year=

    arXiv

  39. [39]

    IEEE INFOCOM 2021-IEEE Conference on Computer Communications , pages=

    Redundant entanglement provisioning and selection for throughput maximization in quantum networks , author=. IEEE INFOCOM 2021-IEEE Conference on Computer Communications , pages=. 2021 , organization=

    2021

  40. [40]

    Concurrent entanglement routing for quantum networks: Model and designs , author=. Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication , pages=

  41. [41]

    New Journal of Physics , volume=

    Modular architectures for quantum networks , author=. New Journal of Physics , volume=. 2018 , publisher=

    2018

  42. [42]

    arXiv preprint arXiv:2105.00418 , year=

    Cost vector analysis & multi-path entanglement routing in quantum networks , author=. arXiv preprint arXiv:2105.00418 , year=

    arXiv

  43. [43]

    IEEE Transactions on Network and Service Management , volume=

    Swapping-based entanglement routing design for congestion mitigation in quantum networks , author=. IEEE Transactions on Network and Service Management , volume=. 2023 , publisher=

    2023

  44. [44]

    New Journal of Physics , volume=

    A quantum network stack and protocols for reliable entanglement-based networks , author=. New Journal of Physics , volume=. 2019 , publisher=

    2019

  45. [45]

    IEEE/ACM Transactions On Networking , volume=

    System design for a long-line quantum repeater , author=. IEEE/ACM Transactions On Networking , volume=. 2008 , publisher=

    2008

  46. [46]

    Proceedings of the 7th Asian Internet Engineering Conference , pages=

    Protocol design for quantum repeater networks , author=. Proceedings of the 7th Asian Internet Engineering Conference , pages=

  47. [47]

    arXiv preprint arXiv:1904.08605 , year=

    Quantum link bootstrapping using a RuleSet-based communication protocol , author=. arXiv preprint arXiv:1904.08605 , year=

    arXiv 1904

  48. [48]

    2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , pages=

    A quantum internet architecture , author=. 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , pages=. 2022 , organization=

    2022

  49. [49]

    Proceedings of the ACM special interest group on data communication , pages=

    A link layer protocol for quantum networks , author=. Proceedings of the ACM special interest group on data communication , pages=

  50. [50]

    Proceedings of the sixth annual ACM international conference on nanoscale computing and communication , pages=

    Towards large-scale quantum networks , author=. Proceedings of the sixth annual ACM international conference on nanoscale computing and communication , pages=

  51. [51]

    Proceedings of the 16th international conference on emerging networking experiments and technologies , pages=

    Designing a quantum network protocol , author=. Proceedings of the 16th international conference on emerging networking experiments and technologies , pages=

  52. [52]

    Computer Networks , volume=

    Quantum internet protocol stack: A comprehensive survey , author=. Computer Networks , volume=. 2022 , publisher=

    2022

  53. [53]

    IEEE Communications Surveys & Tutorials , volume=

    A survey of quantum internet protocols from a layered perspective , author=. IEEE Communications Surveys & Tutorials , volume=. 2024 , publisher=

    2024

  54. [54]

    Ieee Access , volume=

    Optimal routing for quantum networks , author=. Ieee Access , volume=. 2017 , publisher=

    2017

  55. [55]

    arXiv preprint arXiv:2011.11644 , year=

    Purification and entanglement routing on quantum networks , author=. arXiv preprint arXiv:2011.11644 , year=

    arXiv 2011

  56. [56]

    Results in Physics , volume=

    High-fidelity entanglement routing in quantum networks , author=. Results in Physics , volume=. 2024 , publisher=

    2024

  57. [57]

    IEEE Transactions on Communications , volume=

    Fidelity-guaranteed entanglement routing in quantum networks , author=. IEEE Transactions on Communications , volume=. 2022 , publisher=

    2022

  58. [58]

    arXiv preprint arXiv:2405.00849 , year=

    Entanglement routing using quantum error correction for distillation , author=. arXiv preprint arXiv:2405.00849 , year=

    arXiv

  59. [59]

    Networking Science , volume=

    Path selection for quantum repeater networks , author=. Networking Science , volume=. 2013 , publisher=

    2013

  60. [60]

    Journal of Lightwave Technology , volume=

    Fragmentation-aware entanglement routing for quantum networks , author=. Journal of Lightwave Technology , volume=. 2021 , publisher=

    2021

  61. [61]

    Physical Review Research , volume=

    Practical figures of merit and thresholds for entanglement distribution in quantum networks , author=. Physical Review Research , volume=. 2019 , publisher=

    2019

  62. [62]

    IEEE Transactions on Quantum Engineering , volume=

    Request scheduling in quantum networks , author=. IEEE Transactions on Quantum Engineering , volume=. 2021 , publisher=

    2021

  63. [63]

    IEEE Transactions on Network Science and Engineering , volume=

    An efficient scheduling scheme of swapping and purification operations for end-to-end entanglement distribution in quantum networks , author=. IEEE Transactions on Network Science and Engineering , volume=. 2023 , publisher=

    2023

  64. [64]

    2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , pages=

    A linear algebraic framework for quantum internet dynamic scheduling , author=. 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , pages=. 2022 , organization=

    2022

  65. [65]

    2023 32nd International Conference on Computer Communications and Networks (ICCCN) , pages=

    Esdi: Entanglement scheduling and distribution in the quantum internet , author=. 2023 32nd International Conference on Computer Communications and Networks (ICCCN) , pages=. 2023 , organization=

    2023

  66. [66]

    IEEE Transactions on Quantum Engineering , volume=

    Entanglement distribution in a quantum network: A multicommodity flow-based approach , author=. IEEE Transactions on Quantum Engineering , volume=. 2020 , publisher=

    2020

  67. [67]

    2022 IEEE International conference on smart computing (SMARTCOMP) , pages=

    Resource allocation in quantum networks for distributed quantum computing , author=. 2022 IEEE International conference on smart computing (SMARTCOMP) , pages=. 2022 , organization=

    2022

  68. [68]

    Pervasive and Mobile Computing , volume=

    Service differentiation and fair sharing in distributed quantum computing , author=. Pervasive and Mobile Computing , volume=. 2023 , publisher=

    2023

  69. [69]

    Communications Physics , volume=

    Simulating quantum repeater strategies for multiple satellites , author=. Communications Physics , volume=. 2022 , publisher=

    2022

  70. [70]

    Computer Networks , volume=

    A survey on non-terrestrial quantum networking: Challenges and trends , author=. Computer Networks , volume=. 2024 , publisher=

    2024

  71. [71]

    Acta Astronautica , volume=

    Quantum communications at ESA: Towards a space experiment on the ISS , author=. Acta Astronautica , volume=. 2008 , publisher=

    2008

  72. [72]

    arXiv preprint arXiv:2111.09595 , year=

    Topical white paper: a case for quantum memories in space , author=. arXiv preprint arXiv:2111.09595 , year=

    arXiv

  73. [73]

    Scientific reports , volume=

    Optimal architectures for long distance quantum communication , author=. Scientific reports , volume=. 2016 , publisher=

    2016

  74. [74]

    IEEE Journal of Selected topics in quantum electronics , volume=

    Inside quantum repeaters , author=. IEEE Journal of Selected topics in quantum electronics , volume=. 2015 , publisher=

    2015

  75. [75]

    npj Quantum Information , volume=

    Implementation of a 46-node quantum metropolitan area network , author=. npj Quantum Information , volume=. 2021 , publisher=

    2021

  76. [76]

    IEEE Transactions on Quantum Engineering , volume=

    Design and implementation of the Illinois Express quantum metropolitan area network , author=. IEEE Transactions on Quantum Engineering , volume=. 2022 , publisher=

    2022

  77. [77]

    IEEE micro , volume=

    On double full-stack communication-enabled architectures for multicore quantum computers , author=. IEEE micro , volume=. 2021 , publisher=

    2021

  78. [78]

    Physical review applied , volume=

    Multicore quantum computing , author=. Physical review applied , volume=. 2022 , publisher=

    2022

  79. [79]

    arXiv preprint quant-ph/9803056 , year=

    Quantum repeaters for communication , author=. arXiv preprint quant-ph/9803056 , year=

    Pith/arXiv arXiv

  80. [80]

    Nature , volume=

    The quantum internet , author=. Nature , volume=. 2008 , publisher=

    2008

Showing first 80 references.