SearcharxivSearch

arXiv · 2603.02857

An Extensible Quantum Network Simulator Built on ns-3: Q2NS Design and Evaluation

Abstract

As quantum networking hardware remains costly and not yet widely accessible, simulation tools are essential for the design and evaluation of quantum network architectures and protocols. However, designing a scalable and computationally efficient quantum network simulator is intrinsically challenging: i) quantum dynamics must be emulated on classical computing platforms while capturing the stateful and non-local nature of entanglement, a quantum resource without any classical networking analog; ii) quantum networking is inherently hybrid, as protocol execution also fundamentally depends on classical signaling. This makes a tight and faithful co-simulation of quantum operations and classical message exchanges a core requirement. In this light, we present Q2NS, a modular and extensible quantum network simulator, built on top of ns-3, designed to seamlessly integrate quantum-network primitives with ns-3's established classical protocol stack. Q2NS adopts a modular architecture that decouples protocol control logic from node- and channel-level operations, enabling rapid prototyping and adaptation across heterogeneous and evolving Quantum Internet scenarios. Q2NS natively supports multiple quantum state representations through a unified interface, allowing interchangeable state-vector, density-matrix, and stabilizer backends. We validate Q2NS through realistic use-case studies and comprehensive benchmarks, demonstrating superior computational efficiency over representative state-of-the-art alternatives, while preserving modeling flexibility. Finally, we provide a dedicated visualization tool that jointly captures physical and entanglement-enabled connectivity and supports entangled-state manipulations, facilitating an intuitive interpretation of entanglement dynamics and protocol behavior. Q2NS offers a flexible, open, and scalable simulation platform for advancing Quantum Internet research.

Explore related subjects

Keep this discovery

BibTeXRIS

Adam Pearson, Francesco Mazza, Marcello Caleffi, Angela Sara Cacciapuoti. 2026-03-03. An Extensible Quantum Network Simulator Built on ns-3: Q2NS Design and Evaluation. https://doi.org/10.1016/j.comnet.2026.112292

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph