Searcharxiv⌕ Search

arXiv subjects

Anthony Leverrier

Publications and source records attributed to Anthony Leverrier.

68 records · Page 4Linked to original sources
arXiv2011

Percolation of secret correlations in a network

In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks, more precisely the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

quant-ph↗
arXiv2011

Optimal eavesdropping on QKD without quantum memory

We consider the security of the BB84, six-state and SARG04 quantum key distribution protocols when the eavesdropper doesn't have access to a quantum memory. In this case, Eve's most general strategy is to measure her ancilla with an appropriate POVM designed to take advantage of the post-measurement information that will be released during the sifting phase of the protocol. After an optimization on all the parameters accessible to Eve, our method provides us with new bounds for the security of six-state and SARG04 against a memoryless adversary. In particular, for the six-state protocol we show that the maximum QBER for which a secure key can be extracted is increased from 12.6% (for collective attacks) to 20.4% with the memoryless assumption.

quant-ph↗
arXiv2011

Continuous-variable quantum key distribution protocols with a non-Gaussian modulation

In this paper, we consider continuous-variable quantum key distribution (QKD) protocols which use non-Gaussian modulations. These specific modulation schemes are compatible with very efficient error correction procedures, hence allowing the protocols to outperform previous protocols in terms of achievable range. In their simplest implementation, these protocols are secure for any linear quantum channels (hence against Gaussian attacks). We also show how the use of decoy states makes the protocols secure against arbitrary collective attacks, which implies their unconditional security in the asymptotic limit.

quant-ph↗
arXiv2011

Continuous-variable Quantum Key Distribution protocols with a discrete modulation

In this paper, we consider continuous-variable quantum key distribution with a discrete modulation, either binary or quaternary. We establish the security of these protocols against the class of collective attacks that induce a linear quantum channel. In particular, all Gaussian attacks are taken into account, as well as linear attacks which add a non-Gaussian noise. We give lower bounds for the secret key rate using extremality properties of Gaussian states.

quant-ph↗
arXiv2011

Long distance quantum key distribution with continuous variables

We present a continuous-variable quantum key distribution protocol combining a continuous but slightly non-Gaussian modulation together with a efficient reverse reconciliation scheme. We establish the security of this protocol against collective attacks which correspond to a linear quantum channel. In particular, all Gaussian attacks are considered in our framework. We show that this protocol outperforms all known practical protocols, even taking into account finite size effects.

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

Finite-size analysis of continuous-variable quantum key distribution

The goal of this paper is to extend the framework of finite size analysis recently developed for quantum key distribution to continuous-variable protocols. We do not solve this problem completely here, and we mainly consider the finite size effects on the parameter estimation procedure. Despite the fact that some questions are left open, we are able to give an estimation of the secret key rate for protocols which do not contain a postselection procedure. As expected, these results are significantly more pessimistic than the ones obtained in the asymptotic regime. However, we show that recent continuous-variable protocols are able to provide fully secure secret keys in the finite size scenario, over distances larger than 50 km.

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

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↗
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↗
arXiv2009

Efficient reconciliation protocol for discrete-variable quantum key distribution

Reconciliation is an essential part of any secret-key agreement protocol and hence of a Quantum Key Distribution (QKD) protocol, where two legitimate parties are given correlated data and want to agree on a common string in the presence of an adversary, while revealing a minimum amount of information. In this paper, we show that for discrete-variable QKD protocols, this problem can be advantageously solved with Low Density Parity Check (LDPC) codes optimized for the BSC. In particular, we demonstrate that our method leads to a significant improvement of the achievable secret key rate, with respect to earlier interactive reconciliation methods used in QKD.

cs.IT↗
arXiv2008

Multidimensional reconciliation for continuous-variable quantum key distribution

We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. The crucial feature is an eight-dimensional reconciliation method, based on the algebraic properties of octonions. Since the protocol does not use any postselection, it can be proven secure against arbitrary collective attacks, by using well-established theorems on the optimality of Gaussian attacks. By using this new coding scheme with an appropriate signal to noise ratio, the distance for secure continuous-variable quantum key distribution can be significantly extended.

quant-ph↗