Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1110.4960 · Physical Review A

Symmetrization technique for continuous-variable quantum key distribution

Anthony Leverrier

Published Feb 27, 2012• 6 citations
arXivHTMLPDF

Abstract

We introduce a symmetrization technique that can be used as an extra step in some continuous-variable quantum key distribution protocols. By randomizing the data in phase space, one can dramatically simplify the security analysis of the protocols, in particular in the case of collective attacks. The main application of this procedure concerns protocols with postselection, for which security was established only against Gaussian attacks until now. Here, we prove that under some experimentally verifiable conditions, Gaussian attacks are optimal among all collective attacks.

DOI
10.1103/physreva.85.022339

Related papers

Simple proof that Gaussian attacks are optimal among collective attacks against continuous-variable quantum key distribution with a Gaussian modulation

Anthony Leverrier, Philippe Grangier

In this article, we give a simple proof of the fact that the optimal collective attacks against continuous-variable quantum key distribution with a Gaussian modulation are Gaussian attacks. Our proof, which makes use of symmetry properties of the protocol in phase space, is particularly relevant for the finite-key analysis of the protocol and therefore for practical applications.

arXiv:0912.4132•Physical Review A•Jun 15, 2010•70 citations

Generalized security analysis framework for continuous-variable quantum key distribution

Vladyslav C. Usenko

Security of practical continuous-variable quantum key distribution is addressed and a security analysis framework, which does not rely on phase-space symmetries of signal states and correlations, is developed. In a general purification-based approach, following optimality of Gaussian collective attacks, it is suggested to find an equivalent generally mixed two-mode state shared between the trusted parties and then purifying it using Bloch-Messiah decomposition. This allows to assess security of the schemes with arbitrary parameters, which can be typically expected in experiments. It also allows to theoretically predict the role of asymmetries of signals and correlations on security of the protocols. The method can be used for security analysis of practical continuous-variable schemes directly from the measured data without any symmetrization assumptions.

arXiv:1908.01127•Aug 3, 2019•1 citation

Security of Continuous-Variable Quantum Key Distribution via a Gaussian de Finetti Reduction

Anthony Leverrier

Establishing the security of continuous-variable quantum key distribution against general attacks in a realistic finite-size regime is an outstanding open problem in the field of theoretical quantum cryptography if we restrict our attention to protocols that rely on the exchange of coherent states. Indeed, techniques based on the uncertainty principle are not known to work for such protocols, and the usual tools based on de Finetti reductions only provide security for unrealistically large block lengths. We address this problem here by considering a new type of Gaussian de Finetti reduction, that exploits the invariance of some continuous-variable protocols under the action of the unitary group U(n) (instead of the symmetric group S_{n} as in usual de Finetti theorems), and by introducing generalized SU(2,2) coherent states. Crucially, combined with an energy test, this allows us to truncate the Hilbert space globally instead as at the single-mode level as in previous approaches that failed to provide security in realistic conditions. Our reduction shows that it is sufficient to prove the security of these protocols against Gaussian collective attacks in order to obtain security against general attacks, thereby confirming rigorously the widely held belief that Gaussian attacks are indeed optimal against such protocols.

arXiv:1701.03393•Physical Review Letters•May 16, 2017•267 citations

Security of Continuous-Variable Quantum Key Distribution Against General Attacks

Anthony Leverrier, Raúl García−Patrón, Renato Renner +1 more

We prove the security of Gaussian continuous-variable quantum key distribution with coherent states against arbitrary attacks in the finite-size regime. In contrast to previously known proofs of principle (based on the de Finetti theorem), our result is applicable in the practically relevant finite-size regime. This is achieved using a novel proof approach, which exploits phase-space symmetries of the protocols as well as the postselection technique introduced by Christandl, Koenig, and Renner [Phys. Rev. Lett. 102, 020504 (2009)].

arXiv:1208.4920•Physical Review Letters•Jan 18, 2013•255 citations

Security against Collective Attacks for a Continuous-Variable Quantum Key Distribution Protocol Using Homodyne Detection and Postselection

Ryo Namiki

We analyze the security against collective attacks for a homodyne-based continuous-variable quantum key distribution protocol using binary coherent states and postselection. We derive a lower bound of the secret key rate in an asymptotic scenario, and numerically optimize it for the case of a symmetric Gaussian channel.

arXiv:2205.11820•Journal of the Physical Society of Japan•Dec 2, 2022•2 citations

Optimizing Continuous-Variable Quantum Key Distribution with Phase-Shift Keying Modulation and Postselection

Florian Kanitschar, Christoph Pacher

