arXiv subjects

Nicolas J. Cerf

Publications and source records attributed to Nicolas J. Cerf.

At least 91 records · Page 5Linked to original sources

arXiv2009

Continuous-variable quantum key distribution protocols over noisy channels

A continuous-variable quantum key distribution protocol based on squeezed states and heterodyne detection is introduced and shown to attain higher secret key rates over a noisy line than any other one-way Gaussian protocol. This increased resistance to channel noise can be understood as resulting from purposely adding noise to the signal that is converted into the secret key. This notion of noise-enhanced tolerance to noise also provides a better physical insight into the poorly understood discrepancies between the previously defined families of Gaussian protocols.

quant-ph↗

arXiv2009

A quantum de Finetti theorem in phase space representation

The quantum versions of de Finetti's theorem derived so far express the convergence of n-partite symmetric states, i.e., states that are invariant under permutations of their n parties, towards probabilistic mixtures of independent and identically distributed (i.i.d.) states. Unfortunately, these theorems only hold in finite-dimensional Hilbert spaces, and their direct generalization to infinite-dimensional Hilbert spaces is known to fail. Here, we address this problem by considering invariance under orthogonal transformations in phase space instead of permutations in state space, which leads to a new type of quantum de Finetti's theorem that is particularly relevant to continuous-variable systems. Specifically, an n-mode bosonic state that is invariant with respect to this continuous symmetry in phase space is proven to converge towards a probabilistic mixture of i.i.d. Gaussian states (actually, n identical thermal states).

quant-ph↗

arXiv2008

A No-Go Theorem for Gaussian Quantum Error Correction

It is proven that Gaussian operations are of no use for protecting Gaussian states against Gaussian errors in quantum communication protocols. Specifically, we introduce a new quantity characterizing any single-mode Gaussian channel, called entanglement degradation, and show that it cannot decrease via Gaussian encoding and decoding operations only. The strength of this no-go theorem is illustrated with some examples of Gaussian channels.

quant-ph↗

arXiv2008

Tests of multimode quantum non-locality with homodyne measurements

We investigate the violation of local realism in Bell tests involving homodyne measurements performed on multimode continuous-variable states. By binning the measurement outcomes in an appropriate way, we prove that the Mermin-Klyshko inequality can be violated by an amount that grows exponentially with the number of modes. Furthermore, the maximum violation allowed by quantum mechanics can be attained for any number of modes, albeit requiring a quantum state that is rather unrealistic. Interestingly, this exponential increase of the violation holds true even for simpler states, such as multipartite GHZ states. The resulting benefit of using more modes is shown to be significant in practical multipartite Bell tests by analyzing the increase of the robustness to noise with the number of modes. In view of the high efficiency achievable with homodyne detection, our results thus open a possible way to feasible loophole-free Bell tests that are robust to experimental imperfections. We provide an explicit example of a three-mode state (a superposition of coherent states) which results in a significantly high violation of the Mermin-Klyshko inequality (around 10%) with homodyne measurements.

quant-ph↗

arXiv2007

Quantum cloning a pair of orthogonally polarized photons with linear optics

A linear optical probabilistic scheme for the optimal cloning of a pair of orthogonally-polarized photons is devised, based on single- and two-photon interferences. It consists in a partial symmetrization device, realized with a modified unbalanced Mach-Zehnder interferometer, followed by two independent Hong-Ou-Mandel interferometers. This scheme has the advantage that it enables quantum cloning without the need for stimulated amplification in a nonlinear medium. It can also be modified so to make an optical two-qubit partial SWAP gate, thereby providing a potentially useful tool to linear optics quantum computing.

quant-ph↗

arXiv2007

Quantum key distribution over 25 km with an all-fiber continuous-variable system

