Information reconciliation for discretely-modulated continuous-variable quantum key distribution

• URL: http://arxiv.org/abs/2310.17548v1
• Date: Thu, 26 Oct 2023 16:44:06 GMT
• Title: Information reconciliation for discretely-modulated continuous-variable quantum key distribution
• Authors: Anthony Leverrier
• Abstract summary: We explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. We argue that this problem is nontrivial and deserves further attention.
• Score: 2.9914612342004503
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The goal of this note is to explain the reconciliation problem for continuous-variable quantum key distribution protocols with a discrete modulation. Such modulation formats are attractive since they significantly simplify experimental implementations compared to protocols with a Gaussian modulation. Previous security proofs that relied crucially on the Gaussian distribution of the input states are rendered inapplicable, and new proofs based on the entropy accumulation theorem have emerged. Unfortunately, these proofs are not compatible with existing reconciliation procedures, and necessitate a reevaluation of the reconciliation problem. We argue that this problem is nontrivial and deserves further attention. In particular, assuming it can be solved with optimal efficiency leads to overly optimistic predictions for the performance of the key distribution protocol, in particular for long distances.

Related papers

• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks [0.0]
  We consider a prepare-and-measure CVQKD protocol, where Alice chooses from a set of four coherent states and Bob performs a heterodyne measurement. We provide a security proof against coherent attacks in the finite-size regime, and compute the achievable key rate.
  arXiv  Detail & Related papers  (2024-07-03T13:18:31Z)
• General treatment of Gaussian trusted noise in continuous variable quantum key distribution [1.0499611180329804]
  A trusted device scenario assumes that an adversary has no access to imperfections such as electronic noises in the detector is expected to provide significant improvement in the key rate. Here, we develop a simple and general treatment that can incorporate the effects of Gaussian trusted noises for any protocol that uses homodyne/heterodyne measurements. In our method, a rescaling of the outcome of a noisy homodyne/heterodyne detector renders it equivalent to the outcome of a noiseless detector with a tiny additional loss.
  arXiv  Detail & Related papers  (2023-05-28T10:38:36Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Performance analysis of continuous-variable quantum key distribution using non-Gaussian states [0.0]
  In this study, we analyze the efficiency of a protocol with discrete modulation of continuous variable non-Gaussian states. We calculate the secure key generation rate against collective attacks using the fact that Eve's information can be bounded based on the protocol.
  arXiv  Detail & Related papers  (2021-12-19T11:55:17Z)
• Quantum key distribution with non-ideal heterodyne detection: composable security of discrete-modulation continuous-variable protocols [6.85316573653194]
  Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field. In doing this, we establish for the first time the composable security of discrete-modulation continuous-variable quantum key distribution in the finite-size regime.
  arXiv  Detail & Related papers  (2021-08-01T11:00:10Z)
• Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity [49.66890309455787]
  We introduce the expected co-coercivity condition, explain its benefits, and provide the first last-iterate convergence guarantees of SGDA and SCO. We prove linear convergence of both methods to a neighborhood of the solution when they use constant step-size. Our convergence guarantees hold under the arbitrary sampling paradigm, and we give insights into the complexity of minibatching.
  arXiv  Detail & Related papers  (2021-06-30T18:32:46Z)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation [0.3222802562733786]
  We establish an analytical lower bound on the secret key rate of continuous-variable quantum key distribution with an arbitrary modulation of coherent states. We show that relatively small constellation sizes, with say 64 states, are essentially sufficient to obtain a performance close to a true Gaussian modulation.
  arXiv  Detail & Related papers  (2021-03-25T16:05:22Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.