A numerical security proof technique is used to analyze the security of continuous-variable quantum key distribution (CV-QKD) protocols with phase-shift keying (PSK) modulation against collective attacks in the asymptotic limit. We argue that it is sufficient to consider protocols with a maximum of eight signal states and analyze different postselection strategies for protocols with four (QPSK) and eight (8PSK) signal states for untrusted ideal and trusted nonideal detectors. We introduce a cross-shaped postselection strategy, and show that both cross-shaped and radial and angular postselection clearly outperform a radial postselection scheme (and no postselection) for QPSK protocols. For all strategies studied, we provide analytical results for the operators defining the respective regions in phase space. We outline several use cases of postselection, which can easily be introduced in the data processing of both new and existing CV-QKD systems. Motivated by the high computational effort for error correction, we study the case when a large fraction of the raw key is eliminated by postselection and observe that this can be achieved while increasing the secure key rate. Postselection can also be used to partially compensate the disadvantage of QPSK protocols over 8PSK protocols for high transmission distances, while being experimentally less demanding. Finally, we highlight that postselection can be used to reduce the key rate gap between scenarios with trusted and untrusted detectors while relying on less assumptions on Eve's power.

arXiv:2104.09454•Physical Review Applied•Sep 27, 2022•33 citations
We introduce a symmetrization technique that can be used as an extra step in some continuous-variable quantum key distribution protocols. By randomizing the data in phase space, one can dramatically simplify the security analysis of the protocols, in particular in the case of collective attacks. The main application of this procedure concerns protocols with postselection, for which security was established only against Gaussian attacks until now. Here, we prove that under some experimentally verifiable conditions, Gaussian attacks are optimal among all collective attacks.
Security of practical continuous-variable quantum key distribution is addressed and a security analysis framework, which does not rely on phase-space symmetries of signal states and correlations, is developed. In a general purification-based approach, following optimality of Gaussian collective attacks, it is suggested to find an equivalent generally mixed two-mode state shared between the trusted parties and then purifying it using Bloch-Messiah decomposition. This allows to assess security of the schemes with arbitrary parameters, which can be typically expected in experiments. It also allows to theoretically predict the role of asymmetries of signals and correlations on security of the protocols. The method can be used for security analysis of practical continuous-variable schemes directly from the measured data without any symmetrization assumptions.
Establishing the security of continuous-variable quantum key distribution against general attacks in a realistic finite-size regime is an outstanding open problem in the field of theoretical quantum cryptography if we restrict our attention to protocols that rely on the exchange of coherent states. Indeed, techniques based on the uncertainty principle are not known to work for such protocols, and the usual tools based on de Finetti reductions only provide security for unrealistically large block lengths. We address this problem here by considering a new type of Gaussian de Finetti reduction, that exploits the invariance of some continuous-variable protocols under the action of the unitary group U(n) (instead of the symmetric group S_{n} as in usual de Finetti theorems), and by introducing generalized SU(2,2) coherent states. Crucially, combined with an energy test, this allows us to truncate the Hilbert space globally instead as at the single-mode level as in previous approaches that failed to provide security in realistic conditions. Our reduction shows that it is sufficient to prove the security of these protocols against Gaussian collective attacks in order to obtain security against general attacks, thereby confirming rigorously the widely held belief that Gaussian attacks are indeed optimal against such protocols.
We prove the security of Gaussian continuous-variable quantum key distribution with coherent states against arbitrary attacks in the finite-size regime. In contrast to previously known proofs of principle (based on the de Finetti theorem), our result is applicable in the practically relevant finite-size regime. This is achieved using a novel proof approach, which exploits phase-space symmetries of the protocols as well as the postselection technique introduced by Christandl, Koenig, and Renner [Phys. Rev. Lett. 102, 020504 (2009)].
A numerical security proof technique is used to analyze the security of continuous-variable quantum key distribution (CV-QKD) protocols with phase-shift keying (PSK) modulation against collective attacks in the asymptotic limit. We argue that it is sufficient to consider protocols with a maximum of eight signal states and analyze different postselection strategies for protocols with four (QPSK) and eight (8PSK) signal states for untrusted ideal and trusted nonideal detectors. We introduce a cross-shaped postselection strategy, and show that both cross-shaped and radial and angular postselection clearly outperform a radial postselection scheme (and no postselection) for QPSK protocols. For all strategies studied, we provide analytical results for the operators defining the respective regions in phase space. We outline several use cases of postselection, which can easily be introduced in the data processing of both new and existing CV-QKD systems. Motivated by the high computational effort for error correction, we study the case when a large fraction of the raw key is eliminated by postselection and observe that this can be achieved while increasing the secure key rate. Postselection can also be used to partially compensate the disadvantage of QPSK protocols over 8PSK protocols for high transmission distances, while being experimentally less demanding. Finally, we highlight that postselection can be used to reduce the key rate gap between scenarios with trusted and untrusted detectors while relying on less assumptions on Eve's power.