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

IEEE Access

On the Discretized Gaussian Modulation (DGM)- Based Continuous Variable-QKD

Ivan B. Djordjević

Published Jan 1, 2019• 20 citations
Publisher

Abstract

To overcome the low reconciliation efficiency problem of Gaussian modulation (GM)-based-continuous variable (CV)-quantum key distribution (QKD), in this paper, we propose to use discretized GM (DGM)-based-CV-QKD. The proposed CV-QKD scheme has complexity and reconciliation efficiency similar to that of discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of the nonexistence of strict security proofs for the DM-CV-QKD under the collective attacks. We demonstrate that the 32-points-based DGM CV-QKD can closely approach the theoretical SKR-limit in medium and high channel losses regimes. On the other hand, the 64-points-based DGM CV-QKD scheme closely approaches the SKR-limit for all channel losses.

DOI
10.1109/access.2019.2917587

Related papers

Discretized Gaussian Modulation-Based Continuous Variable (CV)-QKD

Ivan B. Djordjević

To overcome the low-reconciliation-efficiency problem of Gaussian modulation (GM)-based-CV-QKD, we propose to use discretized-GM-based-CV-QKD. This scheme has complexity and reconciliation-efficiency similar to discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of nonexistence of strict security proofs for DM-CV-QKD under collective attacks.

IEEE Photonics Conference•Sep 1, 2019•2 citations

Reconciliation Efficiency Impact on Discrete Modulated CV-QKD Systems Key Rates

Margarida Almeida, Daniel Pereira, M. Facão +2 more

Continuous variable quantum key distribution (CV-QKD) allows the distribution of symmetric keys in a secure manner. CV-QKD systems can extract keys at its maximum rate when using Gaussian modulation (GM). Nonetheless, GM demands high-capacity random number sources and tends to be very hard to approach in practice. To circumvent these disadvantages, higher-order probabilistic -shaped discrete modulation (DM) can be used. State-of-the-art works compute the key rates of DM-CV-QKD systems considering a fixed value for the reconciliation efficiency and do not take into account the frame error rate (FER) of the system, thus over or under estimating the key rates. In this work, we study the security bounds of CV-QKD systems considering probabilistic shaped DM formats with 256-symbols in the finite-size regime. This accounting for the true value of the reconciliation efficiency, and the FER of the information reconciliation step. Both conventional and hexagonal 256-quadrature amplitude modulation (QAM) constellations yield higher key rates than 256-amplitude and phase shift keying (APSK) constellations, with 256-QAM constellations being indistinguishable in performance with GM for high transmission distances. Minimum signal-to-noise ratio (SNR) values were fixed from a FER analysis through a CV-QKD simulation allowing for key extraction considering different FER levels. Lower FER values are associated with higher SNRs in the system and thus lower achievable transmission distances. Nonetheless, the FER maximizing the extraction key rate is not null. Our results show that the extraction key rate is maximized by SNR adjustment which should have in account both the reconciliation efficiency and the FER.

Journal of Lightwave Technology•May 25, 2023•14 citations

Discrete-modulated continuous-variable quantum key distribution with a machine-learning-based detector

Jiawei Li, Ying Guo, Xudong Wang +3 more

The discrete-modulated continuous-variable quantum key distribution (DM-CV-QKD) could break the distance limitation of Gaussian-modulated CV-QKD. In practice, the high-performance error correction code plays an important role in DM-CV-QKD and affects the secure transmission distance. However, DM-CV-QKD usually works under low signal-to-noise ratio (SNR) and the design of high-performance error correction code under this condition is difficult, so that it would impose a limitation on further improvement of the secure distance. We propose a DM-CV-QKD with the machine-learning-based detector to further improve the secure distance. The numerical result shows that the proposed scheme could validly improve the system performance. Viewed from another perspective, the proposed scheme could be employed to overcome various impairments induced by the channel and thereby lower the demand of error correction codes on the SNR threshold of the quantum channel without compromising the system performance. The proposed scheme opens the door to applying machine leaning to directly process the raw secret key and improve the performance for CV-QKD systems.

