arXiv subjects

Cosmo Lupo

Publications and source records attributed to Cosmo Lupo.

At least 55 records · Page 3Linked to original sources

arXiv2021

Fault tolerant quantum data locking

Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we present a quantum data locking protocol that employs pseudo-random circuits consisting of Clifford gates only, which are much easier to implement fault tolerantly than universal gates. We show that information can be encrypted into $n$-qubit code words using order $n - H_\mathrm{min}(\mathsf{X})$ secret bits, where $H_\mathrm{min}(\mathsf{X})$ is the min-entropy of the plain text, and a min-entropy smaller than $n$ accounts for information leakage to the adversary. As an application, we discuss an efficient method for encrypting the output of a quantum computer.

quant-ph↗

arXiv2021

Photonic quantum data locking

Quantum data locking is a quantum phenomenon that allows us to encrypt a long message with a small secret key with information-theoretic security. This is in sharp contrast with classical information theory where, according to Shannon, the secret key needs to be at least as long as the message. Here we explore photonic architectures for quantum data locking, where information is encoded in multi-photon states and processed using multi-mode linear optics and photo-detection, with the goal of extending an initial secret key into a longer one. % The secret key consumption depends on the number of modes and photons employed. In the no-collision limit, where the likelihood of photon bunching is suppressed, the key consumption is shown to be logarithmic in the dimensions of the system. Our protocol can be viewed as an application of the physics of Boson Sampling to quantum cryptography. Experimental realisations are challenging but feasible with state-of-the-art technology, as techniques recently used to demonstrate Boson Sampling can be adapted to our scheme (e.g., Phys. Rev. Lett. 123, 250503, 2019).

quant-ph↗

arXiv2021

The quantum limit to incoherent imaging is achieved by linear interferometry

We solve the general problem of determining, through imaging, the three-dimensional positions of $N$ weak incoherent point-like emitters in an arbitrary spatial configuration. We show that a structured measurement strategy in which a linear interferometer feeds into an array of photo-detectors is always optimal for this estimation problem, in the sense that it saturates the quantum Cramér-Rao bound. We provide a method for the explicit construction of the optimal interferometer. Further explicit results for the quantum Fisher information and the optimal interferometer design that attains it are obtained for the case of one and two incoherent emitters in the paraxial regime. This work provides insights into the phenomenon of super-resolution through incoherent imaging that has attracted much attention recently. Our results will find a wide range of applications over a broad spectrum of frequencies, from fluorescence microscopy to stellar interferometry.

quant-ph↗

arXiv2021

Quantum receiver for phase-shift keying at the single photon level

Quantum enhanced receivers are endowed with resources to achieve higher sensitivities than conventional technologies. For application in optical communications, they provide improved discriminatory capabilities for multiple non-orthogonal quantum states. In this work, we propose and experimentally demonstrate a new decoding scheme for quadrature phase-shift encoded signals. Our receiver surpasses the standard quantum limit and outperforms all previously known non-adaptive detectors at low input powers. Unlike existing approaches, the receiver only exploits linear optical elements and on-off photo-detection. This circumvents the requirement for challenging feed-forward operations that limit communication transmission rates and can be readily implemented with current technology.

quant-ph↗

arXiv2020

Experimental implementation of secure anonymous protocols on an eight-user quantum network

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here we experimentally demonstrate 5 information-theoretically secure anonymity protocols on an 8 user city-wide quantum network using polarisation-entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping her identity anonymous. For a network of $n$ users, the protocols retain anonymity for the sender, given less than $n-2$ users are dishonest. This is one of the earliest implementations of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

quant-ph↗

arXiv2020

Quantum-limited estimation of range and velocity

The energy-time uncertainty relation puts a fundamental limit on the precision of radars and lidars for the estimation of range and velocity. The precision in the estimation of the range (through the time of arrival) and the velocity (through Doppler frequency shifts) of a target are inversely related to each other, and dictated by the bandwidth of the signal. Here we use the theoretical toolbox of multi-parameter quantum metrology to determine the ultimate precision of the simultaneous estimation of range and velocity. We consider the case of a single target as well as a pair of closely separated targets. In the latter case, we focus on the relative position and velocity. We show that the trade-off between the estimation precision of position and velocity is relaxed for entangled probe states, and is completely lifted in the limit of infinite entanglement. In the regime where the two targets are close to each other, the relative position and velocity can be estimated nearly optimally and jointly, even without entanglement, using the measurements determined by the symmetric logarithmic derivatives.

