SearcharxivSearch

arXiv subjects

David Tipper

Publications and source records attributed to David Tipper.

8 recordsLinked to original sources

HI-QDC: An Isometric Modular Scalable Architecture for Quantum Data Centers

Server-centric quantum data-center architectures offer scalability by distributing communication tasks across QPUs rather than concentrating complexity in a centralized switching core. However, scaling such architectures increases the path length, the number of Bell-state measurements, and the loss of end-to-end fidelity. We ask whether the path diversity of a server-centric topology can be converted into a mechanism for preserving not only rate, but also fidelity. We study this through end-to-end purification as a fidelity-restoration mechanism. First, in a black-box model, we determine the minimum number of raw end-to-end Werner-state copies, each carrying the degraded Werner parameter of a distance-ell path, that purification must consume to recover a single copy matching an elementary link, comparing recursive 2-to-1 and optimized nested r-to-1 purification. Second, we instantiate these requirements in a probabilistic BCube architecture, whose edge-disjoint path diversity supplies the raw copies. Because purification imposes a lower bound on input fidelity, no path redundancy can raise the output below this threshold, which limits scaling. To address it we present the Hop-Independent Quantum Data Center (HI-QDC), an isometric, modular, scalable architecture in which purification transforms end-to-end entanglement across a module into an effective link-level resource for the inter-module topology. Our results identify the regimes in which a BCube module, under end-to-end purification, preserves both the fidelity and the yield of an elementary link. The module then hides its internal hop count and acts as an effective elementary link for a higher-level network. Thus topology supplies the path multiplicity purification requires, while purification converts it into fidelity recovery, enabling recursively scalable quantum data-center networks.

quant-ph

To Purify or Not to Purify: Entanglement Purification under Input Fidelity Asymmetry in Quantum Networks

Entanglement purification with two entangled resource pairs is widely employed in the literature on quantum repeater networks to counteract fidelity degradation introduced by noisy quantum memories and entanglement swapping across multiple hops. Standard purification protocols assume both resource pairs carry identical fidelity. In practice, entanglement generation is stochastic, the two resource pairs are heralded at different times, and so the first pair decoheres in memory while the second is being generated. Thus a fidelity asymmetry is a structural feature of any network operating under realistic memory conditions, leading to the question: when is it beneficial to perform purification? We derive a closed-form fidelity asymmetry tolerance delta(F) that governs whether a purification attempt is beneficial. We determine a universal upper bound delta_max of approximately 0.076 beyond which purification is always counterproductive. Our simulations show that with exponential memory decoherence, purification yields benefits in only approximately 14% of purification attempts on two resource pairs in a two-hop repeater chain. We define three network objectives: fidelity only, time only, and a combination of time and fidelity, to deliver end-to-end entanglement. We show that when the application fidelity requirement is achievable through swapping alone, no-purification is the superior policy, with its advantage increasing with the number of hops. When the fidelity requirement cannot be met with swapping alone and purification is necessary, to be effective, it must be conditioned on delta(F) between resource pairs. We introduce DeltaPurify, a policy that conditions purification decisions on local fidelity information, and show it reduces time-to-serve relative to both naive purification and no-purification across several fidelity thresholds and hops of a repeater chain.

quant-ph

Toward Hop-Independent Fidelity in Quantum Data Centers: Resource Requirements for Entanglement Purification

Quantum data-center networks must distribute entanglement between QPUs over paths whose length grows with system scale, but each entanglement-swapping step reduces the quality of the raw end-to-end state. Topology, multiplexing, and repeated connection attempts can increase the number of raw end-to-end copies available for a request, yet they do not answer the central resource question: whether those copies are sufficient to remove, via entanglement purification, the fidelity loss caused by multi-hop distribution. We study this question through a topology-independent black-box model of the network. Each elementary link is modeled as a Werner state with parameter $w_0$, so ideal swapping over an $\ell$-link path produces equal-quality raw copies with Werner parameter $w_0^\ell$; purification succeeds if it outputs at least one state with Werner parameter at least $w_0$ with probability at least $p_{\mathrm{th}}$. We compare recursive BBPSSW purification with higher-order $r$-to-$1$ bilocal-Clifford purification protocols of Jansen \emph{et al.}, using an all-in recursive schedule whose success probability is computed by exact dynamic programming. The resulting resource landscapes show a threshold structure governed by the Werner entanglement condition $w_0^\ell>1/3$ and demonstrate that multi-copy purification substantially improves both feasibility and copy efficiency. Across the evaluated grid, the Jansen family requires fewer copies than BBPSSW at more than $96\%$ of shared feasible points; at $p_{\mathrm{th}}=0.70$, the median copy budget drops from $268$ to $30$. These results provide a quantitative purification-resource benchmark for assessing whether future quantum data-center architectures can practically support hop-independent end-to-end entanglement quality.