Optical Engineering•Jun 14, 2018•14 citations

The security of practical post-selection in Gaussian-modulated continuous-variable quantum key distribution

Adam Alderton, Weerasinghe Weerasinghe, Muataz Alhussein +2 more

Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.

npj Quantum Information•Sep 26, 2026•0 citations

Optimization of continuous variables quantum key distribution using discrete modulation

Daniel Pereira, Nuno A. Silva, Margarida Almeida +1 more

Continuous Variables Quantum Key Distribution (CV-QKD) tackles the problem of the generation and distribution of cryptographic keys without assuming any computational limitations while employing standard telecom equipment. Gaussian Modulation (GM) theoretically maximizes the information a CV-QKD system is capable of transmitting while exhibiting a higher resistance to excess channel noise. However, GM-CV-QKD protocols put an extreme burden on the transmitter’s random number source and tend to be more susceptible to imperfect state preparation. Due to these difficulties, most experimental implementations of CV-QKD have used Discrete Modulation (DM). The closer the DM constellation approaches a GM one, the closer the theoretical performance of the associated system will be to the optimum value. To achieve this, high-cardinality constellations, coupled with probabilistic shaping, can be explored. However, choosing a too complex constellation will cause the modulation stage imperfections to again become apparent. Thus, the choice of the constellation format is not direct and is of high importance. In this work we present a methodology to determine the optimum constellation for a given DM-CV-QKD system, taking into account the limitations of the modulation stage, choosing from a variety of M-QAM and M-APSK constellations coupled with probabilistic shaping. Our obtained methodology will allow for the optimum modulation format for each specific system to be selected.

Emerging Imaging and Sensing Technologies for Security and Defence•Nov 4, 2022•0 citations

Asymptotic security of discrete-modulation protocols for continuous-variable quantum key distribution

Eneet Kaur, Saikat Guha, Mark M. Wilde

We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.

