Finite-size secret-key rates of discrete modulation CV QKD under passive attacks

• URL: http://arxiv.org/abs/2509.14345v1
• Date: Wed, 17 Sep 2025 18:22:07 GMT
• Title: Finite-size secret-key rates of discrete modulation CV QKD under passive attacks
• Authors: Gabriele Staffieri, Giovanni Scala, Cosmo Lupo,
• Abstract summary: conditional entropies play a fundamental role in quantum information theory.<n>We consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states.<n>We compute the Petz-R'enyi and sandwiched R'enyi conditional entropies associated with these setups, under the assumption of a passive eavesdropper.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum conditional entropies play a fundamental role in quantum information theory. In quantum key distribution, they are exploited to obtain reliable lower bounds on the secret-key rates in the finite-size regime, against collective attacks and coherent attacks under suitable assumptions. We consider continuous-variable communication protocols, where the sender Alice encodes information using a discrete modulation of phase-shifted coherent states, and the receiver Bob decodes by homodyne or heterodyne detection. We compute the Petz-R\'enyi and sandwiched R\'enyi conditional entropies associated with these setups, under the assumption of a passive eavesdropper who collects the quantum information leaked through a lossy communication line of known or bounded transmissivity. Whereas our results do not directly provide reliable key-rate estimates, they do represent useful ball-park figures. We obtain analytical or semi-analytical expressions that do not require intensive numerical calculations. These expressions serve as bounds on the key rates that may be tight in certain scenarios. We compare different estimates, including known bounds that have already appeared in the literature and new bounds. The latter are found to be tighter for very short block sizes.

Related papers

• Entropy Bounds via Hypothesis Testing and Its Applications to Two-Way Key Distillation in Quantum Cryptography [0.38233569758620045]
  Quantum key distribution (QKD) information-theoretic security, without relying on computational assumptions, by distributing quantum states.<n>In this work, we establish a rigorous connection between the key rate achievable by applying two-way key distillation, such as advantage distillation, and quantum hypothesis testing.<n>Our work shows how advances in quantum multiple hypothesis testing can directly sharpen the security analyses of QKD.
  arXiv  Detail & Related papers  (2026-02-05T16:48:03Z)
• Nonlocal Games Through Communication Complexity and Quantum Cryptography [0.0]
  This thesis explores foundational aspects of quantum information theory and quantum cryptography.<n>We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity.<n>We aim to construct an encryption scheme that prevents two distant parties from simultaneously obtaining information about a shared message.
  arXiv  Detail & Related papers  (2025-10-10T15:07:24Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Composable free-space continuous-variable quantum key distribution using discrete modulation [3.864405940022529]
  Continuous-variable (CV) quantum key distribution (QKD) allows for quantum secure communication. We present a CV QKD system using discrete modulation that is especially designed for urban atmospheric channels. This will allow to expand CV QKD networks beyond the existing fiber backbone.
  arXiv  Detail & Related papers  (2024-10-16T18:02:53Z)
• Quantum information scrambling in adiabatically-driven critical systems [49.1574468325115]
  Quantum information scrambling refers to the spread of the initially stored information over many degrees of freedom of a quantum many-body system. Here, we extend the notion of quantum information scrambling to critical quantum many-body systems undergoing an adiabatic evolution.
  arXiv  Detail & Related papers  (2024-08-05T18:00:05Z)
• Security of discrete-modulated continuous-variable quantum key distribution [4.637027109495763]
  Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security. We prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol.
  arXiv  Detail & Related papers  (2023-03-16T12:14:07Z)
• 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)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• Sending or not sending twin-field quantum key distribution with distinguishable decoy states [10.66830089114367]
  We find the external modulation of different intensity states through the test, required in those TF-QKD with post-phase compensation, shows a side channel in frequency domain. We propose a complete and undetected eavesdropping attack, named passive frequency shift attack, on sending or not-sending TF-QKD protocol. Our results emphasize the importance of practical security at source and might provide a valuable reference for the practical implementation of TF-QKD.
  arXiv  Detail & Related papers  (2021-01-27T09:37:41Z)
• Computing conditional entropies for quantum correlations [10.549307055348596]
  In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution. We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$. We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
  arXiv  Detail & Related papers  (2020-07-24T15:27:51Z)

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.