Search

Spectroscopy is an important tool for probing the properties of materials, chemicals and biological samples. We design a practical transmitter-receiver system that exploits entanglement to achieve a provable quantum advantage over all spectroscopic schemes based on classical sources. To probe the absorption spectra, modelled as pattern of transmissivities among different frequency modes, we employ broad-band signal-idler pairs in two-mode squeezed vacuum states. At the receiver side, we apply photodetection after optical parametric amplification. Finally, we perform a maximal-likehihood decision test on the measurement results, achieving orders-of-magnitude-lower error probability than the optimum classical systems in various examples, including `wine-tasting' and `drug-testing' where real molecules are considered. In detecting the presence of an absorption line, our quantum scheme achieves the optimum performance allowed by quantum mechanics. The quantum advantage in our system is robust against noise and loss, which makes near-term experimental demonstration possible., Comment: 6+16 pages, 6+13 figures, accepted by Phys. Rev. Lett

Quantum channels model many physical processes. For this reason, hypothesis testing between quantum channels is a fundamental task in quantum information theory. Here we consider the paradigmatic case of channel position finding, where the aim is to determine the position of a target quantum channel within a sequence of background channels. We explore this model in the setting of bosonic systems, considering Gaussian channels with the same transmissivity (or gain) but different levels of environmental noise. Thus the goal of the problem becomes detecting the position of a target environment among a number of identical background environments, all acting on an input multi-mode system. We derive bounds for the ultimate error probability affecting this multi-ary discrimination problem and find an analytic condition for quantum advantage over protocols involving classical input states. We also design an explicit protocol that gives numerical bounds on the ultimate error probability and often achieves quantum advantage. Finally, we consider direct applications of the model for tasks of thermal imaging (finding a warmer pixel in a colder background) and quantum communication (for localizing a different level of noise in a sequence of lines or a frequency spectrum)., Comment: 11 pages, 7 figures. Similar to published version

Amplitude damping (AD) channels are good models for many physical scenarios, and so the development of protocols to discriminate between them is an important task in quantum information science. It is therefore important to bound the performance of such protocols. Since adaptivity has been shown to improve the performance of discrimination protocols, bounds on the distinguishability of AD channels must take this into account. In this paper, we use both channel simulation and a bound based on the diamond norm to significantly tighten the upper bound on the trace norm between the possible outputs of binary channel discrimination protocols acting on AD channels (and hence the lower bound on the error probability of such protocols). The diamond norm between any two AD channels is found analytically, giving the optimal error probability for a one-shot discrimination protocol. We also present a tighter lower bound on the achievable trace norm between protocol outputs (and a corresponding upper bound on the achievable error probability). The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios., Comment: 15 pages, 7 figures. Similar to published version

Quantum hypothesis testing has been greatly advanced for the binary discrimination of two states, or two channels. In this setting, we already know that quantum entanglement can be used to enhance the discrimination of two bosonic channels. Here, we remove the restriction of binary hypotheses and show that entangled photons can remarkably boost the discrimination of multiple bosonic channels. More precisely, we formulate a general problem of channel-position finding where the goal is to determine the position of a target channel among many background channels. We prove that, using entangled photons at the input and a generalized form of conditional nulling receiver at the output, we may outperform any classical strategy. Our results can be applied to enhance a range of technological tasks, including the optical readout of sparse classical data, the spectroscopic analysis of a frequency spectrum, and the determination of the direction of a target at fixed range., Comment: 8+5+4 pages,4 figures. Published version with typos corrected

Quantum hypothesis testing is a central task in the entire field of quantum information theory. Understanding its ultimate limits will give insight into a wide range of quantum protocols and applications, from sensing to communication. Although the limits of hypothesis testing between quantum states have been completely clarified by the pioneering works of Helstrom in the 70s, the more difficult problem of hypothesis testing with quantum channels, i.e., channel discrimination, is less understood. This is mainly due to the complications coming from the use of input entanglement and the possibility of employing adaptive strategies. In this paper, we establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries. As an example, we apply our results to the problem of channel position finding, where the goal is to identify the location of a target channel among multiple background channels. In this general setting, we find that the use of entanglement offers a great advantage over strategies without entanglement, with non-trivial implications for data readout, target detection and quantum spectroscopy., Comment: 6+12 pages, 6 figures

