arXiv subjects

Cosmo Lupo

Publications and source records attributed to Cosmo Lupo.

At least 73 records · Page 4Linked to original sources

arXiv2017

Ultimate Precision of Adaptive Noise Estimation

We consider the estimation of noise parameters in a quantum channel, assuming the most general strategy allowed by quantum mechanics. This is based on the exploitation of unlimited entanglement and arbitrary quantum operations, so that the channel inputs may be interactively updated. In this general scenario we draw a novel connection between quantum metrology and teleportation. In fact, for any teleportation-covariant channel (e.g., Pauli, erasure, or Gaussian channel), we find that adaptive noise estimation cannot beat the standard quantum limit, with the quantum Fisher information being determined by the channel's Choi matrix. As an example, we establish the ultimate precision for estimating excess noise in a thermal-loss channel which is crucial for quantum cryptography. Because our general methodology applies to any functional which is monotonic under trace-preserving maps, it can be applied to simplify other adaptive protocols, including those for quantum channel discrimination. Setting the ultimate limits for noise estimation and discrimination paves the way for exploring the boundaries of quantum sensing, imaging and tomography.

quant-ph↗

arXiv2016

Ultimate precision bound of quantum and sub-wavelength imaging

We determine the ultimate potential of quantum imaging for boosting the resolution of a far-field, diffraction-limited, linear imaging device within the paraxial approximation. First we show that the problem of estimating the separation between two point-like sources is equivalent to the estimation of the loss parameters of two lossy bosonic channels, i.e., the transmissivities of two beam splitters. Using this representation, we establish the ultimate precision bound for resolving two point-like sources in an arbitrary quantum state, with a simple formula for the specific case of two thermal sources. We find that the precision bound scales with the number of collected photons according to the standard quantum limit. Then we determine the sources whose separation can be estimated optimally, finding that quantum-correlated sources (entangled or discordant) can be super-resolved at the sub-Rayleigh scale. Our results set the upper bounds on any present or future imaging technology, from astronomical observation to microscopy, which is based on quantum detection as well as source engineering.

quant-ph↗

arXiv2016

A Quantum Enigma Machine: Experimentally Demonstrating Quantum Data Locking

Claude Shannon proved in 1949 that information-theoretic-secure encryption is possible if the encryption key is used only once, is random, and is at least as long as the message itself. Notwithstanding, when information is encoded in a quantum system, the phenomenon of quantum data locking allows one to encrypt a message with a shorter key and still provide information-theoretic security. We present one of the first feasible experimental demonstrations of quantum data locking for direct communication and propose a scheme for a quantum enigma machine that encrypts 6 bits per photon (containing messages, new encryption keys, and forward error correction bits) with less than 6 bits per photon of encryption key while remaining information-theoretically secure.

quant-ph↗

arXiv2016

Quantum data hiding in the presence of noise

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can decode reliably if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We then prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels "mictodiactic"---they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.

quant-ph↗

arXiv2016

Super-Additivity and Entanglement Assistance in Quantum Reading

Quantum information theory determines the maximum rates at which information can be transmitted through physical systems described by quantum mechanics. Here we consider the communication protocol known as quantum reading. Quantum reading is a protocol for retrieving the information stored in a digital memory by using a quantum probe, e.g., shining quantum states of light to read an optical memory. In a variety of situations using a quantum probe enhances the performances of the reading protocol in terms of fidelity, data density and energy dissipation. Here we review and characterize the quantum reading capacity of a memory model, defined as the maximum rate of reliable reading. We show that, like other quantities in quantum information theory, the quantum reading capacity is super-additive. Moreover, we determine conditions under which the use of an entangled ancilla improves the performance of quantum reading.

quant-ph↗

arXiv2015

Continuous-variable quantum enigma machines for long-distance key distribution

Quantum physics allows for unconditionally secure communication through insecure communication channels. The achievable rates of quantum-secured communication are fundamentally limited by the laws of quantum physics and in particular by the properties of entanglement. For a lossy communication line, this implies that the secret-key generation rate vanishes at least exponentially with the communication distance. We show that this fundamental limitation can be violated in a realistic scenario where the eavesdropper can store quantum information for only a finite, yet arbitrarily long, time. We consider communication through a lossy bononic channel (modeling linear loss in optical fibers) and we show that it is in principle possible to achieve a constant rate of key generation of one bit per optical mode over arbitrarily long communication distances.