arXiv:1901.10099•Physical Review A•Jan 15, 2021•52 citations
To overcome the low reconciliation efficiency problem of Gaussian modulation (GM)-based-continuous variable (CV)-quantum key distribution (QKD), in this paper, we propose to use discretized GM (DGM)-based-CV-QKD. The proposed CV-QKD scheme has complexity and reconciliation efficiency similar to that of discrete modulation (DM)-based-CV-QKD and at the same time solves for the problem of the nonexistence of strict security proofs for the DM-CV-QKD under the collective attacks. We demonstrate that the 32-points-based DGM CV-QKD can closely approach the theoretical SKR-limit in medium and high channel losses regimes. On the other hand, the 64-points-based DGM CV-QKD scheme closely approaches the SKR-limit for all channel losses.
Continuous variable quantum key distribution (CV-QKD) allows the distribution of symmetric keys in a secure manner. CV-QKD systems can extract keys at its maximum rate when using Gaussian modulation (GM). Nonetheless, GM demands high-capacity random number sources and tends to be very hard to approach in practice. To circumvent these disadvantages, higher-order probabilistic -shaped discrete modulation (DM) can be used. State-of-the-art works compute the key rates of DM-CV-QKD systems considering a fixed value for the reconciliation efficiency and do not take into account the frame error rate (FER) of the system, thus over or under estimating the key rates. In this work, we study the security bounds of CV-QKD systems considering probabilistic shaped DM formats with 256-symbols in the finite-size regime. This accounting for the true value of the reconciliation efficiency, and the FER of the information reconciliation step. Both conventional and hexagonal 256-quadrature amplitude modulation (QAM) constellations yield higher key rates than 256-amplitude and phase shift keying (APSK) constellations, with 256-QAM constellations being indistinguishable in performance with GM for high transmission distances. Minimum signal-to-noise ratio (SNR) values were fixed from a FER analysis through a CV-QKD simulation allowing for key extraction considering different FER levels. Lower FER values are associated with higher SNRs in the system and thus lower achievable transmission distances. Nonetheless, the FER maximizing the extraction key rate is not null. Our results show that the extraction key rate is maximized by SNR adjustment which should have in account both the reconciliation efficiency and the FER.
The discrete-modulated continuous-variable quantum key distribution (DM-CV-QKD) could break the distance limitation of Gaussian-modulated CV-QKD. In practice, the high-performance error correction code plays an important role in DM-CV-QKD and affects the secure transmission distance. However, DM-CV-QKD usually works under low signal-to-noise ratio (SNR) and the design of high-performance error correction code under this condition is difficult, so that it would impose a limitation on further improvement of the secure distance. We propose a DM-CV-QKD with the machine-learning-based detector to further improve the secure distance. The numerical result shows that the proposed scheme could validly improve the system performance. Viewed from another perspective, the proposed scheme could be employed to overcome various impairments induced by the channel and thereby lower the demand of error correction codes on the SNR threshold of the quantum channel without compromising the system performance. The proposed scheme opens the door to applying machine leaning to directly process the raw secret key and improve the performance for CV-QKD systems.
Abstract Gaussian-modulated coherent-state (GMCS) continuous-variable quantum key distribution (CV-QKD) offers a practical path to quantum-secured communication owing to its compatibility with existing optical fibre networks and use of mature security proofs. Achieving high secret key rates in real-time systems, however, requires post-processing schemes that are both information-theoretically efficient and computationally scalable. In previous experimental work 1 , we have demonstrated record real-time key rates using a one-round sliced reconciliation scheme with guard-band post-selection. Here, we present the corresponding theoretical framework and provide an asymptotic security analysis that considers arbitrary collective attacks, a much broader class of attacks than the usually assumed Gaussian collective attacks. The security analysis applies the entropic continuity of quantum channels justified by a quantum channel estimation procedure. In conditions of high noise, our scheme uses 500 times less classical communication than multidimensional reconciliation.
Continuous Variables Quantum Key Distribution (CV-QKD) tackles the problem of the generation and distribution of cryptographic keys without assuming any computational limitations while employing standard telecom equipment. Gaussian Modulation (GM) theoretically maximizes the information a CV-QKD system is capable of transmitting while exhibiting a higher resistance to excess channel noise. However, GM-CV-QKD protocols put an extreme burden on the transmitter’s random number source and tend to be more susceptible to imperfect state preparation. Due to these difficulties, most experimental implementations of CV-QKD have used Discrete Modulation (DM). The closer the DM constellation approaches a GM one, the closer the theoretical performance of the associated system will be to the optimum value. To achieve this, high-cardinality constellations, coupled with probabilistic shaping, can be explored. However, choosing a too complex constellation will cause the modulation stage imperfections to again become apparent. Thus, the choice of the constellation format is not direct and is of high importance. In this work we present a methodology to determine the optimum constellation for a given DM-CV-QKD system, taking into account the limitations of the modulation stage, choosing from a variety of M-QAM and M-APSK constellations coupled with probabilistic shaping. Our obtained methodology will allow for the optimum modulation format for each specific system to be selected.
We consider discrete-modulation protocols for continuous-variable quantum key distribution (CV-QKD) that employ a modulation constellation consisting of a finite number of coherent states and that use a homodyne- or a heterodyne-detection receiver. We establish a security proof for collective attacks in the asymptotic regime, and we provide a formula for an achievable secret-key rate. Previous works established security proofs for discrete-modulation CV-QKD protocols that use two or three coherent states. The main constituents of our approach include approximating a complex, isotropic Gaussian probability distribution by a finite-size Gauss-Hermite constellation, applying entropic continuity bounds, and leveraging previous security proofs for Gaussian-modulation protocols. As an application of our method, we calculate secret-key rates achievable over a lossy thermal bosonic channel. We show that the rates for discrete-modulation protocols approach the rates achieved by a Gaussian-modulation protocol as the constellation size is increased. For pure-loss channels, our results indicate that in the high-loss regime and for sufficiently large constellation size, the achievable key rates scale optimally, i.e., proportional to the channel's transmissivity.