Searcharxiv⌕ Search

arXiv subjects

Stefano Pirandola

Publications and source records attributed to Stefano Pirandola.

At least 37 records · Page 2Linked to original sources

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↗

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↗

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↗

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↗

Autonomous Recognition of Erroneous Raw Key Bit Bias in Quantum Key Distribution

As Quantum Key Distribution technologies mature, it is pertinent to consider these systems in contexts beyond lab settings, and how these systems may have to operate autonomously. To begin, an abstract definition of a type of error that can occur with regard to the ratio of bit values in the raw key is presented, and how this has an impact on the security and key rate of QKD protocols. A mechanism by which errors of this type can be autonomously recognised is given, along with simulated results. A two part countermeasure that can be put in place to mitigate against errors of this type is also given. Finally some motivating examples where this type of error could appear in practice are presented to add context, and to illustrate the importance of this work to the development of Quantum Key Distribution technologies.

quant-ph↗

Quantum Illumination and Quantum Radar: A Brief Overview

Quantum illumination (QI) and quantum radar have emerged as potentially groundbreaking technologies, leveraging the principles of quantum mechanics to revolutionise the field of remote sensing and target detection. The protocol, particularly in the context of quantum radar, has been subject to a great deal of aspirational conjecture as well as criticism with respect to its realistic potential. In this review, we present a broad overview of the field of quantum target detection focusing on QI and its potential as an underlying scheme for a quantum radar operating at microwave frequencies. We provide context for the field by considering its historical development and fundamental principles. Our aim is to provide a balanced discussion on the state of theoretical and experimental progress towards realising a working QI-based quantum radar, and draw conclusions about its current outlook and future directions.

quant-ph↗

High-Rate 16-node quantum access network based on passive optical network

Quantum key distribution can provide information-theoretical secure communication, which is now heading towards building the quantum secure network for real-world applications. In most built quantum secure networks, point-to-multipoint (PTMP) topology is one of the most popular schemes, especially for quantum access networks. However, due to the lack of custom protocols with high secret key rate and compatible with classical optical networks for PTMP scheme, there is still no efficient way for a high-performance quantum access network with a multitude of users. Here, we report an experimental demonstration of a high-rate 16-nodes quantum access network based on passive optical network, where a high-efficient coherent-state PTMP protocol is novelly designed to allow independent secret key generation between one transmitter and multiple receivers concurrently. Such accomplishment is attributed to a well-designed real-time shot-noise calibration method, a series of advanced digital signal processing algorithms and a flexible post-processing strategy with high success probability. Finally, the experimental results show that the average secret key rate is around 2.086 Mbps between the transmitter and each user, which is two orders of magnitude higher than previous demonstrations. With the advantages of low cost, excellent compatibility, and wide bandwidth, our work paves the way for building practical PTMP quantum access networks, thus constituting an important step towards scalable quantum secure networks.

quant-ph↗

Holographic Limitations and Corrections to Quantum Information Protocols

We discuss the limitations imposed on entanglement distribution, quantum teleportation, and quantum communication by holographic bounds, such as the Bekenstein bound and Susskind's spherical entropy bound. For continuous-variable (CV) quantum information, we show how the naive application of holographic corrections disrupts well-established results. These corrections render perfect CV teleportation impossible, preclude uniform convergence in the teleportation simulation of lossy quantum channels, and impose a revised PLOB bound for quantum communication. While these mathematical corrections do not immediately impact practical quantum technologies, they are critical for a deeper theoretical understanding of quantum information theory.

quant-ph↗

Continuous variable port-based teleportation

Port-based teleportation is generalization of the standard teleportation protocol which does not require unitary operations by the receiver. This comes at the price of requiring $N>1$ entangled pairs, while $N=1$ for the standard teleportation protocol. The lack of correction unitaries allows port-based teleportation to be used as a fundamental theoretical tool to simulate arbitrary channels with a general resource, with applications to study fundamental limits of quantum communication, cryptography and sensing, and to define general programmable quantum computers. Here we introduce a general formulation of port-based teleportation in continuous variable systems and study in detail the $N=2$ case. In particular, we interpret the resulting channel as an energy truncation and analyse the kinds of channels that can be naturally simulated after this restriction.