quant-ph↗

arXiv2015

Nonclassical readout of optical memories under local energy constraint

Nonclassical states of light play a central role in many quantum information protocols. Their quantum features have been exploited to improve the readout of information from digital memories, modelled as arrays of microscopic beam splitters [S. Pirandola, Phys. Rev. Lett. 106, 090504 (2011)]. In this model of "quantum reading", a nonclassical source of light with Einstein-Podolski-Rosen correlations has been proven to retrieve more information than any classical source. In particular, the quantum-classical comparison has been performed under a global energy constraint, i.e., by fixing the mean total number of photons irradiated over each memory cell. In this paper we provide an alternative analysis which is based on a local energy constraint, meaning that we fix the mean number of photons per signal mode irradiated over the memory cell. Under this assumption, we investigate the critical number of signal modes after which a nonclassical source of light is able to beat any classical source irradiating the same number of signals.

quant-ph↗

arXiv2015

Quantum reading under a local energy constraint

Nonclassical states of light play a central role in many quantum information protocols. Their quantum features have been exploited to improve the readout of information from digital memories, modelled as arrays of microscopic beam splitters [S. Pirandola, Phys. Rev. Lett. 106, 090504 (2011)]. In this model of quantum reading, a nonclassical source of light with Einstein-Podolski-Rosen correlations has been proven to retrieve more information than any classical source. In particular, the quantum-classical comparison has been performed under a global energy constraint, i.e., by fixing the mean total number of photons irradiated over each memory cell. In this paper we provide an alternative analysis which is based on a local energy constraint, meaning that we fix the mean number of photons per signal mode irradiated over the memory cell. Under this assumption, we investigate the critical number of signal modes after which a nonclassical source of light is able to beat any classical source irradiating the same number of signals.

quant-ph↗

arXiv2015

Quantum data locking for high-rate private communication

We show that, if the accessible information is used as a security quantifier, quantum channels with a certain symmetry can convey private messages at a tremendously high rate, as high as less than one bit below the rate of non-private classical communication. This result is obtained by exploiting the quantum data locking effect. The price to pay to achieve such a high private communication rate is that accessible information security is in general not composable. However, composable security holds against an eavesdropper who is forced to measure her share of the quantum system within a finite time after she gets it.

quant-ph↗

arXiv2014

Quantum-locked key distribution at nearly the classical capacity rate

Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.

quant-ph↗

arXiv2014

Robust quantum data locking from phase modulation

Quantum data locking is a unique quantum phenomenon that allows a relatively short key to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the encrypted message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the shared key by a proportionate amount. This implies that a constant size key can still encrypt an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random codewords, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.

quant-ph↗

arXiv2014

Theory of filtered type-II PDC in the continuous-variable domain: Quantifying the impacts of filtering

Parametric down-conversion (PDC) forms one of the basic building blocks for quantum optical experiments. However, the intrinsic multimode spectral-temporal structure of pulsed PDC often poses a severe hindrance for the direct implementation of the heralding of pure single-photon states or, for example, continuous-variable entanglement distillation experiments. To get rid of multimode effects narrowband frequency filtering is frequently applied to achieve a single-mode behavior. A rigorous theoretical description to accurately describe the effects of filtering on PDC, however, is still missing. To date, the theoretical models of filtered PDC are rooted in the discrete-variable domain and only account for filtering in the low gain regime, where only a few photon pairs are emitted at any single point in time. In this paper we extend these theoretical descriptions and put forward a simple model, which is able to accurately describe the effects of filtering on PDC in the continuous-variable domain. This developed straightforward theoretical framework enables us to accurately quantify the trade-off between suppression of higher-order modes, reduced purity and lowered Einstein-Podolsky-Rosen (EPR) entanglement, when narrowband filters are applied to multimode type-II PDC.

quant-ph↗

arXiv2014

Quantum brachistochrone curves as geodesics: obtaining accurate control protocols for time-optimal quantum gates

Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here, using differential geometry, we reformulate the quantum brachistochrone curves as geodesics on the unitary group. With this identification we are able to obtain a numerical method that efficiently solves the brachistochrone problem. We apply it to two examples demonstrating its power.

quant-ph↗

arXiv2014

Entanglement Typicality