In present-day quantum communications, one of the main problems is the lack of a quantum repeater design that can simultaneously secure high rates and long distances. Recent literature has established the end-to-end capacities that are achievable by the most general protocols for quantum and private communication within a quantum network, encompassing the case of a quantum repeater chain. However, whether or not a physical design exists to approach such capacities remains a challenging objective. Driven by this motivation, in this work, we put forward a design for continuous-variable quantum repeaters and show that it can actually achieve the feat. We also show that even in a noisy regime our rates surpass the Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. Our repeater setup is developed upon using noiseless linear amplifiers, quantum memories, and continuous-variable Bell measurements. We, furthermore, propose a non-ideal model for continuous-variable quantum memories that we make use of in our design. We then show that potential quantum communications rates would deviate from the theoretical capacities, as one would expect, if the quantum link is too noisy and/or low-quality quantum memories and amplifiers are employed., Comment: Revised

The field of quantum sensing aims at improving the detection and estimation of classical parameters that are encoded in physical systems by resorting to quantum sources of light and quantum detection strategies. The same approach can be used to improve the current classical measurements that are performed on biological systems. Here we consider the scenario of two bacteria (E. coli and Salmonella) growing in a Luria Bertani broth and monitored by classical spectrophotometers. Their concentration can be related to the optical transmissivity via the Beer-Lambert-Bouguer's law and their growth curves can be described by means of Gompertz functions. Starting from experimental data points, we extrapolate the growth curves of the two bacteria and we study the theoretical performance that would be achieved with a quantum setup. In particular, we discuss how the bacterial growth can, in principle, be tracked by irradiating the samples with orders of magnitude fewer photons, identifying the clear superiority of quantum light in the early stages of growth. We then show the superiority and the limits of quantum resources in two basic tasks: (i) the early detection of bacterial growth and (ii) the early discrimination between two bacteria species., Comment: Revised version

Quantum illumination (QI) promises unprecedented performances in target detection but there are various problems surrounding its implementation. Where target ranging is a concern, signal and idler recombination forms a crucial barrier to the protocol's success. This could potentially be mitigated if performing a measurement on the idler mode could still yield a quantum advantage. In this paper we investigate the QI protocol for a generically correlated Gaussian source and study the phase-conjugating (PC) receiver, deriving the associated SNR in terms of the signal and idler energies, and their cross-correlations, which may be readily adapted to incorporate added noise due to Gaussian measurements. We confirm that a heterodyne measurement performed on the idler mode leads to a performance which asymptotically approaches that of a coherent state with homodyne detection. However, if the signal mode is affected by heterodyne but the idler mode is maintained clean, the performance asymptotically approaches that of the PC receiver without any added noise., Comment: 15 pages, 2 figures

With the aim to loosen the entanglement requirements of quantum illumination, we study the performance of a family of Gaussian states at the transmitter, combined with an optimal and joint quantum measurement at the receiver. We find that maximal entanglement is not strictly necessary to achieve quantum advantage over the classical benchmark of a coherent-state transmitter, in both settings of symmetric and asymmetric hypothesis testing. While performing this quantum-classical comparison, we also investigate a suitable regime of parameters for potential short-range radar (or scanner) applications., Comment: 10 pages. REVTeX

We introduce a robust scheme for long-distance continuous-variable (CV) measurement-device-independent (MDI) quantum key distribution (QKD) in which we employ post-selection between distant parties communicating through the medium of an untrusted relay. We perform a security analysis that allows for general transmissivity and thermal noise variance of each link, in which we assume an eavesdropper performs a collective attack and controls the excess thermal noise in the channels. The introduction of post-selection enables the parties to sustain a secret key rate over distances exceeding those of existing CV MDI protocols. In the worst-case scenario in which the relay is positioned equidistant between them, we find that the parties may communicate securely over a range of 14 km in standard optical fiber. Our protocol helps to overcome the rate-distance limitations of previously proposed CV MDI protocols while maintaining many of their advantages., Comment: 13 pages, 7 figures

