Search

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., 11 pages with 10 figures with appendices. Extended analysis. Accepted version

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., Comment: 5 pages, 2 figures, 3 pages appendix

Quantum random number generators promise perfectly unpredictable random numbers. A popular approach to quantum random number generation is homodyne measurements of the vacuum state, the ground state of the electro-magnetic field. Here we experimentally implement such a quantum random number generator, and derive a security proof that considers quantum side-information instead of classical side-information only. Based on the assumptions of Gaussianity and stationarity of noise processes, our security analysis furthermore includes correlations between consecutive measurement outcomes due to finite detection bandwidth, as well as analog-to-digital converter imperfections. We characterize our experimental realization by bounding measured parameters of the stochastic model determining the min-entropy of the system’s measurement outcomes, and we demonstrate a real-time generation rate of 2.9 Gbit/s. Our generator follows a trusted, device-dependent, approach. By treating side-information quantum mechanically an important restriction on adversaries is removed, which usually was reserved to semi-device-independent and device-independent schemes., Security analyses for trusted quantum random number generators usually consider only classical side-information. Here, the authors fill this gap by fully characterising the experimental apparatus of a homodyne-based QRNG, assuming that the vacuum fluctuations and noise are stationary and Gaussian.

Quantum cryptography is arguably the fastest growing area in quantum information science. Novel theoretical protocols are designed on a regular basis, security proofs are constantly improving, and experiments are gradually moving from proof-of-principle lab demonstrations to in-field implementations and technological prototypes. In this review, we provide both a general introduction and a state of the art description of the recent advances in the field, both theoretically and experimentally. We start by reviewing protocols of quantum key distribution based on discrete variable systems. Next we consider aspects of device independence, satellite challenges, and high rate protocols based on continuous variable systems. We will then discuss the ultimate limits of point-to-point private communications and how quantum repeaters and networks may overcome these restrictions. Finally, we will discuss some aspects of quantum cryptography beyond standard quantum key distribution, including quantum data locking and quantum digital signatures., Comment: Review article. Comments and suggestions are welcome. REVTeX: 118 pages, 20 figures, 785 references

We solve the general problem of determining, through imaging, the three-dimensional positions of N weak incoherent pointlike emitters in an arbitrary spatial configuration. We show that a structured measurement strategy in which a passive linear interferometer feeds into an array of photodetectors 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 special case of one and two incoherent emitters in the paraxial regime. This work provides insights into the phenomenon of superresolution 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.

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., 10 Figures

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

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., Comment: REVTeX. 18 pages (main text plus supplementary information), 8 figures

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., Comment: Comments welcome. V3: close to published version

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., Comment: Comments welcome. v2: close to the published version

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).

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., v4: close to the published version (which is shorter than previous arXiv versions)

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

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 demonstrate a gigahertz source of verifiable quantum random numbers based on homodyne detection of the vacuum state. Using a whitening filter, we generate iid samples with a potential randomness rate of 20Gbit/s.

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

We demonstrate a large-scale tunable-coupling ring resonator array, suitable for high-dimensional classical and quantum transforms, in a CMOS-compatible silicon photonics platform. The device consists of a waveguide coupled to 15 ring-based dispersive elements with programmable linewidths and resonance frequencies. The ability to control both quality factor and frequency of each ring provides an unprecedented 30 degrees of freedom in dispersion control on a single spatial channel. This programmable dispersion control system has a range of applications, including mode-locked lasers, quantum key distribution, and photon-pair generation. We also propose a novel application enabled by this circuit – high-speed quantum communications using temporal-mode-based quantum data locking – and discuss the utility of the system for performing the high-dimensional unitary optical transformations necessary for a quantum data locking demonstration.

Compared with many other methods which only give time sub-optimal designs, the quantum brachistochrone equation has a great potential to provide accurate time-optimal protocols for essentially any quantum control problem. So far it has been of limited use, 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. This identification allows us to design a numerical method that can efficiently solve the brachistochrone problem by first solving a family of geodesic equations.

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., v4: Improved results, better presentation, a few typos fixed, new figures and references added

A large-scale tunable-coupling ring resonator array is demonstrated in a CMOS-compatible silicon photonics platform to achieve tunable frequency-dependent group delay. The system is proposed for a phase-encoded quantum data locking protocol.

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., Comment: 9 pages, 5 figures, comments welcome

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., Comment: 12 pages, accepted for publication in IEEE Transactions on Information Theory

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., 10 pages, 3 figures

A wide variety of communication channels employ the quantized electromagnetic field to convey information. Their communication capacity crucially depends on losses associated to spatial characteristics of the channel such as diffraction and antenna design. Here we focus on the communication via a finite pupil, showing that diffraction is formally described as a memory channel. By exploiting this equivalence we then compute the communication capacity of an optical refocusing system, modeled as a converging lens. Even though loss of information originates from the finite pupil of the lens, we show that the presence of the refocusing system can substantially enhance the communication capacity. We mainly concentrate on communication of classical information, the extension to quantum information being straightforward., 11 pages, 3 figures. v2: minor changes, close to the published version

