arXiv subjects

Nicolas J. Cerf

Publications and source records attributed to Nicolas J. Cerf.

At least 73 records · Page 4Linked to original sources

arXiv2014

Optimality of Gaussian Discord

In this Letter we exploit the recently-solved conjecture on the bosonic minimum output entropy to show the optimality of Gaussian discord, so that the computation of quantum discord for bipartite Gaussian states can be restricted to local Gaussian measurements. We prove such optimality for a large family of Gaussian states, including all two-mode squeezed thermal states, which are the most typical Gaussian states realized in experiments. Our family also includes other types of Gaussian states and spans their entire set in a suitable limit where they become Choi-matrices of Gaussian channels. As a result, we completely characterize the quantum correlations possessed by some of the most important bosonic states in quantum optics and quantum information.

quant-ph↗

arXiv2014

Interconversion of pure Gaussian states using non-Gaussian operations

We analyze the conditions under which local operations and classical communication enable entanglement transformations within the set of bipartite pure Gaussian states. A set of necessary and sufficient conditions had been found in [Quant. Inf. Comp. 3, 211 (2003)] for the interconversion between such states that is restricted to Gaussian local operations and classical communication. Here, we exploit majorization theory in order to derive more general (sufficient) conditions for the interconversion between bipartite pure Gaussian states that goes beyond Gaussian local operations. While our technique is applicable to an arbitrary number of modes for each party, it allows us to exhibit surprisingly simple examples of 2 x 2 Gaussian states that necessarily require non-Gaussian local operations to be transformed into each other.

quant-ph↗

arXiv2013

Equivalence Relations for the Classical Capacity of Single-Mode Gaussian Quantum channels

We prove the equivalence of an arbitrary single-mode Gaussian quantum channel and a newly defined fiducial channel preceded by a phase shift and followed by a Gaussian unitary operation. This equivalence implies that the energy-constrained classical capacity of any single-mode Gaussian channel can be calculated based on this fiducial channel, which is furthermore simply realizable with a beam splitter, two identical single-mode squeezers, and a two-mode squeezer. In a large domain of parameters, we also provide an analytical expression for the Gaussian classical capacity, exploiting its additivity, and prove that the classical capacity cannot exceed it by more than 1/ln2 bits.

quant-ph↗

arXiv2013

Exploring pure quantum states with maximally mixed reductions

We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally mixed, reflecting maximum bipartite entanglement across all k vs. n-k bipartitions. As a special case, we examine the class of balanced pure states, which are constructed from a subset of the Pauli group P_n that is isomorphic to Z_2^n. This makes a connection with the theory of quantum error-correcting codes and provides bounds on the largest allowed k for fixed n. In particular, the ratio k/n can be lower and upper bounded in the asymptotic regime, implying that there must exist multipartite entangled states with at least k=0.189 n when $n\to \infty$. We also analyze symmetric states as another natural class of states with high multipartite entanglement and prove that, surprisingly, they cannot have all maximally mixed k-qubit reductions with k>1. Thus, measured through bipartite entanglement across all bipartitions, symmetric states cannot exhibit large entanglement. However, we show that the permutation symmetry only constrains some components of the generalized Bloch vector, so that very specific patterns in this vector may be allowed even though k>1 is forbidden. This is illustrated numerically for a few symmetric states that maximize geometric entanglement, revealing some interesting structures.

quant-ph↗

arXiv2012

Security of continuous-variable quantum key distribution against general attacks

We prove the security of Gaussian continuous-variable quantum key distribution against arbitrary attacks in the finite-size regime. The novelty of our proof is to consider symmetries of quantum key distribution in phase space in order to show that, to good approximation, the Hilbert space of interest can be considered to be finite-dimensional, thereby allowing for the use of the postselection technique introduced by Christandl, Koenig and Renner (Phys. Rev. Lett. 102, 020504 (2009)). Our result greatly improves on previous work based on the de Finetti theorem which could not provide security for realistic, finite-size, implementations.

quant-ph↗

arXiv2012

Noiseless loss suppression in quantum optical communication

We propose a protocol for conditional suppression of losses in direct quantum state transmission over a lossy quantum channel. The method works by noiselessly attenuating the input state prior to transmission through a lossy channel followed by noiseless amplification of the output state. The procedure does not add any noise hence it keeps quantum coherence. We experimentally demonstrate it in the subspace spanned by vacuum and single-photon states, and consider its general applicability.