quant-ph

Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control

Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping, in which each node acts on purely local state information. The architectural advantages over the connection-oriented alternative -- simultaneous SWAP-ASAP -- are compelling, but sequential swapping holds partial chains in intermediate buffers between successive swaps, exposing them to memory decoherence in a way simultaneous SWAP-ASAP avoids by design. We present a proof-of-principle study at fixed chain length $n = 4$ in which each elementary link is governed by a fixed reinforcement-learning policy optimizing the secret-key rate of the six-state protocol, leaving the network-layer protocol as the sole independent variable. Sweeping the network-layer memory coherence time $T_c^{\mathrm{ext}}$ over four orders of magnitude reveals a clear regime structure governed by the dimensionless ratio $T_c^{\mathrm{ext}}/\tau$, where $\tau$ is the per-link entanglement heralding latency. Simultaneous SWAP-ASAP delivers a constant rate across the full sweep. Sequential swapping, by contrast, collapses to zero end-to-end deliveries below $T_c^{\mathrm{ext}}/\tau = 25$, and begins recovering at $T_c^{\mathrm{ext}}/\tau = 50$. It remains limited by the simultaneous rate, which it saturates only at the relaxed end of the sweep. These results suggest that the connection-less penalty is a near-term phenomenon tied to present-day memory coherence rather than a fundamental property of sequential swapping.

quant-ph

Near-realtime Earth Observation Via Starlink LEO Satellite Constellation

Earth observation (EO) satellites in Low Earth Orbit (LEO) are collecting vast amounts of data, which are invaluable for applications such as monitoring forest fires. However, data downloading from EO satellites faces significant challenges due to the limited number of ground stations and the brief communication windows with them. Conversely, emerging LEO constellations like Starlink have enabled continuous connectivity and revolutionized access for ordinary users globally, who can connect via a simple satellite dish. In this paper, we study the feasibility of supporting EO satellites with Starlink satellite infrastructure and introduce a novel data delivery system, designated as "Starlink Space User" (SSU), for relaying data from observation satellites. SSU treats EO satellites as space users of Starlink, facilitating efficient data transfer to Earth. At the core of SSU is a novel class of algorithms designed for link and PoP selection, as well as system scheduling optimization, that operate effectively atop Starlink's proprietary infrastructure. We assess the performance of SSU using trace-driven simulations alongside real-world Starlink performance measurements. Our results demonstrate that the proposed Starlink-aided design can significantly reduce the median backlog (data not delivered) per satellite.

cs.NI

Distributed Realization of Color Codes for Quantum Error Correction

Color codes are a leading class of topological quantum error-correcting codes with modest error thresholds and structural compatibility with two-dimensional architectures, which make them well-suited for fault-tolerant quantum computing (FTQC). Here, we propose and analyze a distributed architecture for realizing the (6.6.6) color code. The architecture involves interconnecting patches of the color code housed in different quantum processing units (QPUs) via entangled pairs. To account for noisy interconnects, we model the qubits in the color code as being subject to a bit-flip noise channel, where the qubits on the boundary (seam) between patches experience elevated noise compared to those in the bulk. We investigate the error threshold of the distributed color code under such asymmetric noise conditions by employing two decoders: a tensor-network-based decoder and a recently introduced concatenated Minimum Weight Perfect Matching (MWPM) algorithm. Our simulations demonstrate that elevated noise on seam qubits leads to a slight reduction in threshold for the tensor-network decoder, whereas the concatenated MWPM decoder shows no significant change in the error threshold, underscoring its effectiveness under asymmetric noise conditions. Our findings thus highlight the robustness of color codes in distributed architectures and provide valuable insights into the practical realization of FTQC involving noisy interconnects between QPUs.

quant-ph

On Selecting Paths for End-to-End Entanglement Creation in Quantum Networks

Optimal routing is a fundamental challenge in quantum networking, with several approaches proposed to identify the most efficient path for end-to-end (e2e) entanglement generation between pairs of nodes. In this paper, we show that \textit{prior entanglements} -- entanglements generated in a previous network cycle but not yet utilized -- are an important consideration in optimal path selection due to the dynamic nature of quantum networks. Specifically, we investigate whether a longer path with pre-existing entanglements can outperform a shorter path that starts from scratch. We account for key quantum constraints, including noisy entanglement generation and swapping, fidelity decay, probabilistic operations, and link discarding upon swap failure. Simulations reveal that longer paths with prior entanglements can establish e2e entanglement faster than shorter paths under certain conditions. We further introduce the notion of \textit{entanglement diversity}, where multiple paths can be used to improve performance -- either by selecting the first successful path to minimize time or using both paths to enhance fidelity through distillation. These findings highlight the importance of incorporating prior entanglements into path selection strategies for optimizing quantum communication networks.

quant-ph

ptp++: A Precision Time Protocol Simulation Model for OMNeT++ / INET

Precise time synchronization is expected to play a key role in emerging distributed and real-time applications such as the smart grid and Internet of Things (IoT) based applications. The Precision Time Protocol (PTP) is currently viewed as one of the main synchronization solutions over a packet-switched network, which supports microsecond synchronization accuracy. In this paper, we present a PTP simulation model for OMNeT++ INET, which allows to investigate the synchronization accuracy under different network configurations and conditions. To show some illustrative simulation results using the developed module, we investigate on the network load fluctuations and their impacts on the PTP performance by considering a network with class-based quality-of-service (QoS) support. The simulation results show that the network load significantly affects the network delay symmetry, and investigate a new technique called class probing to improve the PTP accuracy and mitigate the load fluctuation effects.

cs.NI