arXiv subjects

Stefano Pirandola

Publications and source records attributed to Stefano Pirandola.

At least 19 recordsLinked to original sources

arXiv2026

Fundamental Limits on Polarization Entanglement Distribution in Optical Fiber

Characterizing the ultimate rates of entanglement distribution is essential for both foundational research and the practical deployment of quantum technologies. To investigate these limits, we introduce an erasure-Pauli channel model describing the distribution of polarization entanglement in optical fiber. For this channel, we derive bounds on the rates of entanglement distribution and related quantum resources under optimal local operations and two-way classical communication (two-way assisted capacities). This framework allows us to determine the optimal repeaterless performance achievable over realistic optical fibers affected by polarization mode dispersion, thereby providing a rigorous benchmark for long-distance polarization-based quantum communication. Finally, we show that both our model and capacity bounds remain robust under the inclusion of detector dark counts.

quant-ph↗

arXiv2026

Improved lower bound for the two-way-assisted quantum capacity of the bosonic thermal-loss channel

The bosonic thermal-loss channel is a fundamental model for quantum communication. This Gaussian channel models the transmission of bosonic systems subject to both loss and thermal noise. It describes many practical systems, including optical fibers, waveguides and free-space links, where background thermal noise is significant. Determining the channel's two-way-assisted quantum capacity, the maximum rate at which quantum information can be transmitted reliably through the channel with two-way classical assistance, remains an open problem. Here, we improve upon the best known lower bound for this capacity for a wide range of channel parameters. We achieve this by combining an improved qubit-bosonic distribution technique with a recently introduced technique for discovering entanglement distillation protocols.

quant-ph↗

arXiv2026

A Throughput-Oriented Analytical Model for Post-Quantum Security Protocols

Growing awareness of the impact of quantum threat on classical cryptography directly translates into a growing demand for accurate network simulation tools capable of estimating the integration effects of quantum-safe cryptography in current systems. In particular, the adoption of Post-Quantum Cryptography (PQC) has a direct impact on the performance of network endpoints and transmission overhead. This also affects the scalability of widely adopted security protocols such as TLS and SSH. In this paper, we present a throughput-oriented analytical model that provides a tight upper bound on the maximum sustainable rate of post-quantum secure connection establishment in TLS and SSH. This model takes into account both endpoint and network capacity constraints, decomposing the handshake process into dominant cryptographic operation time and network transmission time. Identifying the bottleneck allows us to derive the achievable throughput in terms of handshakes per second. The experimental results provided show the accuracy of the model against the data obtained from an experimental testbed using, among others, NIST standard primitives from FIPS 203, 204, and 205, including ML-KEM and ML-DSA. Finally, we integrate our model into a network environment and demonstrate how it can be leveraged to enable efficient resource allocation among multiple endpoints, optimizing PQC traffic in multiple-unicast scenarios.

cs.CR↗

arXiv2026

Heuristic Lookahead Distillation Protocol Search

Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.

quant-ph↗

arXiv2026

Optimal Interpolation of Entanglement Purification Protocols

Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.

quant-ph↗

arXiv2026

Free-Space Quantum Networks and Optimized Fiber-Reinforcement

Free-space quantum communication provides a flexible complement to fiber-based quantum networks, but its point-to-point capacity is fundamentally limited by diffraction, atmospheric extinction and beam wandering induced by turbulence. In this work, we study the end-to-end performance of large-scale free-space quantum networks connecting randomly distributed fixed or mobile users, modelled as Waxman random graphs. We derive the mean network capacity, edge consumption and connectivity phase transitions for both single-path and multi-path (flooding) routing. We also study router-centered star networks, deriving the full distribution of end-to-end capacities as a function of the router's coverage radius. We then consider how performance may be improved by reinforcing free-space networks with a small number of optimally placed fiber-based backbone nodes. We prove that any optimal backbone configuration must correspond to a capacity-maximizing Voronoi tessellation of the network region, and show that this can be efficiently approximated by a centroidal Voronoi tessellation via Lloyd's algorithm, with backbone nodes connected according to a Delaunay triangulation. Numerical results show that even a modest number of backbone nodes substantially improves end-to-end capacity and reduces edge consumption for both mobile and fixed users.