quant-ph↗

arXiv2012

Enhancing quantum entanglement by photon addition and subtraction

The non-Gaussian operations effected by adding or subtracting a photon on the entangled optical beams emerging from a parametric down-conversion process have been suggested to enhance entanglement. Heralded photon addition or subtraction is, as a matter of fact, at the heart of continuous-variable entanglement distillation. The use of such processes has recently been experimentally demonstrated in the context of the generation of optical coherent-state superpositions or the verification of the canonical commutation relations. Here, we carry out a systematic study of the effect of local photon additions or subtractions on a two-mode squeezed vacuum state, showing that the entanglement generally increases with the number of such operations. This is analytically proven when additions or subtractions are restricted to one mode only, while we observe that the highest entanglement is achieved when these operations are equally shared between the two modes. We also note that adding photons typically provides a stronger entanglement enhancement than subtracting photons, while photon subtraction performs better in terms of energy efficiency. Furthermore, we analyze the interplay between entanglement and non-Gaussianity, showing that it is more subtle than previously expected.

quant-ph↗

arXiv2012

Virtual noiseless amplification and Gaussian post-selection in continuous-variable quantum key distribution

The noiseless amplification or attenuation are two heralded filtering operations that enable respectively to increase or decrease the mean field of any quantum state of light with no added noise, at the cost of a small success probability. We show that inserting such noiseless operations in a transmission line improves the performance of continuous-variable quantum key distribution over this line. Remarkably, these noiseless operations do not need to be physically implemented but can simply be simulated in the data post-processing stage. Hence, virtual noiseless amplification or attenuation amounts to perform a Gaussian post-selection, which enhances the secure range or tolerable excess noise while keeping the benefits of Gaussian security proofs.

quant-ph↗

arXiv2012

Gaussian matrix-product states for coding in bosonic communication channels

The communication capacity of Gaussian bosonic channels with memory has recently attracted much interest. Here, we investigate a method to prepare the multimode entangled input symbol states for encoding classical information into these channels. In particular, we study the usefulness of a Gaussian matrix product state (GMPS) as an input symbol state, which can be sequentially generated although it remains heavily entangled for an arbitrary number of modes. We show that the GMPS can achieve more than 99.9% of the Gaussian capacity for Gaussian bosonic memory channels with a Markovian or non-Markovian correlated noise model in a large range of noise correlation strengths. Furthermore, we present a noise class for which the GMPS is the exact optimal input symbol state of the corresponding channel. Since GMPS are ground states of particular quadratic Hamiltonians, our results suggest a possible link between the theory of quantum communication channels and quantum many-body physics.

quant-ph↗

arXiv2011

Majorization theory approach to the Gaussian channel minimum entropy conjecture

A longstanding open problem in quantum information theory is to find the classical capacity of an optical communication link, modeled as a Gaussian bosonic channel. It has been conjectured that this capacity is achieved by a random coding of coherent states using an isotropic Gaussian distribution in phase space. We show that proving a Gaussian minimum entropy conjecture for a quantum-limited amplifier is actually sufficient to confirm this capacity conjecture, and we provide a strong argument towards this proof by exploiting a connection between quantum entanglement and majorization theory.

quant-ph↗

arXiv2011

Gaussian Quantum Information

The science of quantum information has arisen over the last two decades centered on the manipulation of individual quanta of information, known as quantum bits or qubits. Quantum computers, quantum cryptography and quantum teleportation are among the most celebrated ideas that have emerged from this new field. It was realized later on that using continuous-variable quantum information carriers, instead of qubits, constitutes an extremely powerful alternative approach to quantum information processing. This review focuses on continuous-variable quantum information processes that rely on any combination of Gaussian states, Gaussian operations, and Gaussian measurements. Interestingly, such a restriction to the Gaussian realm comes with various benefits, since on the theoretical side, simple analytical tools are available and, on the experimental side, optical components effecting Gaussian processes are readily available in the laboratory. Yet, Gaussian quantum information processing opens the way to a wide variety of tasks and applications, including quantum communication, quantum cryptography, quantum computation, quantum teleportation, and quantum state and channel discrimination. This review reports on the state of the art in this field, ranging from the basic theoretical tools and landmark experimental realizations to the most recent successful developments.

quant-ph↗