quant-ph↗

arXiv2020

Towards practical security of continuous-variable quantum key distribution

Rigorous mathematical proofs of the security of continuous-variable quantum key distribution (CV QKD) have been obtained recently. Unfortunately, these security proofs rely on assumptions that are hardly met in experimental practice. Here I investigate these issues in detail, and discuss experimentally-friendly workarounds to assess the security of CV QKD. The aim of this paper is to show that there are hidden and unsolved issues and to indicate possible partial solutions. To provide a complete and rigorous mathematical security proof is out of the scope of this contribution.

quant-ph↗

arXiv2020

Modular network for high-rate quantum conferencing

One of the main open problems in quantum communication is the design of efficient quantum-secured networks. This is a challenging goal, because it requires protocols that guarantee both unconditional security and high communication rates, while increasing the number of users. In this scenario, continuous-variable systems provide an ideal platform where high rates can be achieved by using off-the-shelf optical components. At the same time, the measurement-device independent architecture is also appealing for its feature of removing a substantial portion of practical weaknesses. Driven by these ideas, here we introduce a modular design of continuous-variable network where each individual module is a measurement-device-independent star network. In each module, the users send modulated coherent states to an untrusted relay, creating multipartite secret correlations via a generalized Bell detection. Using one-time pad between different modules, the network users may share a quantum-secure conference key over arbitrary distances at constant rate.

quant-ph↗

arXiv2020

Ultra-fast real-time quantum random number generator with correlated measurement outcomes and rigorous security certification

Quantum random number generators (QRNGs) promise perfectly unpredictable random numbers. However, the security certification of the random numbers in form of a stochastic model often introduces assumptions that are either hardly justified or indeed unnecessary. Two important examples are the restriction of an adversary to the classical regime as well as negligible correlations between consecutive measurement outcomes. Additionally, non-rigorous system characterization opens a security loophole. In this work we experimentally realize a QRNG that does not rely on the aforementioned assumptions and whose stochastic model is established by a rigorous -- metrological -- approach. Based on quadrature measurements of vacuum fluctuations, we demonstrate a real-time random number generation rate of 8 \,GBit/s. Our security certification approach offers a number of practical benefits and will therefore find widespread applications in quantum random number generators. In particular, our generated random numbers are well suited for today's conventional and quantum cryptographic solutions.

quant-ph↗

arXiv2020

Subwavelength quantum imaging with noisy detectors

It has been recently shown that an interferometric measurement may allow for sub-wavelength resolution of incoherent light. Whereas this holds for noiseless detectors, one could expect that the resolution is in practice limited by signal-to-noise ratio. Here I present an assessment of the ultimate resolution limits that can be achieved using noisy detectors. My analysis indeed indicates that the signal-to-noise ratio represents a fundamental limit to quantum imaging, and the reduced resolution scales with the square root of the signal-to-noise ratio. For example, a signal-to-ratio of $20 dB$ is needed to resolve one order of magnitude below the Rayleigh limit.

quant-ph↗

arXiv2019

Fundamental limits to quantum channel discrimination

What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation stretching. Then, we prove that the minimum error probability affecting the channel discrimination cannot beat a bound determined by the Choi matrices of the channels, establishing a general, yet computable formula for quantum hypothesis testing. As a consequence of this bound, we derive ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution. Finally, we show how the methodology can also be applied to other tasks, such as quantum metrology, quantum communication and secret key generation.

quant-ph↗

arXiv2019

Dense coding capacity of a quantum channel

We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum channel, we define its dense coding capacity by optimizing over all adaptive strategies that Alice can implement, while Bob encodes the information by means of Pauli operators. Exploiting techniques of channel simulation and protocol stretching, we are able to establish the dense coding capacity of Pauli channels in arbitrary finite dimension, with simple formulas for depolarizing and dephasing qubit channels.