The final goal of quantum hypothesis testing is to achieve quantum advantage over all possible classical strategies. In the protocol of quantum reading this advantage is achieved for information retrieval from an optical memory, whose generic cell stores a bit of information in two possible lossy channels. For this protocol, we show, theoretically and experimentally, that quantum advantage is obtained by practical photon-counting measurements combined with a simple maximum-likelihood decision. In particular, we show that this receiver combined with an entangled two-mode squeezed vacuum source is able to outperform any strategy based on statistical mixtures of coherent states for the same mean number of input photons. Our experimental findings demonstrate that quantum entanglement and simple optics are able to enhance the readout of digital data, paving the way to real applications of quantum reading and with potential applications for any other model that is based on the binary discrimination of bosonic loss., Comment: 6 pages. 4 figures

We consider a quantum relay which is used by two parties to perform several continuous-variable protocols of quantum communication, from entanglement distribution (swapping and distillation), to quantum teleportation, and quantum key distribution. The theory of these protocols is suitably extended to a non-Markovian model of decoherence characterized by correlated Gaussian noise in the bosonic environment. In the worst case scenario where bipartite entanglement is completely lost at the relay, we show that the various protocols can be reactivated by the assistance of classical (separable) correlations in the environment. In fact, above a critical amount, these correlations are able to guarantee the distribution of a weaker form of entanglement (quadripartite), which can be localized by the relay into a stronger form (bipartite) that is exploitable by the parties. Our findings are confirmed by a proof-of-principle experiment where we show, for the first time, that memory effects in the environment can drastically enhance the performance of a quantum relay, well beyond the single-repeater bound for quantum and private communications., Comment: Main text plus Supplemental Material. 30 pages. 23 figures. Expands arXiv:1505.07457 and includes new results

Quantum key distribution provides secure keys resistant to code-breaking quantum computers. The continuous-variable version of quantum key distribution offers the advantages of higher secret key rates in metropolitan areas, as well as the use of standard telecom components that can operate at room temperature. However, the transmission distance of these systems (compared with discrete-variable systems) are currently limited and considered unsuitable for long-distance distribution. Herein, we report the experimental results of long distance continuous-variable quantum key distribution over 202.81 km of ultralow-loss optical fiber by suitably controlling the excess noise and employing highly efficient reconciliation procedures. This record-breaking implementation of the continuous-variable quantum key distribution doubles the previous distance record and shows the road for long-distance and large-scale secure quantum key distribution using room-temperature standard telecom components., Comment: 9 pages, 7 figures

The task of classifying the entanglement properties of a multipartite quantum state poses a remarkable challenge due to the exponentially increasing number of ways in which quantum systems can share quantum correlations. Tackling such challenge requires a combination of sophisticated theoretical and computational techniques. In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS), whose entanglement properties can be deduced via a constrained, reinforcement learning procedure. In this way, Separable Neural Network States (SNNS) can be used to build entanglement witnesses for any target state., Comment: 11 pages, 9 figures, RevTeX4

Secure quantum conferencing refers to a protocol where a number of trusted users generate exactly the same secret key to confidentially broadcast private messages. By a modification of the techniques first introduced in [Pirandola, arXiv:1601.00966], we derive a single-letter upper bound for the maximal rates of secure conferencing in a quantum network with arbitrary topology, where the users are allowed to perform the most powerful local operations assisted by two-way classical communications, and the quantum systems are routed according to the most efficient multipath flooding strategies. More precisely, our analysis allows us to bound the ultimate rates that are achievable by single-message multiple-multicast protocols, where N senders distribute N independent secret keys, and each key is to be shared with an ensemble of M receivers., Comment: Published in the inaugural issue of IET Quantum Communication

We consider continuous-variable quantum key distribution with discrete-alphabet encodings. In particular, we study protocols where information is encoded in the phase of displaced coherent (or thermal) states, even though the results can be directly extended to any protocol based on finite constellations of displaced Gaussian states. In this setting, we provide a composable security analysis in the finite-size regime assuming the realistic but restrictive hypothesis of collective Gaussian attacks. Under this assumption, we can efficiently estimate the parameters of the channel via maximum likelihood estimators and bound the corresponding error in the final secret key rate., Comment: REVTeX. Comments are welcome

Port-based teleportation (PBT) is a teleportation protocol that employs a number of Bell pairs and a joint measurement to enact an approximate input-output identity channel. Replacing the Bell pairs with a different multi-qubit resource state changes the enacted channel and allows the PBT protocol to simulate qubit channels beyond the identity. The channel resulting from PBT using a general resource state is consequently of interest. In this work, we fully characterise the Choi matrix of the qubit channel simulated by the PBT protocol in terms of its resource state. We also characterise the PBT protocol itself, by finding a description of the map from the resource state to the Choi matrix of the channel that is simulated by using that resource state. Finally, we exploit our expressions to show improved simulations of the amplitude damping channel by means of PBT with a finite number of ports., Comment: 23 pages, 4 figures. Similar to published version