quant-ph↗

arXiv2026

Continuous-Variable Quantum Key Distribution with Composable Security and Tight Error Correction Bound towards Constrained-Device Implementations

Constrained devices, such as smart sensors, wearable devices, and Internet of Things nodes, are increasingly prevalent in society and rely on secure communications to function properly. These devices often operate autonomously, exchanging sensitive data or commands over short distances, such as within a room, house, or warehouse. In this context, continuous-variable quantum key distribution (CV-QKD) offers the highest secure key rate and the greatest versatility for integration into existing infrastructure. A key challenge in this setting, where devices have limited storage and processing capacity, is obtaining a realistic and tight estimate of the CV-QKD secure key rate within a composable security framework, with error correction (EC) consuming most of the storage and computational power. To address this, we focus on low-density parity-check (LDPC) codes with non-binary alphabets, which optimise mutual information and are particularly suited for short-distance communications. We develop a security framework to derive finite-size secret keys near the optimal EC leakage limit and model the related memory requirements for the encoding process in one-way error correction. This analysis facilitates the practical deployment of CV-QKD, particularly in constrained devices with limited storage and computational resources.

quant-ph↗

arXiv2026

Continuous-variable quantum communication

Tremendous progress in experimental quantum optics in recent decades has enabled the advent of quantum technologies, one of which is quantum communication. Aimed at novel methods for more secure or more efficient information transfer, quantum communication has developed into an active field of research and proceeds toward full-scale implementations and industrialization. Continuous-variable methods of multiphoton quantum state preparation, manipulation, and coherent detection, as well as the respective theoretical tools of phase-space quantum optics, offer the possibility of making quantum communication efficient, applicable, and accessible, thus boosting the development of the field. We review the methodology, techniques, and protocols of continuous-variable quantum communication from the first theoretical ideas through milestone implementations to recent developments. The review covers quantum key distribution as well as other quantum communication schemes that are suggested on the basis of continuous-variable states and measurements.

quant-ph↗

arXiv2026

Fault-tolerant measurement-device-independent quantum key distribution with noisy non-Gaussian error correction

It is well known that the repeater node is an essential ingredient for the future global quantum network, which will enable high-rate private communication and entanglement distribution over very long distances. The near-term repeater architecture uses the measurement-based node that operate without both entanglement and quantum memory, which is the main idea of the measurement-device-independent quantum key distribution (MDI-QKD) protocol. The MDI-QKD protocol removes the trust condition from the inter repeaters, while its continuous variable (CV) version, when proposed, benefited from its deterministic nature, compatible with the classical devices, and shows a high rate for the short-range local area network (LAN). Whilst the theoretical backbone of CV-MDI-QKD protocol is well established, its secure transmission range is yet limited for practical LAN. In this study, we propose an enhanced scheme for the asymmetric CV-MDI-QKD protocol by using Gottesman-Kitaev-Preskill (GKP) oscillators-to-oscillators codes, where both loss error and operation error are suppressed to below the break-even point, without any delays caused by classical heralding signals. In particular, the proposed scheme, which correlates the noises of the data and ancilla via a pair of symplectic transforms, extracts the error syndromes from stabilizer measurements on the ancilla mode and informs the data mode for a corrective displacement. Numerical analysis shows the composable finite-size security of the protocol under the collective Gaussian attack, encompassing noiseless and noisy GKP states, with both wired (i.e., fiber-based) and wireless (i.e., free-space) configurations. In addition, we demonstrate that the residual errors of the GKP code can be further reduced by the concatenation method but has a trade-off between the layers number and the finite GKP squeezing.

quant-ph↗

arXiv2026

Fundamental Limits on QBER and Distance in Quantum Key Distribution