We provide a summary of both seminal and recent results on typical entanglement. By typical values of entanglement, we refer here to values of entanglement quantifiers that (given a reasonable measure on the manifold of states) appear with arbitrarily high probability for quantum systems of sufficiently high dimensionality. We work within the Haar measure framework for discrete quantum variables, where we report on results concerning the average von Neumann and linear entropies as well as arguments implying the typicality of such values in the asymptotic limit. We then proceed to discuss the generation of typical quantum states with random circuitry. Different phases of entanglement, and the connection between typical entanglement and thermodynamics are discussed. We also cover approaches to measures on the non-compact set of Gaussian states of continuous variable quantum systems.

quant-ph↗

arXiv2014

Maximally strong entropic uncertainty relations and gauge invariance

Uncertainty relations are among the unique fingerprints of quantum physics, being direct expression of non-commutativity and complementarity. Entropic uncertainty relations arise in quantum information theory as the most natural expression of the uncertainty principle and have proven themselves important tools for cryptographic security proofs. An open question has been how strong entropic uncertainty relations can be. Here we answer this question by showing that there exist observables that obey maximally strong entropic uncertainty relations in high dimensional Hilbert spaces. Actually, we show that maximally strong uncertainty relations are typically verified if the observables are distributed somehow uniformly. In particular, we show that phase randomness in a mutually unbiased basis is sufficient, providing a link between uncertainty relations and local gauge invariance. For quantum systems of finite dimensions our approach provides an explicit relation between the strength of the uncertainty and its probability.

quant-ph↗

arXiv2013

Quantum enigma machines and the locking capacity of a quantum channel

The locking effect is a phenomenon which is unique to quantum information theory and represents one of the strongest separations between the classical and quantum theories of information. The Fawzi-Hayden-Sen (FHS) locking protocol harnesses this effect in a cryptographic context, whereby one party can encode n bits into n qubits while using only a constant-size secret key. The encoded message is then secure against any measurement that an eavesdropper could perform in an attempt to recover the message, but the protocol does not necessarily meet the composability requirements needed in quantum key distribution applications. In any case, the locking effect represents an extreme violation of Shannon's classical theorem, which states that information-theoretic security holds in the classical case if and only if the secret key is the same size as the message. Given this intriguing phenomenon, it is of practical interest to study the effect in the presence of noise, which can occur in the systems of both the legitimate receiver and the eavesdropper. This paper formally defines the locking capacity of a quantum channel as the maximum amount of locked information that can be reliably transmitted to a legitimate receiver by exploiting many independent uses of a quantum channel and an amount of secret key sublinear in the number of channel uses. We provide general operational bounds on the locking capacity in terms of other well-known capacities from quantum Shannon theory. We also study the important case of bosonic channels, finding limitations on these channels' locking capacity when coherent-state encodings are employed and particular locking protocols for these channels that might be physically implementable.

quant-ph↗

arXiv2013

Noise to lubricate qubit transfer in a spin network

We consider quantum state transfer in a fully connected spin network, in which the results indicate that it is impossible to achieve high fidelity by free dynamics. However, the addition of certain kinds of noise can be helpful for this purpose. In fact, we introduce a model of Gaussian white noise affecting the spin-spin couplings (edges), except those linked to the input and output node, and prove that it enhances the fidelity of state transfer. The observed noise benefit is scale free as it applies to a quantum network of any size. The amount of the fidelity enhancement, depending on the noise strength as well as on the number of edges to which it is applied, can be so high as to take the fidelity close to one.

quant-ph↗

arXiv2013

Quantum reading capacity under thermal and correlated noise

Quantum communication theory sets the maximum rates at which information can be encoded and decoded reliably given the physical properties of the information carriers. Here we consider the problem of readout of a digital optical memory, where information is stored by means of the optical properties of the memory cells that are in turn probed by shining a laser beam on them. Interesting features arise in the regime in which the probing light has to be treated quantum mechanically. The maximum rate of reliable readout defines the quantum reading capacity, which is proven to overcome the classical reading capacity, obtained by probing with classical light, in several relevant settings. We consider a model of optical memory in which information is encoded in the (complex-valued) attenuation factor and study the effects on the reading rates of thermal and correlated noise. The latter type of noise arises when the effects of wave diffraction on the probing light beam are taken into account. We discuss the advantages of quantum reading over the classical one and show that the former is substantially more robust than the latter under thermal noise in the regime of low power per pulse.

quant-ph↗