Variational hybrid quantum-classical optimization represents one of the most promising avenue to show the advantage of nowadays noisy intermediate-scale quantum computers in solving hard problems, such as finding the minimum-energy state of a Hamiltonian or solving some machine-learning tasks. In these devices noise is unavoidable and impossible to error-correct, yet its role in the optimization process is not well understood, especially from the theoretical viewpoint. Here we consider a minimization problem with respect to a variational state, iteratively obtained via a parametric quantum circuit, taking into account both the role of noise and the stochastic nature of quantum measurement outcomes. We show that the accuracy of the result obtained for a fixed number of iterations is bounded by a quantity related to the Quantum Fisher Information of the variational state. Using this bound, we study the convergence property of the quantum approximate optimization algorithm under realistic noise models, showing the robustness of the algorithm against different noise strengths.

We investigate the classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks. By considering simultaneous multicasts from a set of senders to a set of receivers, we analyze the corresponding rates for transmitting classical and quantum information through the networks. More precisely, we compare achievable rates (i.e., lower bounds) for classical communication with upper bounds for quantum communication, quantifying the performance gap between the rates for networks connected by identity, depolarizing and erasure channels. For each network considered, we observe a range over which the classical rate non-trivially exceeds the quantum capacity. We find that, by adding butterfly blocks in parallel, the difference between transmitted bits and qubits can be increased up to one extra bit per receiver in the case of perfect transmission (identity channels). Our aim is to provide a quantitative analysis of those network configurations which are particularly disadvantageous for quantum networking, when compared to classical communication. By clarifying the performance of these 'negative cases', we also provide some guidance on how quantum networks should be built., Comment: 8 pages. 6 figures

It is known that quantum scissors, as non-deterministic amplifiers, can enhance the performance of Gaussian-modulated continuous-variable quantum key distribution (CV-QKD) in noisy and long-distance regimes of operation. Here, we extend this result to a non-Gaussian CV-QKD protocol with discrete modulation. We show that, by using a proper setting, the use of quantum scissors in the receiver of such discrete-modulation CV-QKD protocols would allow us to achieve positive secret key rates at high loss and high excess noise regimes of operation, which would have been otherwise impossible. This also keeps the prospect of running discrete-modulation CV-QKD over CV quantum repeaters alive., Comment: 11 pages, 7 figures

In quantum mechanics, a fundamental law prevents quantum communications to simultaneously achieve high rates and long distances. This limitation is well known for point-to-point protocols, where two parties are directly connected by a quantum channel, but not yet fully understood in protocols with quantum repeaters. Here we solve this problem bounding the ultimate rates for transmitting quantum information, entanglement and secret keys via quantum repeaters. We derive single-letter upper bounds for the end-to-end capacities achievable by the most general (adaptive) protocols of quantum and private communication, from a single repeater chain to an arbitrarily-complex quantum network, where systems may be routed through single or multiple paths. We analytically establish these capacities under fundamental noise models, including bosonic loss which is the most important for optical communications. In this way, our results provide the ultimate benchmarks for testing the optimal performance of repeater-assisted quantum communications., Comment: End-to-end results first appeared in arXiv:1601.00966 (2016). Please cite as: "S. Pirandola, Commun. Phys. 2, 51 (2019); see also arxiv:1601.00966 (2016)"

Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multi-end scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication., Comment: Multi-end results first appeared in arXiv:1601.00966 (2016)

A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any finite-dimensional design of this model is known to be nonuniversal, meaning that the processor cannot perfectly simulate an arbitrary quantum channel over the input. Characterizing how close the simulation is and finding the optimal program state have been open questions for the past 20 years. Here, we answer these questions by showing that the search for the optimal program state is a convex optimization problem that can be solved via semidefinite programming and gradient-based methods commonly employed for machine learning. We apply this general result to different types of processors, from a shallow design based on quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits., Comment: merged with arXiv:1905.01318

