arXiv subjects

Leonardo Bacciottini

Publications and source records attributed to Leonardo Bacciottini.

6 recordsLinked to original sources

arXiv2026

Rate-Fidelity Tradeoffs in All-Photonic and Memory-Equipped Quantum Switches

Quantum entanglement switches are a key building block for early quantum networks, and a central design question is whether near-term devices should use only flying photons or also incorporate quantum memories. We compare two architectures: an all-photonic entanglement generation switch (EGS) that repeatedly attempts Bell-state measurements (BSM) without storing qubits, and a quantum memory-equipped switch that buffers entanglement and triggers measurements only when heralded connectivity is available (herald-then-swap control). These two designs trade off simple, memoryless operation that avoids decoherence and memory-induced latency against heralding-based control that buffers entanglement to use BSMs more efficiently. We formalize both models under a common hardware abstraction and characterize their achievable rate-fidelity regions, yielding a benchmarking methodology that translates hardware and protocol parameters into network-level performance. Numerical evaluation quantifies the rate-fidelity tradeoffs of both models, identifies operating regions in which each architecture dominates, and shows how hardware and protocol knobs can be tuned to meet application-specific targets.

quant-ph↗

arXiv2025

QuantumSavory: Write Symbolically, Run on Any Backend -- A Unified Simulation Toolkit for Quantum Computing and Networking

Progress in quantum computing and networking depends on codesign across abstraction layers: device-level noise and heterogeneous hardware, algorithmic structure, and distributed classical control. We present QuantumSavory, an open-source toolkit built to make such end-to-end studies practical by cleanly separating a symbolic computer-algebra frontend from interchangeable numerical simulation backends. States, operations, measurements, and protocol logic are expressed in a backend-agnostic symbolic language; the same model can be executed across multiple backends (e.g., stabilizer, wavefunction, phase-space), enabling rapid exploration of accuracy-performance tradeoffs without rewriting the model. Furthermore, new custom backends can be added via a small, well-defined interface that immediately reuses existing models and protocols. QuantumSavory also addresses the classical-quantum interaction inherent to LOCC protocols via discrete-event execution and a tag/query system for coordination. Tags attach structured classical metadata to quantum registers and message buffers, and queries retrieve, filter, or wait on matching metadata by wildcards or arbitrary predicates. This yields a data-driven control plane where protocol components coordinate by publishing and consuming semantic facts (e.g., resource availability, pairing relationships, protocol outcomes) rather than by maintaining rigid object graphs or bespoke message plumbing, improving composability and reuse as models grow. Our toolkit is also not limited to qubits and Bell pairs; rather, any networking dynamics of any quantum system under any type of multipartite entanglement can be tackled. Lastly, QuantumSavory ships reusable libraries of standard states, circuits, and protocol building blocks with consistent interfaces, enabling full-stack examples to be assembled, modified, and compared with minimal glue code.

quant-ph↗

arXiv2025

A Framework for Distributed Resource Allocation in Quantum Networks

We introduce a distributed resource allocation framework for the Quantum Internet that relies on feedback-based, fully decentralized coordination to serve multiple co-existing applications. We develop quantum network control algorithms under the mathematical framework of Quantum Network Utility Maximization (QNUM), where utility functions quantify network performance by mapping entanglement rate and quality into a joint optimization objective. We then introduce QPrimal-Dual, a decentralized, scalable algorithm that solves QNUM by strategically placing network controllers that operate using local state information and limited classical message exchange. We prove global asymptotic stability for concave, separable utility functions, and provide sufficient conditions for local stability for broader non-concave cases. To reduce control overhead and account for quantum memory decoherence, we also propose schemes that locally approximate global quantities and prevent congestion in the network. We evaluate the performance of our approach via simulations in realistic quantum network architectures. Results show that QPrimalDual significantly outperforms baseline allocation strategies, scales with network size, and is robust to latency and decoherence. Our observations suggest that QPrimalDual could be a practical, high-performance foundation for fully distributed resource allocation in quantum networks.

quant-ph↗

arXiv2025

Leveraging Internet Principles to Build a Quantum Network

Designing an operational architecture for the Quantum Internet is challenging in light of both fundamental limits imposed by physics laws and technological constraints. Here, we propose a method to abstract away most of the quantum-specific elements and formulate a best-effort quantum network architecture based on packet switching, akin to that of the classical Internet. This reframing provides an opportunity to exploit the many available and well-understood protocols within the Internet context. As an illustration, we tailor and adapt classical congestion control and active queue management protocols to quantum networks, employing an architecture wherein quantum end and intermediate nodes effectively regulate demand and resource utilization, respectively. Results show that these classical networking tools can be effective in managing quantum memory decoherence and maintaining end-to-end fidelity around a target value.

quant-ph↗

arXiv2024

On the Analysis of Quantum Repeater Chains with Sequential Swaps

We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.

quant-ph↗

arXiv2023

A Configurable Protocol for Quantum Entanglement Distribution to End Nodes

The primary task of a quantum repeater network is to deliver entanglement among end nodes. Most of existing entanglement distribution protocols do not consider purification, which is thus delegated to an upper layer. This is a major drawback since, once an end-to-end entangled connection (or a portion thereof) is established it cannot be purified if its fidelity (F) does not fall within an interval bounded by Fmin (greater than 0.5) and Fmax (less than 1). In this paper, we propose the Ranked Entanglement Distribution Protocol (REDiP), a connection-oriented protocol that overcomes the above drawback. This result was achieved by including in our protocol two mechanisms for carrying out jointly purification and entanglement swapping. We use simulations to investigate the impact of these mechanisms on the performance of a repeater network, in terms of throughput and fidelity. Moreover, we show how REDiP can easily be configured to implement custom entanglement swapping and purification strategies, including (but not restricted to) those adopted in two recent works.

cs.NI↗