quant-ph↗

Analytical bounds for non-asymptotic asymmetric state discrimination

Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding the set of achievable errors, using the trace norm, the fidelity, and the quantum Chernoff bound. The upper bound is asymptotically tight and the lower bound is exact for pure states. Unlike asymptotic bounds, our bounds give error values instead of exponents, so can give more precise results when applied to finite-copy state discrimination problems.

quant-ph↗

Quantum-enhanced cluster detection in physical images

Identifying clusters in data is an important task in many fields. In this paper, we consider situations in which data live in a physical world, so we have to first collect the images using sensors before clustering them. Using sensors enhanced by quantum entanglement, we can image surfaces more accurately than using purely classical strategies. However, it is not immediately obvious if the advantage we gain is robust enough to survive data processing steps such as clustering. It has previously been found that using quantum-enhanced sensors for imaging and pattern recognition can give an advantage for supervised learning tasks, and here we demonstrate that this advantage also holds for an unsupervised learning task, namely clustering.

quant-ph↗

Satellite-Based Quantum Key Distribution in the Presence of Bypass Channels

The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed. We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted signal by Alice, and/or Bob's receiver station. This restriction is modeled by lossy channels between Alice/Bob and Eve, where the transmissivity of such channels can, in principle, be bounded by monitoring techniques. An artefact of such lossy channels is the possibility of having {\it bypass} channels, those which are not accessible to Eve, but may not necessarily be characterized by the users either. This creates interesting, unexplored, scenarios for analyzing QKD security. In this paper, we obtain generic bounds on the key rate in the presence of bypass channels and apply them to continuous-variable QKD protocols with Gaussian encoding with direct and reverse reconciliation. We find regimes of operation in which the above restrictions on Eve can considerably improve system performance. We also develop customised bounds for several protocols in the BB84 family and show that, in certain regimes, even the simple protocol of BB84 with weak coherent pulses is able to offer positive key rates at high channel losses, which would otherwise be impossible under an unrestricted Eve. In this case the limitation on Eve would allow Alice to send signals with larger intensities than the optimal value under an ideal Eve, which effectively reduces the effective channel loss. In all these cases, the part of the transmitted signal that does not reach Eve can play a non-trivial role in specifying the achievable key rate. Our work opens up new security frameworks for spaceborne quantum communications systems.

quant-ph↗

Scalable authentication and optimal flooding in a quantum network

The global interest in quantum networks stems from the security guaranteed by the laws of physics. Deploying quantum networks means facing the challenges of scaling up the physical hardware and, more importantly, of scaling up all other network layers and optimally utilising network resources. Here we consider two related protocols, their experimental demonstrations on an 8-user quantum network test-bed, and discuss their usefulness with the aid of example use cases. First, an authentication transfer protocol to manage a fundamental limitation of quantum communication -- the need for a pre-shared key between every pair of users linked together on the quantum network. By temporarily trusting some intermediary nodes for a short period of time (<35 min in our network), we can generate and distribute these initial authentication keys with a very high level of security. Second, when end users quantify their trust in intermediary nodes, our flooding protocol can be used to improve both end-to-end communication speeds and increase security against malicious nodes.

quant-ph↗

Quantum-enhanced pattern recognition