A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose role is to condition the operation performed by the processor. It is known that perfect channel simulation is only possible in the limit of infinitely large program states, so that finding the best program state represents an open problem in the presence of realistic finite-dimensional resources. Here we prove that the search for the optimal quantum program is a convex optimization problem. This can be solved either exactly, by minimizing a diamond distance cost function via semi-definite programming, or approximately, by minimizing other cost functions via gradient-based machine learning methods. We apply this general result to a number of different designs for the programmable quantum processor, from the shallow protocol of quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits. We benchmark the various designs by investigating their optimal performance in simulating arbitrary unitaries, Pauli and amplitude damping channels., Comment: REVTeX 23 pages. 13 figures. Long version of arXiv:1905.01316

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., Comment: 4 pages. 3 figures. REVTeX

In this brief note, I clarify the crucial differences between three different protocols of quantum channel discrimination, after some confusion has appeared in recent literature.

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.

Quantum communication is an important branch of quantum information science, promising unconditional security to classical communication and providing the building block of a future large-scale quantum network. Noise in realistic quantum communication channels imposes fundamental limits on the communication rates of various quantum communication tasks. It is therefore crucial to identify or bound the quantum capacities of a quantum channel. Here, we consider Gaussian channels that model energy loss and thermal noise errors in realistic optical and microwave communication channels and study their various quantum capacities in the energy-constrained scenario. We provide improved lower bounds to various energy-constrained quantum capacities of these fundamental channels and show that higher communication rates can be attained than previously believed. Specifically, we show that one can boost the transmission rates of quantum information and private classical information by using a correlated multi-mode thermal state instead of the single-mode thermal state of the same energy., Comment: 15 pages, 5 figures

Quantum sensing has become a mature and broad field. It is generally related with the idea of using quantum resources to boost the performance of a number of practical tasks, including the radar-like detection of faint objects, the readout of information from optical memories or fragile physical systems, and the optical resolution of extremely close point-like sources. Here we first focus on the basic tools behind quantum sensing, discussing the most recent and general formulations for the problems of quantum parameter estimation and hypothesis testing. With this basic background in our hands, we then review emerging applications of quantum sensing in the photonic regime both from a theoretical and experimental point of view. Besides the state-of-the-art, we also discuss open problems and potential next steps., Comment: Review in press on Nature Photonics. This is a preliminary version to be updated after publication. Both manuscript and reference list will be expanded

The use of quantum scissors, as candidates for non-deterministic amplifiers, in continuous-variable quantum key distribution systems is investigated. Such devices rely on single-photon sources for their operation and as such, they do not necessarily preserve the Guassianity of the channel. Using exact analytical modeling for system components, we bound the secret key generation rate for the system that uses quantum scissors. We find that for non-zero values of excess noise such a system can reach longer distances than the system with no amplification. The prospect of using quantum scissors in continuous-variable quantum repeaters is therefore emboldened., Comment: 11 pages, 7 figures, 1 table

Upper bounds for private communication over quantum channels can be derived by adopting channel simulation, protocol stretching, and relative entropy of entanglement. All these ingredients have led to single-letter upper bounds to the secret key capacity which can be directly computed over suitable resource states. For bosonic Gaussian channels, the tightest upper bounds have been derived by employing teleportation simulation over asymptotic resource states, namely the asymptotic Choi matrices of these channels. In this work, we adopt a different approach. We show that teleporting over an analytical class of finite-energy resource states allows us to closely approximate the ultimate bounds for increasing energy, so as to provide increasingly tight upper bounds to the secret-key capacity of one-mode phase-insensitive Gaussian channels. We then show that an optimization over the same class of resource states can be used to bound the maximum secret key rates that are achievable in a finite number of channel uses., Comment: 10 pages, 5 figures

We consider the noisy thermal amplifier channel, where signal modes are amplified together with environmental thermal modes. We focus on the secret-key capacity of this channel, which is the maximum amount of secret bits that two remote parties can generate by means of the most general adaptive protocol, assisted by unlimited and two-way classical communication. For this channel only upper and lower bounds are known, and in this work we improve the lower bound. We consider a protocol based on squeezed states and homodyne detections, in both direct and reverse reconciliation. In particular, we assume that trusted thermal noise is mixed on beam splitters controlled by the parties in a way to assist their homodyne detections. The new improved lower bounds to the secret-key capacity are obtained by optimizing the key rates over the variance of the trusted noise injected, and the transmissivity of the parties' beam splitters. Our results confirm that there is a separation between the coherent information of the thermal amplifier channel and its secret key capacity., Comment: 9 pages. 3 figures

