arXiv subjects

Stefano Pirandola

Publications and source records attributed to Stefano Pirandola.

At least 55 records · Page 3Linked to original sources

arXiv2022

Data post-processing for the one-way heterodyne protocol under composable finite-size security

The performance of a practical continuous-variable (CV) quantum key distribution (QKD) protocol depends significantly, apart from the loss and noise of the quantum channel, on the post-processing steps which lead to the extraction of the final secret key. A critical step is the reconciliation process, especially when one assumes finite-size effects in a composable framework. Here, we focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. We simulate the quantum communication process and we post-process the output data by applying parameter estimation, error correction (using high-rate, non-binary low-density parity-check codes), and privacy amplification. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above. We also present an associated Python library performing the steps above.

quant-ph↗

arXiv2022

Composable end-to-end security of Gaussian quantum networks with untrusted relays

Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.

quant-ph↗

arXiv2022

End-to-End Capacities of Imperfect-Repeater Quantum Networks

The optimal performance of a communication network is limited not only by the quality of point-to-point channels, but by the efficacy of its constituent technologies. Understanding the limits of quantum networks requires an understanding of both the ultimate capacities of quantum channels and the efficiency of imperfect quantum repeaters. In this work, using a recently developed node-splitting technique which introduces internal losses and noise into repeater devices, we present achievable end-to-end rates for noisy-repeater quantum networks. These are obtained by extending the coherent and reverse coherent information (single channel capacity lower bounds) into end-to-end capacity lower bounds, both in the context of single-path and multi-path routing. These achievable rates are completely general, and apply to networks composed of arbitrary channels arranged in general topologies. Through this general formalism, we show how tight upper-bounds can also be derived by supplementing appropriate single-edge capacity bounds. As a result, we develop tools which provide tight performance bounds for quantum networks constituent of channels whose capacities are not exactly known, and reveal critical network properties which are necessary for high-rate quantum communications. This permits the investigation of pertinent classes of quantum networks with realistic technologies; qubit amplitude damping networks and bosonic thermal-loss networks.

quant-ph↗

arXiv2022

End-to-End Capacities of Hybrid Quantum Networks

Future quantum networks will be hybrid structures, constructed from complex architectures of quantum repeaters interconnected by quantum channels that describe a variety of physical domains; predominantly optical-fiber and free-space links. In this hybrid setting, the interplay between the channel quality within network sub-structures must be carefully considered, and is pivotal for ensuring high-rate end-to-end quantum communication. In this work, we combine recent advances in the theory of point-to-point free-space channel capacities and end-to-end quantum network capacities in order to develop critical tools for the study of hybrid, free-space quantum networks. We present a general formalism for studying the capacities of arbitrary, hybrid quantum networks, before specifying to the regime of atmospheric and space-based quantum channels. We then introduce a class of modular quantum network architectures which offer a realistic and readily analysable framework for hybrid quantum networks. By considering a physically motivated, highly connected modular structure we are able to idealize network performance and derive channel conditions for which optimal performance is guaranteed. This allows us to reveal vital properties for which distance-independent rates are achieved, so that the end-to-end capacity has no dependence on the physical separation between users. Our analytical method elucidates key infrastructure demands for a future satellite-based global quantum internet, and for hybrid wired/wireless metropolitan quantum networks.

quant-ph↗

arXiv2022

Noiseless linear amplification in quantum target detection using Gaussian states

Quantum target detection aims to utilise quantum technologies to achieve performances in target detection not possible through purely classical means. Quantum illumination is an example of this, based on signal-idler entanglement, promising a potential 6 dB advantage in error exponent over its optimal classical counterpart. So far, receiver designs achieving this optimal reception remain elusive with many proposals based on Gaussian processes appearing unable to utilise quantum information contained within Gaussian state sources. This paper considers the employment of a noiseless linear amplifier at the detection stage of a quantum illumination-based quantum target detection protocol. Such a non-Gaussian amplifier offers a means of probabilistically amplifying an incoming signal without the addition of noise. Considering symmetric hypothesis testing, the quantum Chernoff bound is derived and limits on detection error probability is analysed for both the two-mode squeezed vacuum state and the coherent state classical benchmark. Our findings show that in such a scheme the potential quantum advantage is amplified even in regimes where quantum illumination alone offers no advantage, thereby extending its potential use. The same cannot be said for coherent states, whose performances are generally bounded by that without amplification.

quant-ph↗

arXiv2022

Continuous-variable measurement device independent quantum conferencing with post-selection

A continuous variable (CV), measurement device independent (MDI) quantum key distribution (QKD) protocol is analyzed, enabling three parties to connect for quantum conferencing. We utilise a generalised Bell detection at an untrusted relay and a postselection procedure, in which distant parties reconcile on the signs of the displacements of the quadratures of their prepared coherent states. We derive the rate of the protocol under a collective pure-loss attack, demonstrating improved rate-distance performance compared to the equivalent non-post-selected protocol. In the symmetric configuration in which all the parties lie the same distance from the relay, we find a positive key rate over 6 km. Such postselection techniques can be used to improve the rate of multi-party quantum conferencing protocols at longer distances at the cost of reduced performance at shorter distances.