We consider qubit networks where adjacent qubits besides interacting via XY-coupling, also dissipate into the same environment. The steady states are computed exactly for all network sizes and topologies, showing that they are always symmetric under permutation of network sites, leading to a uniform distribution of the stationary entanglement across the network. The maximum entanglement between two arbitrary qubits is shown to depend only on the total number of qubits in the network, and scales linearly with it. A possible physical realization by means of an array of doped cavities is discussed for the case of a linear chain., Comment: 6 pages, comments welcome. v2: published version with typos corrected and updated bibliography

We consider a model of bosonic memory channel, which induces correlations among the transmitted signals. The application of suitable unitary transformations at encoding and decoding stages allows the complete removal of correlations, mapping the memory channel into a memoryless one. However, such transformations, being global over an arbitrary large number of bosonic modes, are not realistically implementable. We then introduce a family of efficiently realizable transformations which can be used to partially remove correlations among errors, and we quantify the reduction of the gap with memoryless channels., 6 pages, 6 figures, comments welcome

We consider the problem of quantum communication mediated by an optical refocusing system, which is schematized as a thin lens with a finite pupil. This model captures the basic features of all those situations in which a signal is either refocused by a repeater for long distance communication, or it is focused on a detector prior to the information decoding process. Introducing a general method for linear optical systems, we compute the communication capacity of the refocusing apparatus. Although the finite extension of the pupil may cause loss of information, we show that the presence of the refocusing system can substantially enhance the rate of reliable communication with respect to the free-space propagation., Comment: 4 pages, 1 figure

We present a differential geometric viewpoint of the quantum MaxEnt estimate of a density operator when only incomplete knowledge encoded in the expectation values of a set of quantum observables is available. Finally, the additional possibility of considering some prior bias towards a certain density operator (the prior) is taken into account and the unsolved issues with its quantum relative entropic inference criterion are pointed out., Comment: 6 pages and 0 figures. Accepted contribution to MaxEnt 2011, the 31st International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering; 10-15 July, Waterloo (CANADA)

We study the information geometry and the entropic dynamics of a 3D Gaussian statistical model. We then compare our analysis to that of a 2D Gaussian statistical model obtained from the higher-dimensional model via introduction of an additional information constraint that resembles the quantum mechanical canonical minimum uncertainty relation. We show that the chaoticity (temporal complexity) of the 2D Gaussian statistical model, quantified by means of the Information Geometric Entropy (IGE) and the Jacobi vector field intensity, is softened with respect to the chaoticity of the 3D Gaussian statistical model., Comment: 17 pages and 0 figures. To appear in Open Systems & Information Dynamics

We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy and find, in particular, that the effort required for recovering such codes decreases when the error probability decreases and the memory parameter increases. Second, we consider both symmetric and asymmetric depolarizing noisy quantum memory channels and perform quantum error correction via the five qubit stabilizer code. We characterize this code by means of the entanglement fidelity and the code entropy as function of the asymmetric error probabilities and the degree of memory. Specifically, we uncover that while the asymmetry in the depolarizing errors does not affect the entanglement fidelity of the five qubit code, it becomes a relevant feature when the code entropy is used as a performance quantifier., 21 pages, 10 figures

The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys. Rev. Lett. 106, 090504 (2011)]. In the case of optical memories, such as CDs and DVDs, this discrimination involves lossy bosonic channels and can be remarkably boosted by the use of nonclassical light (quantum reading). Here we generalize these concepts by extending the model of memory from single-cell to multi-cell encoding. In general, information is stored in a block of cells by using a channel-codeword, i.e., a sequence of channels chosen according to a classical code. Correspondingly, the readout of data is realized by a process of "parallel" channel discrimination, where the entire block of cells is probed simultaneously and decoded via an optimal collective measurement. In the limit of an infinite block we define the quantum reading capacity of the memory, quantifying the maximum number of readable bits per cell. This notion of capacity is nontrivial when we suitably constrain the physical resources of the decoder. For optical memories (encoding bosonic channels), such a constraint is energetic and corresponds to fixing the mean total number of photons per cell. In this case, we are able to prove a separation between the quantum reading capacity and the maximum information rate achievable by classical transmitters, i.e., arbitrary classical mixtures of coherent states. In fact, we can easily construct nonclassical transmitters that are able to outperform any classical transmitter, thus showing that the advantages of quantum reading persist in the optimal multi-cell scenario., REVTeX. 16 pages. 11 figures