Security analyses of quantum cryptographic protocols typically rely on certain conditions; one such condition is that the sender (Alice) and receiver (Bob) have isolated devices inaccessible to third parties. If an eavesdropper (Eve) has a side-channel into one of the devices, then the key rate may be sensibly reduced. In this paper, we consider an attack on a coherent-state protocol, where Eve not only taps the main communication channel but also hacks Alice's device. This is done by introducing a Trojan horse mode with low mean number of photons $\bar{n}$ which is then modulated in a similar way to the signal state. First we show that this strategy can be reduced to an attack without side channels but with higher loss and noise in the main channel. Then we show how the key rate rapidly deteriorates for increasing photons $\bar{n}$, being halved at long distances each time $\bar{n}+1$ doubles. Our work suggests that Alice's device should also be equipped with sensing systems that are able to detect and estimate the total number of incoming and outgoing photons., Comment: 10 pages. 9 figures. Comments are welcome. Typos and a derivation in the conclusions corrected

Consider two bosonic modes which are prepared in one of two possible Gaussian states with the same local energy: either a tensor-product thermal state (with zero correlations) or a separable Gaussian state with maximal correlations (with both classical and quantum correlations, the latter being quantified by quantum discord). For the discrimination of these states, we compare the optimal joint coherent measurement with the best local measurement based on single-mode Gaussian detections. We show how the coherent measurement always strictly outperforms the local detection strategy for both single- and multi-copy discrimination. This means that using local Gaussian measurements (assisted by classical communication) is strictly suboptimal in detecting discord. A better performance may only be achieved by either using non Gaussian measurements (non linear optics) or coherent non-local measurements., Comment: Quantum Communications and Quantum Imaging XVI, SPIE Optical Engineering + Applications, 19 - 23 August 2018, San Diego CA, United States