We report on the implementation of a reverse-reconciliated coherent-state continuous-variable quantum key distribution system, with which we generated secret keys at a rate of more than 2 kb/s over 25 km of optical fiber. Time multiplexing is used to transmit both the signal and phase reference in the same optical fiber. Our system includes all experimental aspects required for a field implementation of a quantum key distribution setup. Real-time reverse reconciliation is achieved by using fast and efficient LDPC error correcting codes.

quant-ph↗

arXiv2007

Experimental implementation of non-Gaussian attacks on a continuous-variable quantum key distribution system

An intercept-resend attack on a continuous-variable quantum-key-distribution protocol is investigated experimentally. By varying the interception fraction, one can implement a family of attacks where the eavesdropper totally controls the channel parameters. In general, such attacks add excess noise in the channel, and may also result in non-Gaussian output distributions. We implement and characterize the measurements needed to detect these attacks, and evaluate experimentally the information rates available to the legitimate users and the eavesdropper. The results are consistent with the optimality of Gaussian attacks resulting from the security proofs.

quant-ph↗

arXiv2006

Optimal multicopy asymmetric Gaussian cloning of coherent states

We investigate the asymmetric Gaussian cloning of coherent states which produces M copies from N input replicas, such that the fidelity of all copies may be different. We show that the optimal asymmetric Gaussian cloning can be performed with a single phase-insensitive amplifier and an array of beam splitters. We obtain a simple analytical expression characterizing the set of optimal asymmetric Gaussian cloning machines.

quant-ph↗

arXiv2006

Exploring scalar quantum walks on Cayley graphs

A quantum walk, \emph{i.e.}, the quantum evolution of a particle on a graph, is termed \emph{scalar} if the internal space of the moving particle (often called the coin) has a dimension one. Here, we study the existence of scalar quantum walks on Cayley graphs, which are built from the generators of a group. After deriving a necessary condition on these generators for the existence of a scalar quantum walk, we present a general method to express the evolution operator of the walk, assuming homogeneity of the evolution. We use this necessary condition and the subsequent constructive method to investigate the existence of scalar quantum walks on Cayley graphs of various groups presented with two or three generators. In this restricted framework, we classify all groups -- in terms of relations between their generators -- that admit scalar quantum walks, and we also derive the form of the most general evolution operator. Finally, we point out some interesting special cases, and extend our study to a few examples of Cayley graphs built with more than three generators.

quant-ph↗

arXiv2006

Unconditional optimality of Gaussian attacks against continuous-variable QKD

A fully general approach to the security analysis of continuous-variable quantum key distribution (CV-QKD) is presented. Provided that the quantum channel is estimated via the covariance matrix of the quadratures, Gaussian attacks are shown to be optimal against all eavesdropping strategies, including collective and coherent attacks. The proof is made strikingly simple by combining a physical model of measurement, an entanglement-based description of CV-QKD, and a recent powerful result on the extremality of Gaussian states [Phys. Rev. Lett. 96, 080502 (2006)].

quant-ph↗

arXiv2005

Optical Quantum Cloning - a Review

After a brief introduction to the quantum no-cloning theorem and its link with the linearity and causality of quantum mechanics, the concept of quantum cloning machines is sketched, following, whenever possible, the chronology of the main results. The important classes of quantum cloning machines are reviewed, in particular state-independent and state-dependent cloning machines. The 1-to-2 cloning problem is then studied from a formal point of view, using the isomorphism between completely positive maps and operators, which leads to the so-called double-Bell ansatz. This also yields an efficient numerical approach to quantum cloning, based on semidefinite programming methods. The derivation of the optimal N-to-M universal cloning machine in d dimensions is then detailed, as well as the notion of asymmetric cloning machines. In the second part of this review, the optical implementation of cloning machines is considered. It is shown that the universal cloning of photons can be achieved by parametric amplification of light or by symmetrization via the Hong-Ou-Mandel effect. The various experimental demonstrations of quantum cloning machines are reviewed. The cloning of orthogonally polarized photons is also considered, as well as the asymmetric and phase-covariant cloning of photons. Finally, the extension of quantum cloning to continuous variables is analyzed. The optimal cloning of coherent states of light by phase-insensitive amplification is explained, as well as the experimental realization of continuous-variable quantum cloning with linear optics, measurement, and feed-forward operations.