quant-ph↗

arXiv2018

Thermal quantum metrology in memoryless and correlated environments

In bosonic quantum metrology, the estimate of a loss parameter is typically performed by means of pure states, such as coherent, squeezed or entangled states, while mixed thermal probes are discarded for their inferior performance. Here we show that thermal sources with suitable correlations can be engineered in such a way to approach, or even surpass, the error scaling of coherent states in the presence of general Gaussian decoherence. Our findings pave the way for practical quantum metrology with thermal sources in optical instruments (e.g., photometers) or at different wavelengths (e.g., far infrared, microwave or X-ray) where the generation of quantum features, such as coherence, squeezing or entanglement, may be extremely challenging.

quant-ph↗

arXiv2018

Continuous-variable measurement-device-independent quantum key distribution: Composable security against coherent attacks

We present a rigorous security analysis of Continuous-Variable Measurement-Device Independent Quantum Key Distribution (CV MDI QKD) in a finite size scenario. The security proof is obtained in two steps: by first assessing the security against collective Gaussian attacks, and then extending to the most general class of coherent attacks via the Gaussian de Finetti reduction. Our result combines recent state-of-the-art security proofs for CV QKD with new findings about min-entropy calculus and parameter estimation. In doing so, we improve the finite-size estimate of the secret key rate. Our conclusions confirm that CV MDI protocols allow for high rates on the metropolitan scale, and may achieve a nonzero secret key rate against the most general class of coherent attacks after 10^7-10^9 quantum signal transmissions, depending on loss and noise, and on the required level of security.

quant-ph↗

arXiv2018

Parameter estimation with almost no public communication for continuous-variable quantum key distribution

One crucial step in any quantum key distribution (QKD) scheme is parameter estimation. In a typical QKD protocol the users have to sacrifice part of their raw data to estimate the parameters of the communication channel as, for example, the error rate. This introduces a tradeoff between the secret key rate and the accuracy of parameter estimation in the finite-size regime. Here we show that continuous-variable (CV) QKD is not subject to this constraint as the whole raw keys can be used for both parameter estimation and secret key generation, without compromising the security. First we show that this property holds for measurement-device independent (MDI) protocols, as a consequence of the fact that in an MDI protocol the correlations between Alice and Bob are post-selected by the measurement performed by an untrusted relay. This result is then extended beyond the MDI framework by exploiting the fact that MDI protocols can simulate device-dependent one-way QKD with arbitrarily high precision.

quant-ph↗

arXiv2018

Channel Simulation in Quantum Metrology

In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels, we may express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.

quant-ph↗

arXiv2018

Quantum key distribution with phase-encoded coherent states: Asymptotic security analysis in thermal-loss channels

We consider discrete-alphabet encoding schemes for coherent-state quantum key distribution. The sender encodes the letters of a finite-size alphabet into coherent states whose amplitudes are symmetrically distributed on a circle centered in the origin of the phase space. We study the asymptotic performance of this phase-encoded coherent-state protocol in direct and reverse reconciliation assuming both loss and thermal noise in the communication channel. In particular, we show that using just four phase-shifted coherent states is sufficient for generating secret key rates of the order of $4 \times 10^{-3}$ bits per channel use at about 15 dB loss in the presence of realistic excess noise.

quant-ph↗

arXiv2017

Multipartite Entanglement Swapping and Mechanical Cluster States

We present a protocol for generating multipartite quantum correlations across a quantum network with a continuous-variable architecture. An arbitrary number of users possess two-mode entangled states, keeping one mode while sending the other to a central relay. Here a suitable multipartite Bell detection is performed which conditionally generates a cluster state on the retained modes. This cluster state can be suitably manipulated by the parties and used for tasks of quantum communication in a fully optical scenario. More interestingly, the protocol can be used to create a purely-mechanical cluster state starting from a supply of optomechanical systems. We show that detecting the optical parts of optomechanical cavities may efficiently swap entanglement into their mechanical modes, creating cluster states up to 5 modes under suitable cryogenic conditions.

quant-ph↗