Quantum key distribution (QKD) enables information-theoretic secure communication, yet its ultimate tolerance to noise and achievable transmission distance remain fundamentally constrained. We establish the maximum quantum bit error rate (QBER) compatible with secure QKD and derive corresponding upper bounds on communication distance. Our results follow from a fundamental capacity threshold for qubit Pauli channels and apply to protocols based on two or more mutually unbiased bases, using either single-photon or weak coherent sources. By connecting information-theoretic limits to realistic physical noise models, we obtain universal bounds on achievable distances in fiber and free-space links, including diffraction-limited constraints relevant to deep-space quantum communications. These findings clarify the ultimate noise robustness of QKD and delineate the fundamental boundaries of secure quantum communication.

quant-ph↗

arXiv2026

Realistic Threat Models for Fiber and Free-Space Continuous-Variable Quantum Key Distribution

Future global quantum communication networks, or quantum Internet, will realize high-rate secure communication and entanglement distribution for large-scale users over long distances. Continuous variable (CV) quantum key distribution (QKD) provides a powerful setting for secure quantum communications, thanks to the use of room-temperature off-the-shelf optical devices and the potential to reach high rates. However, the achievable performance of CV-QKD protocols is fundamentally limited by the fact that they appear to be fragile to both loss and noise. In this study, we provide a general framework for analyzing the composable finite-size security of CV-QKD with Gaussian-modulated coherent-state protocol (GMCS) under various levels of trust for the loss and noise experienced by the users of the protocol. Our work is comprehensive of several practical scenarios, encompassing both active and passive eavesdropping configurations, with both wired (i.e., fiber-based) and wireless (i.e., free-space and satellite-based) quantum communication channels. Our numerical results evaluate the robustness of the GMCS protocol under varying levels of trust and demonstrate that it is difficult for a practical protocol to remain robust against untrusted loss at the transmitter. In the wireless case, we analyze a scenario with a sun-synchronous satellite, showing that its key distribution rate, even with the worst level of trust, can outperform a ground chain of ideal quantum repeaters. Our results indicate that, when it comes to engineering and optimizing quantum-safe networks, it is essential to mitigate the shortcomings caused by critical trade-offs between rate performance, trust level, system noise, and communication distance.

quant-ph↗

arXiv2025

Optimizing Epsilon Security Parameters in QKD

We investigate the optimization of epsilon-security parameters in quantum key distribution (QKD), aiming to improve the achievable secure key rate under a fixed overall composable security level. For this purpose, we employ a continuous genetic algorithm (CGA) to optimize the epsilon-security components of two representative protocols: the homodyne protocol from the continuous-variable (CV) family and the BB84 protocol from the discrete-variable (DV) family. We detail the CGA configuration, summarize the derivation of the composable key rate, and emphasize the role of the epsilon-parameters in both protocols. We then compare key rates obtained with optimized epsilon-values against those derived from standard and randomized choices. Our results demonstrate substantial key rate improvements at high security levels, where the key rate typically vanishes, and uncover positive-rate regimes that are inaccessible without optimization.

quant-ph↗

arXiv2025

Lower Bounding the Secret Key Capacity of Bosonic Gaussian Channels via Optimal Gaussian Measurements

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate capacity of the channel. We focus on the class of phase-insensitive Gaussian channels. For the thermal-loss and thermal amplification channels, our results demonstrate the optimality, within the constraints of our analysis, of previously proposed protocols, while also providing a significantly simplified formula for their performance evaluation. For the added noise channel, our rate provides a better lower bound than any previously known.

quant-ph↗

arXiv2025

Quantum-enhanced biosensing enables earlier detection of bacterial growth

Rapid detection of bacterial growth is crucial in clinical, food safety, and environmental contexts, yet conventional optical methods are limited by noise and require hours of incubation. Here, we present the first experimental demonstration of a quantum-enhanced photometric measurement for early bacterial detection using squeezed light. By monitoring the optical absorbance of an Escherichia coli culture with a quantum probe, we achieve a sensitivity beyond the shot-noise limit, enabling identification of growth onset up to 30 minutes earlier than with a classical sensor. The noise reduction is validated through statistical modeling with a truncated Gaussian distribution and hypothesis testing, confirming earlier detection with low false-alarm rates. This work illustrates how quantum resources can improve real-time, non-invasive diagnostics. Our results pave the way for quantum-enhanced biosensors that accelerate detection of microbial growth and other biological processes without increasing photodamage.