quant-ph↗

arXiv2022

Rate limits in quantum networks with lossy repeaters

The derivation of ultimate limits to communication over certain quantum repeater networks have provided extremely valuable benchmarks for assessing near-term quantum communication protocols. However, these bounds are usually derived in the limit of ideal devices and leave questions about the performance of practical implementations unanswered. To address this challenge, we quantify how the presence of loss in repeater stations affect the maximum attainable rates for quantum communication over linear repeater chains and more complex quantum networks. Extending the framework of node splitting, we model the loss introduced at the repeater stations and then prove the corresponding limits. In the linear chain scenario we show that, by increasing the number of repeater stations, the maximum rate cannot overcome a quantity which solely depends on the loss of a single station. We introduce a way of adapting the standard machinery for obtaining bounds to this realistic scenario. The difference is that whilst ultimate limits for any strategy can be derived given a fixed channel, when the repeaters introduce additional decoherence, then the effective overall channel is itself a function of the chosen repeater strategy (e.g., one-way versus two-way classical communication). Classes of repeater strategies can be analysed using additional modelling and the subsequent bounds can be interpreted as the optimal rate within that class.

quant-ph↗

arXiv2022

Composable security for continuous variable quantum key distribution: Trust levels and practical key rates in wired and wireless networks

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 much higher rates than the standard discrete-variable counterpart. In this work, we provide a general framework for studying the composable finite-size security of CV-QKD with Gaussian-modulated coherent-state protocols under various levels of trust for the loss and noise experienced by the parties. Our study considers both wired (i.e., fiber-based) and wireless (i.e., free-space) quantum communications. In the latter case, we show that high key rates are achievable for short-range optical wireless (LiFi) in secure quantum networks with both fixed and mobile devices. Finally, we extend our investigation to microwave wireless (WiFi) discussing security and feasibility of CV-QKD for very short-range applications.

quant-ph↗

arXiv2022

Quantum communications in a moderate-to-strong turbulent space

Since the invention of the laser in the 60s, one of the most fundamental communication channels has been the free-space optical channel. For this type of channel, a number of effects generally need to be considered, including diffraction, refraction, atmospheric extinction, pointing errors and, most importantly, turbulence. Because of all these adverse features, the free-space optical (FSO) channel is more difficult to study than a stable fiber-based link. For the same reasons, only recently it has been possible to establish the ultimate performances achievable in quantum communications via free-space channels, together with practical rates for continuous variable (CV) quantum key distribution (QKD). Differently from previous literature, mainly focused on the regime of weak turbulence, this work considers the FSO channel in the more challenging regime of moderate-to-strong turbulence, where effects of beam widening and breaking are more important than beam wandering. This regime may occur in long-distance free-space links on the ground, in uplink to high-altitude platform systems (HAPS) and, more interestingly, in downlink from near-horizon satellites. In such a regime we rigorously investigate ultimate limits for quantum communications and show that composable keys can be extracted using CV-QKD.

quant-ph↗

arXiv2022

Analytical Methods for High-Rate Global Quantum Networks