We address the question of optimality of entangled input states in quantum Gaussian memory channels. For a class of such channels, which can be traced back to the memoryless setting, we state a criterion which relates the optimality of entangled inputs to the symmetry properties of the channels' action. Several examples of channel models belonging to this class are discussed.

We introduce a general model for a lossy bosonic memory channel and calculate the classical and the quantum capacity, proving that coherent state encoding is optimal. The use of a proper set of collective field variables allows to unravel the memory, showing that the n-fold concatenation of the memory channel is unitarily equivalent to the direct product of n single-mode lossy bosonic channels., Comment: 4 pages, 2 fugures. Comments are welcome

With increasing communication rates via quantum channels, memory effects become unavoidable whenever the use rate of the channel is comparable to the typical relaxation time of the channel environment. We introduce a model of a bosonic memory channel, describing correlated noise effects in quantum-optical processes via attenuating or amplifying media. To study such a channel model, we make use of a proper set of collective field variables, which allows us to unravel the memory effects, mapping the n-fold concatenation of the memory channel to a unitarily equivalent, direct product of n single-mode bosonic channels. We hence estimate the channel capacities by relying on known results for the memoryless setting. Our findings show that the model is characterized by two different regimes, in which the cross correlations induced by the noise among different channel uses are either exponentially enhanced or exponentially reduced., Comment: 10 pages, 7 figures, close to the published version

We present a study of the achievable rates for classical information transmission via a lossy bosonic channel with memory, using homodyne detection. A comparison with the memoryless case shows that the presence of memory enhances the bit rate if information is encoded in collective states, i.e. states which are entangled over different uses of the channel., 3 figures, comments are welcome

We evaluate the information capacities of a lossy bosonic channel with correlated noise. The model generalizes the one recently discussed in [Phys. Rev. A 77, 052324 (2008)], where memory effects come from the interaction with correlated environments. Environmental correlations are quantified by a multimode squeezing parameter, which vanishes in the memoryless limit. We show that a global encoding/decoding scheme, which involves input entangled states among different channel uses, is always preferable with respect to a local one in the presence of memory. Moreover, in a certain range of the parameters, we provide an analytical expression for the classical capacity of the channel showing that a global encoding/decoding scheme allows to attain it. All the results can be applied to a broad class of bosonic Gaussian channels., Comment: 16 pages, 4 figures, (almost) the published version, comments are welcome

The notion of forgetfulness, used in discrete quantum memory channels, is slightly weakened in order to be applied to the case of continuous channels. This is done in the context of quantum memory channels with Markovian noise. As a case study, we apply the notion of weak-forgetfulness to a bosonic memory channel with additive noise. A suitable encoding and decoding unitary transformation allows us to unravel the effects of the memory, hence the channel capacities can be computed using known results from the memoryless setting., Comment: 6 pages, 2 figures, comments are welcome. Minor corrections and acknoledgment added

Optimization methods aimed at estimating the capacities of a general Gaussian channel are developed. Specifically evaluation of classical capacity as maximum of the Holevo information is pursued over all possible Gaussian encodings for the lossy bosonic channel, but extension to other capacities and other Gaussian channels seems feasible. Solutions for both memoryless and memory channels are presented. It is first dealt with single use (single-mode) channel where the capacity dependence from channel's parameters is analyzed providing a full classification of the possible cases. Then it is dealt with multiple uses (multi-mode) channel where the capacity dependence from the (multi-mode) environment state is analyzed when both total environment energy and environment purity are fixed. This allows a fair comparison among different environments, thus understanding the role of memory (inter-mode correlations) and phenomenon like superadditivity of the capacity. The developed methods are also used for deriving transmission rates with heterodyne and homodyne measurements at the channel output. Classical capacity and transmission rates are presented within a unique framework where the rates can be treated as logarithmic approximations of the capacity., Comment: 39 pages, 30 figures. New results and graphs were added. Errors and misprints were corrected. To appear in IEEE Trans. Inf. Th

A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols that encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode versus multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, leading to an exponential increase in the achievable quantum communication rates in comparison to single-mode coding, but also yields an improved loss resilience. However, as reliable quantum information transfer is only achieved for entanglement values above a certain threshold, a careful optimization of the number of coding modes is needed to obtain the optimal quantum channel capacity., Comment: 27 pages, 18 figures, Video abstract: https://www.youtube.com/watch?v=Uadp5JjPigU

The set of quantum Gaussian channels acting on one bosonic mode can be classified according to the action of the group of Gaussian unitaries. We look for bounds on the classical capacity for channels belonging to such a classification. Lower bounds can be efficiently calculated by restricting to Gaussian encodings, for which we provide analytical expressions., Comment: 10 pages, IOP style. v2: minor corrections, close to the published version

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 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., Comment: REVTeX. 9 pages. Includes practical receiver designs and other improvements