quant-ph↗

arXiv2025

Improved composable key rates for CV-QKD

Modern security proofs of quantum key distribution (QKD) must take finite-size effects and composable aspects into consideration. This is also the case for continuous-variable (CV) protocols which are based on the transmission and detection of bosonic coherent states. In this paper, we refine and advance the previous theory in this area providing a more rigorous formulation for the composable key rate of a generic CV-QKD protocol. Thanks to these theoretical refinements, our general formulas allow us to prove more optimistic key rates with respect to previous literature.

quant-ph↗

arXiv2025

Practical Routing and Criticality in Large-Scale Quantum Communication Networks

The efficacy of a communication network hinges upon both its physical architecture and the protocols that are employed within it. In the context of quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point quantum channels such that the rate for distributing entanglement, secret keys, or quantum states decays exponentially with respect to transmission distance. Quantum networks are the solution to overcome point-to-point limitations, but they simultaneously invite a challenging open question: How should quantum networks be designed to effectively and efficiently guarantee high rates? Now that performance and physical topology are inexorably linked, this question is not easy, but the answer is essential for a future quantum internet to be successful. In this work, we offer crucial insight into this open question for complex optical-fiber quantum networks. Using realistic descriptions of quantum networks via random network models and practical end-to-end routing protocols, we reveal critical phenomena associated with large-scale quantum networks. Our work reveals the weaknesses of applying single-path routing protocols within quantum networks, observing an inability to achieve reliable rates over long distances. Adapting novel algorithms for multi-path routing, we employ an efficient and practical multi-path routing algorithm capable of boosting performance while minimizing costly quantum resources.

quant-ph↗

arXiv2025

An Overview of CV-MDI-QKD

As quantum key distribution (QKD) emerges as a robust defense against quantum computer threats, significant advancements have been realized by researchers. A pivotal focus has been the development of protocols that not only simplify hardware implementation like the use of continuous-variable (CV) systems, but also negate the necessity for trusted nodes, as seen with the measurement-device independent (MDI) approach. This paper delves into the integration of these methodologies in the CV-MDI-QKD protocol, offering an in-depth exploration of its evolution, primary characteristics, and the latest advancements in both theory and experiment.

quant-ph↗

arXiv2025

High-rate continuous-variable quantum key distribution over 100 km fiber with composable security

Quantum key distribution (QKD), providing a way to generate secret keys with information-theoretic security,is arguably one of the most significant achievements in quantum information. The continuous-variable QKD (CV-QKD) offers the potential advantage of achieving a higher secret key rate (SKR) within a metro area, as well as being compatible with the mature telecom industry. However, the SKR and transmission distance of state-of-the-art CV-QKD systems are currently limited. Here, based on the novelly proposed orthogonal-frequency-division-multiplexing (OFDM) CV-QKD protocol, we demonstrate for the first time a high-rate multi-carrier (MC) CV-QKD with a 10 GHz symbol rate that chieves Gbps SKR within 10km and Mbps SKR over 100 km in the finite-size regime under composable security against collective attacks. The record-breaking results are achieved by suitable optimization of subcarrier number and modulation variance, well-controlled excess noise induced by both OFDM mechanism and efficient DSP scheme, and high-performance post-processing capacity realized by heterogeneous computing scheme. The composable finite-size SKR reaches 1779.45 Mbps@5km, 1025.49 Mbps@10km, 370.50 Mbps@25km, 99.93 Mbps@50km, 25.70 Mbps@75km,and 2.25 Mbps@100km, which improves the SKR by two orders of magnitude and quintuples the maximal transmission distance compared to most recently reported CV-QKD results [Nature Communications, 13, 4740 (2022)]. Interestingly, it is experimentally verified that the SKR of the proposed MC CV-QKD can approach five times larger than that of the single-carrier CV-QKD with the same symbol rate without additional hardware costs. Our work constitutes a critical step towards future high-speed quantum metropolitan and access networks.

quant-ph↗