The challenge of pattern recognition is to invoke a strategy that can accurately extract features of a dataset and classify its samples. In realistic scenarios this dataset may be a physical system from which we want to retrieve information, such as in the readout of optical classical memories. The theoretical and experimental development of quantum reading has demonstrated that the readout of optical memories can be dramatically enhanced through the use of quantum resources (namely entangled input-states) over that of the best classical strategies. However, the practicality of this quantum advantage hinges upon the scalability of quantum reading, and up to now its experimental demonstration has been limited to individual cells. In this work, we demonstrate for the first time quantum advantage in the multi-cell problem of pattern recognition. Through experimental realizations of digits from the MNIST handwritten digit dataset, and the application of advanced classical post-processing, we report the use of entangled probe states and photon-counting to achieve quantum advantage in classification error over that achieved with classical resources, confirming that the advantage gained through quantum sensors can be sustained throughout pattern recognition and complex post-processing. This motivates future developments of quantum-enhanced pattern recognition of bosonic-loss within complex domains.

quant-ph↗

Satellite-based entanglement distribution and quantum teleportation with continuous variables

Advances in satellite quantum communications aim at reshaping the global telecommunication network by increasing the security of the transferred information. Here, we study the effects of atmospheric turbulence in continuous-variable entanglement distribution and quantum teleportation in the optical regime between a ground station and a satellite. More specifically, we study the degradation of entanglement due to various error sources in the distribution, namely, diffraction, atmospheric attenuation, turbulence, and detector inefficiency, in both downlink and uplink scenarios. As the fidelity of a quantum teleportation protocol using these distributed entangled resources is not sufficient, we include an intermediate station for either state generation, or beam refocusing, in order to reduce the effects of atmospheric turbulence and diffraction, respectively. The results show the feasibility of free-space entanglement distribution and quantum teleportation in downlink paths up to the LEO region, but also in uplink paths with the help of the intermediate station. Finally, we complete the study with microwave-optical comparison in bad weather situations, and with the study of horizontal paths in ground-to-ground and inter-satellite quantum communication.

quant-ph↗

Millimetre-waves to Terahertz SISO and MIMO Continuous Variable Quantum Key Distribution

With the exponentially increased demands for large bandwidth, it is important to think about the best network platform as well as the security and privacy of the information in communication networks. Millimetre (mm)-waves and terahertz (THz) with high carrier frequency are proposed as the enabling technologies to overcome Shannons channel capacity limit of existing communication systems by providing ultrawide bandwidth signals. Mm-waves and THz are also able to build wireless links compatible with optical communication systems. However, most solid-state components that can operate reasonably efficiently at these frequency ranges (100GHz-10THz), especially sources and detectors, require cryogenic cooling, as is a requirement for most quantum systems. Here, we show that secure mm-waves and THz QKD can be achieved when the sources and detectors operate at cryogenic temperatures down to T= 4K. We compare single-input single-output (SISO) and multiple-input multiple-output (MIMO) Continuous Variable THz Quantum Key Distribution (CVQKD) schemes and find the positive secret key rate in the frequency ranges between f=100 GHz and 1 THz. Moreover, we find that the maximum transmission distance could be extended, the secret key rate could be improved in lower temperatures, and achieve a maximum secrete communication distance of more than 5 km at f=100GHz and T=4K by using 1024*1024 antennas. Our results may contribute to the efforts to develop next-generation secure wireless communication systems and quantum internet for applications from inter-satellite and deep space, to indoor and short-distance communications.

quant-ph↗

Continuous-Variable Measurement-Device-Independent Quantum Key Distribution in Free-Space Channels

The field of space communications is the realm of communication technologies where diffraction and atmospheric effects, both of which contribute to loss and noise, become overriding. The pertinent questions here are how and at which rate information (secret keys) can be securely transferred (shared) among users under such supposedly severe circumstances. In the present work we study continuous-variable (CV) quantum key distribution (QKD) in a measurement-device-independent (MDI) configuration over free-space optical (FSO) links. We assess the turbulence regime and provide a composable finite-size key rate analysis of the protocol for FSO links. We study both short-range, horizontal communication links as well as slant paths to, e.g., high-altitude platform station (HAPS) systems.

quant-ph↗

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

quant-ph↗