The development of a future, global quantum communication network (or quantum internet) will enable high rate private communication and entanglement distribution over very long distances. However, the large-scale performance of ground-based quantum networks (which employ photons as information carriers through optical-fibres) is fundamentally limited by fibre quality and link length, with the latter being a primary design factor for practical network architectures. While these fundamental limits are well established for arbitrary network topologies, the question of how to best design global architectures remains open. In this work, we introduce a large-scale quantum network model called weakly-regular architectures. Such networks are capable of idealising network connectivity, provide freedom to capture a broad class of spatial topologies and remain analytically treatable. This allows us to investigate the effectiveness of large-scale networks with consistent connective properties, and unveil critical conditions under which end-to-end rates remain optimal. Furthermore, through a strict performance comparison of ideal, ground-based quantum networks with that of realistic satellite quantum communication protocols, we establish conditions for which satellites can be used to outperform fibre-based quantum infrastructure; {rigorously proving the efficacy of satellite-based technologies for global quantum communications.

quant-ph↗

arXiv2022

Secure Quantum Pattern Communication

We propose a multi-mode modulation scheme for Continuous Variable (CV) quantum communications, which we call quantum pattern encoding. In this setting, classical information can be encoded into multi-mode patterns of discretely-modulated coherent states, which form instances of a communicable image space. Communicators can devise arbitrarily complex encoding schemes which are degenerate and highly non-uniform, such that communication is likened to the task of pattern recognition. We explore initial communication schemes that exploit these techniques, and which lead to an increased encoding complexity. We discuss the impact that this has on the role of a near-term quantum eavesdropper; formulating new, realistic classes of attacks and secure communication rates.

quant-ph↗

arXiv2022

Quantum channel position finding using single photons

Channel position finding is the task of determining the location of a single target channel amongst an ensemble of background channels. It has many potential applications, including quantum sensing, quantum reading and quantum spectroscopy. In particular, it could allow for simple detection protocols to be extended to ones of measurement, for example, target ranging with quantum illumination. The use of quantum states and entanglement in such protocols have shown to yield quantum advantages over their optimal classical counterparts. Here we consider quantum channel position finding using sources specified by at most one single photon on average per mode, using the discrete variable formalism. By considering various quantum sources it is shown through the derivation of performance bounds that a quantum enhancement may be realised.

quant-ph↗

arXiv2021

Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution

Continuous-variable (CV) quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties, and this is usually achieved via a Gaussian modulation of coherent states. The resulting secret key rate depends not only on the loss and noise in the communication channel, but also on a series of data processing steps that are needed for transforming shared correlations into a final string of secret bits. Here we consider a Gaussian-modulated coherent-state protocol with homodyne detection in the general setting of composable finite-size security. After simulating the process of quantum communication, the output classical data is post-processed via procedures of parameter estimation, error correction, and privacy amplification. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes. We implement all these steps in a Python-based library that allows one to investigate and optimize the protocol parameters to be used in practical experimental implementations of short-range CV-QKD.

quant-ph↗

arXiv2021

Optimal squeezing for quantum target detection

It is not clear if the performance of a quantum lidar or radar, without an idler and only using Gaussian resources, could exceed the performance of a semiclassical setup based on coherent states and homodyne detection. Here we prove this is indeed the case by showing that an idler-free squeezed-based setup can beat this semiclassical benchmark. More generally, we show that probes whose displacement and squeezing are jointly optimized can strictly outperform coherent states with the same mean number of input photons for both the problems of quantum illumination and reading.

quant-ph↗

arXiv2021

Symplectic decomposition from submatrix determinants

An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Whilst the diagonal form is easy to find, the process for finding the diagonalising symplectic can be more difficult, and a common, existing method requires taking matrix powers, which can be demanding analytically. Inspired by a recently presented technique for finding the eigenvectors of a Hermitian matrix from certain submatrix eigenvalues, we derive a similar method for finding the diagonalising symplectic from certain submatrix determinants, which could prove useful in Gaussian quantum information.

math-ph↗

arXiv2021

Practical continuous-variable quantum key distribution with composable security

A quantum key distribution (QKD) system must fulfill the requirement of universal composability to ensure that any cryptographic application (using the QKD system) is also secure. Furthermore, the theoretical proof responsible for security analysis and key generation should cater to the number $N$ of the distributed quantum states being finite in practice. Continuous-variable (CV) QKD based on coherent states, despite being a suitable candidate for integration in the telecom infrastructure, has so far been unable to demonstrate composability as existing proofs require a rather large $N$ for successful key generation. Here we report the first Gaussian-modulated coherent state CVQKD system that is able to overcome these challenges and can generate composable keys secure against collective attacks with $N \lesssim 3.5\times10^8$ coherent states. With this advance, possible due to novel improvements to the security proof and a fast, yet low-noise and highly stable system operation, CVQKD implementations take a significant step towards their discrete-variable counterparts in practicality, performance, and security.

quant-ph↗

arXiv2021

Bounding the benefit of adaptivity in quantum metrology using the relative fidelity

Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. This can make it difficult to bound the best possible performance for such protocols. In this paper, we introduce a quantity that we call the relative fidelity of a given pair of channels and a pair of input states to those channels. Constraining the allowed input states to all pairs of states whose fidelity is greater than some minimum "input fidelity" and minimising this quantity over the valid pairs of states, we get the minimum relative fidelity for that input fidelity constraint. We are then able to lower bound the fidelity between the possible output states of any protocol acting on one of two possible channels in terms of the minimum relative fidelity. This allows us to bound the performance of the most general, adaptive discrimination and parameter estimation protocols. By finding a continuity bound for the relative fidelity, we also provide a simple confirmation that the quantum Fisher information (QFI) of the output of an $N$-use protocol is no more than $N^2$ times the one-shot QFI.

quant-ph↗

arXiv2021

Idler-Free Multi-Channel Discrimination via Multipartite Probe States

The characterisation of Quantum Channel Discrimination (QCD) offers critical insight for future quantum technologies in quantum metrology, sensing and communications. The task of multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition, highly relevant to the tasks of quantum reading, illumination and more. Whilst the optimal quantum strategy for many scenarios is an entangled idler-assisted protocol, the extension to a multi-hypothesis setting invites the exploration of discrimination strategies based on unassisted, multipartite probe states. In this work, we expand the space of possible quantum enhanced protocols by formulating general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes. Developing a general framework for idler-free protocols, we perform an explicit investigation in the bosonic setting, studying prominent Gaussian channel discrimination problems for real world applications. Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise. This circumvents the necessity for idler assistance to achieve quantum advantage in some of the most relevant discrimination settings, significantly loosening practical requirements for prominent quantum sensing applications.

quant-ph↗