In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when these channel-components are not jointly teleportation-covariant. This design is also extended to asymptotic simulations, continuous ensembles, and memory channels. As an application, we derive relative-entropy-of-entanglement upper bounds for private communication over various channels, including non-Gaussian mixtures of bosonic lossy channels. Among other results, we also establish the two-way quantum and private capacity of the so-called `dephrasure' channel., Comment: 9 pages. 1 figure

We consider quantum discrimination of bosonic loss based on both symmetric and asymmetric hypothesis testing. In both approaches, an entangled resource is able to outperform any classical strategy based on coherent-state transmitters in the regime of low photon numbers. In the symmetric case, we then consider the low energy detection of bacterial growth in culture media. Assuming an exponential growth law for the bacterial concentration and the Beer-Lambert law for the optical transmissivity of the sample, we find that the use of entanglement allows one to achieve a much faster detection of growth with respect to the use of coherent states. This performance is also studied by assuming an exponential photo-degradable model, where the concentration is reduced by increasing the number of photons irradiated over the sample. This investigation is then extended to the readout of classical information from suitably-designed photo-degradable optical memories., Comment: REVTeX. 14 pages. 11 figures

A well-known empirical rule for the demand of wireless communication systems is that of Edholm's law of bandwidth. It states that the demand for bandwidth in wireless short-range communications doubles every 18 months. With the growing demand for bandwidth and the decreasing cell size of wireless systems, terahertz (THz) communication systems are expected to become increasingly important in modern day applications. With this expectation comes the need for protecting users' privacy and security in the best way possible. With that in mind, we show that quantum key distribution can operate in the THz regime and we derive the relevant secret key rates against realistic collective attacks. In the extended THz range (from 0.1 to 50 THz), we find that below 1 THz, the main detrimental factor is thermal noise, while at higher frequencies it is atmospheric absorption. Our results show that high-rate THz quantum cryptography is possible over distances varying from a few meters using direct reconciliation, to about 220m via reverse reconciliation. We also give a specific example of the physical hardware and architecture that could be used to realize our THz quantum key distribution scheme., Comment: REVTeX. 14 pages. 5 figures. Accepted version

An author (arXiv:1709.09262 [quant-ph] (2017), Nanoscale Research Letters (2017) 12:552) has recently questioned the security of two-way quantum key distribution schemes by referring to attack strategies which leave no errors in the (raw) key shared by the legitimate parties. We argue that the article is based on a flawed understanding of the actual workings of a two-way protocol, thus the erroneous conclusions drawn thereof.

Werner states have a host of interesting properties, which often serve to illuminate the unusual properties of quantum information. Starting from these states, one may define a family of quantum channels, known as the Holevo-Werner channels, which themselves afford several unusual properties. In this paper we use the teleportation covariance of these channels to upper bound their two-way assisted quantum and secret-key capacities. This bound may be expressed in terms of relative entropy distances, such as the relative entropy of entanglement, and also in terms of the squashed entanglement. Most interestingly, we show that the relative entropy bounds are strictly sub-additive for a sub-class of the Holevo-Werner channels, so that their regularisation provides a tighter performance. These information-theoretic results are first found for point-to-point communication and then extended to repeater chains and quantum networks, under different types of routing strategies., Comment: REVTeX. 11 pages. 8 figures

We study the impact of finite-size effects on the security of thermal one-way quantum cryptography. Our approach considers coherent/squeezed states at the preparation stage, on the top of which the sender adds trusted thermal noise. We compute the key rate incorporating finite-size effects, and we obtain the security threshold at different frequencies. As expected finite-size effects deteriorate the performance of thermal quantum cryptography. Our analysis is useful to quantify the impact of this degradation on relevant parameters like tolerable attenuation, transmission frequencies at which one can achieve security., Comment: REVTeX. 9 pages, 4 figures. Close to the published version

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., Comment: Close to published version. Main Text, Methods, and Supplementary Information all in a single file. 21 pages and 4 figures. REVTeX. Co-author added

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., Comment: REVTeX. 8 pages. 7 figures

The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo-Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this case, we prove an analytical formula for the quantum Chernoff bound which also has a direct counterpart for the class of depolarizing channels. Our work exploits previous methods established in [Pirandola and Lupo, PRL 118, 100502 (2017)] to set the metrological limits associated with this interesting class of quantum channels at any finite dimension., Comment: Contribution to the Special Issue on quantum-enhanced metrology and sensing for quantum technology, edited by M. Paternostro

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., Comment: REVTeX. 5 pages. 2 figures. Comments are welcome

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\'er 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., Comment: Short review paper. REVTeX 10 pages. 6 figures

We consider the Braunstein-Kimble protocol for continuous variable teleportation and its application for the simulation of bosonic channels. We discuss the convergence properties of this protocol under various topologies (strong, uniform, and bounded-uniform) clarifying some typical misinterpretations in the literature. We then show that the teleportation simulation of an arbitrary single-mode Gaussian channel is uniformly convergent to the channel if and only if its noise matrix has full rank. The various forms of convergence are then discussed within adaptive protocols, where the simulation error must be propagated to the output of the protocol by means of a "peeling" argument, following techniques from PLOB [arXiv:1510.08863]. Finally, as an application of the peeling argument and the various topologies of convergence, we provide complete rigorous proofs for recently-claimed strong converse bounds for private communication over Gaussian channels., Comment: Accepted version. Establishes a general criterion for the uniform convergence of teleportation simulation for an arbitrary Gaussian channel. Clarifying the use of the Braunstein-Kimble teleportation protocol, it also provides complete proofs for the claims presented in WTB arXiv:1602.08898, beyond the first rigorous proof already given in arXiv:1711.09909

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., Comment: V4: Close to the published version

We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in PLOB [Pirandola, Laurenza, Ottaviani, Banchi, arXiv:1510.08863]. We start by introducing a general weak converse bound for private communication based on the relative entropy of entanglement. We discuss how combining this bound with channel simulation and teleportation stretching, PLOB established the two-way quantum and private capacities of several fundamental channels, including the bosonic lossy channel. We then provide a rigorous proof of the strong converse property of these bounds by adopting a correct use of the Braunstein-Kimble teleportation protocol for the simulation of bosonic Gaussian channels. This analysis provides a full justification of claims presented in the follow-up paper WTB [Wilde, Tomamichel, Berta, arXiv:1602.08898] whose upper bounds for Gaussian channels would be otherwise infinitely large. Besides clarifying contributions in the area of channel simulation and protocol reduction, we also present some generalizations of the tools to other entanglement measures and novel results on the maximum excess noise which is tolerable in quantum key distribution., Comment: Review paper which also contains new results. Published version. REVTeX. 28 pages. 2 tables and 4 figures