arXiv2011

Gaussian capacity of the quantum bosonic channel with additive correlated Gaussian noise

We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise correlations obeying certain conditions and works in the full input energy domain, beyond previous treatments of this problem. As an illustration, we study the optimal input states and capacity of a quantum memory channel with Gauss-Markov noise [J. Schäfer, Phys. Rev. A 80, 062313 (2009)]. We evaluate the enhancement of the transmission rate when using these optimal entangled input states by comparison with a product coherent-state encoding and find out that such a simple coherent-state encoding achieves not less than 90% of the capacity.

quant-ph↗

arXiv2010

Unconditional security of continuous-variable quantum key distribution

The unconditional security of continuous-variable quantum key distribution is established for all schemes based on the estimation of the channel loss and excess noise. It is proved that, in the limit of large keys, Gaussian attacks are asymptotically optimal among the most general (coherent) attacks, where the transmission is tapped using arbitrary ancillas and stored in a quantum memory as a whole. Then, it is shown that the previously derived bounds on the achievable secret key rates against collective attacks remain asymptotically valid for arbitrary coherent attacks.

quant-ph↗

arXiv2010

Quantum optical coherence can survive photon losses: a continuous-variable quantum erasure correcting code

A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information technologies, it is believed that QECC will play a similarly crucial role in tomorrow's quantum information systems. Here, we report on the first experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Whereas {\it errors} translate, in an information theoretic language, the noise affecting a transmission line, {\it erasures} correspond to the in-line probabilistic loss of photons. Our quantum code protects a four-mode entangled mesoscopic state of light against erasures, and its associated encoding and decoding operations only require linear optics and Gaussian resources. Since in-line attenuation is generally the strongest limitation to quantum communication, much more than noise, such an erasure-correcting code provides a new tool for establishing quantum optical coherence over longer distances. We investigate two approaches for circumventing in-line losses using this code, and demonstrate that both approaches exhibit transmission fidelities beyond what is possible by classical means.

quant-ph↗

arXiv2010

Strong no-go theorem for Gaussian quantum bit commitment

Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states and operations, which is a reasonable assumption in current-state optical implementations. Our Gaussian no-go theorem also provides a natural counter-example to a conjecture that quantum mechanics can be rederived from the assumption that key distribution is allowed while bit commitment is forbidden in Nature.

quant-ph↗

arXiv2009

Capacity of a bosonic memory channel with Gauss-Markov noise

We address the classical capacity of a quantum bosonic memory channel with additive noise, subject to an input energy constraint. The memory is modeled by correlated noise emerging from a Gauss-Markov process. Under reasonable assumptions, we show that the optimal modulation results from a "quantum water-filling" solution above a certain input energy threshold, similar to the optimal modulation for parallel classical Gaussian channels. We also derive analytically the optimal multimode input state above this threshold, which enables us to compute the capacity of this memory channel in the limit of an infinite number of modes. The method can also be applied to a more general noise environment which is constructed by a stationary Gauss process. The extension of our results to the case of broadband bosonic channels with colored Gaussian noise should also be straightforward.

quant-ph↗

arXiv2009

The Security of Practical Quantum Key Distribution

Quantum key distribution (QKD) is the first quantum information task to reach the level of mature technology, already fit for commercialization. It aims at the creation of a secret key between authorized partners connected by a quantum channel and a classical authenticated channel. The security of the key can in principle be guaranteed without putting any restriction on the eavesdropper's power. The first two sections provide a concise up-to-date review of QKD, biased toward the practical side. The rest of the paper presents the essential theoretical tools that have been developed to assess the security of the main experimental platforms (discrete variables, continuous variables and distributed-phase-reference protocols).

quant-ph↗

arXiv2009

Security of continuous-variable QKD: exploiting symmetries in phase space

Proving the unconditional security of a quantum key distribution (QKD) scheme is a highly challenging task as one needs to determine the most efficient attack compatible with experimental data. This task is even more demanding for continuous-variable QKD as the Hilbert space where the protocol is described is infinite dimensional. A very natural way to address this problem is to make an extensive use of the symmetries of the protocols. In this article, we investigate a symmetry in phase space that is particularly relevant to continuous-variable QKD, and explore the way towards a new quantum de Finetti theorem that would exploit this symmetry and provide a powerful tool to assess the security of continuous-variable protocols.

quant-ph↗