quant-ph↗

arXiv2005

Information transmission via entangled quantum states in Gaussian channels with memory

Gaussian quantum channels have recently attracted a growing interest, since they may lead to a tractable approach to the generally hard problem of evaluating quantum channel capacities. However, the analysis performed so far has always been restricted to memoryless channels. Here, we consider the case of a bosonic Gaussian channel with memory, and show that the classical capacity can be significantly enhanced by employing entangled input symbols instead of product symbols.

quant-ph↗

arXiv2005

Highly asymmetric quantum cloning in arbitrary dimension

We investigate the universal asymmetric cloning of states in a Hilbert space of arbitrary dimension. We derive the class of optimal and fully asymmetric 1->3 cloners, which produce three copies, each having a different fidelity. A simple parametric expression for the maximum achievable cloning fidelity triplets is then provided. As a side-product, we also prove the optimality of the 1->2 asymmetric cloning machines that have been proposed in the literature.

quant-ph↗

arXiv2005

Conditional generation of arbitrary single-mode quantum states of light by repeated photon subtractions

We propose a scheme for the conditional generation of arbitrary finite superpositions of (squeezed) Fock states in a single mode of a traveling optical field. The suggested setup requires only a source of squeezed states, beam splitters, strong coherent beams, and photodetectors with single-photon sensitivity. The method does not require photodetectors with a high efficiency nor with a single-photon resolution.

quant-ph↗

arXiv2005

Quantum entanglement enhances the capacity of bosonic channels with memory

The bosonic quantum channels have recently attracted a growing interest, motivated by the hope that they open a tractable approach to the generally hard problem of evaluating quantum channel capacities. These studies, however, have always been restricted to memoryless channels. Here, it is shown that the classical capacity of a bosonic Gaussian channel with memory can be significantly enhanced if entangled symbols are used instead of product symbols. For example, the capacity of a photonic channel with 70%-correlated thermal noise of one third the shot noise is enhanced by about 11% when using 3.8-dB entangled light with a modulation variance equal to the shot noise.

quant-ph↗

arXiv2004

Economical quantum cloning in any dimension

The possibility of cloning a d-dimensional quantum system without an ancilla is explored, extending on the economical phase-covariant cloning machine found in [Phys. Rev. A {\bf 60}, 2764 (1999)] for qubits. We prove the impossibility of constructing an economical version of the optimal universal cloning machine in any dimension. We also show, using an ansatz on the generic form of cloning machines, that the d-dimensional phase-covariant cloner, which optimally clones all uniform superpositions, can be realized economically only in dimension d=2. The used ansatz is supported by numerical evidence up to d=7. An economical phase-covariant cloner can nevertheless be constructed for d>2, albeit with a lower fidelity than that of the optimal cloner requiring an ancilla. Finally, using again an ansatz on cloning machines, we show that an economical version of the Fourier-covariant cloner, which optimally clones the computational basis and its Fourier transform, is also possible only in dimension d=2.

quant-ph↗

arXiv2004

Noise resistance of adiabatic quantum computation using random matrix theory

Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as well as adiabatic quantum algorithms. Unfortunately, very little is known today on the behavior of these Hamiltonian algorithms in the presence of noise. Here, we perform a fully analytical study of the resistance to noise of these algorithms using perturbation theory combined with a theoretical noise model based on random matrices drawn from the Gaussian Orthogonal Ensemble, whose elements vary in time and form a stationary random process.

quant-ph↗

arXiv2004

Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution

Turbo coding is a powerful class of forward error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-information source coding, and we investigate here its application to the reconciliation problem occurring in a continuous-variable quantum key distribution protocol.

cs.IT↗