Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation

• URL: http://arxiv.org/abs/2103.13945v3
• Date: Mon, 6 Sep 2021 11:29:16 GMT
• Title: Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation
• Authors: Aur\'elie Denys, Peter Brown, Anthony Leverrier
• Abstract summary: 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.
• Score: 0.3222802562733786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We establish an analytical lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation of coherent states. Previously, such bounds were only available for protocols with a Gaussian modulation, and numerical bounds existed in the case of simple phase-shift-keying modulations. The latter bounds were obtained as a solution of convex optimization problems and our new analytical bound matches the results of Ghorai et al. (2019), up to numerical precision. The more relevant case of quadrature amplitude modulation (QAM) could not be analyzed with the previous techniques, due to their large number of coherent states. Our bound shows that relatively small constellation sizes, with say 64 states, are essentially sufficient to obtain a performance close to a true Gaussian modulation and are therefore an attractive solution for large-scale deployment of continuous-variable quantum key distribution. We also derive similar bounds when the modulation consists of arbitrary states, not necessarily pure.

Related papers

• Security bounds for unidimensional discrete-modulated CV-QKD: a Gaussian extremality approach [36.94429692322632]
  Security bounds for 1D discrete-modulated quantum key distribution protocols are determined.<n>We show that the Gaussian extremality assumption systematically overestimates Eve's information with increasing constellation size.<n>Our results highlight the necessity of alternative methods or optimized non-modulated constellation designs for this class of protocols.
  arXiv  Detail & Related papers  (2026-03-05T13:45:55Z)
• Rethinking quantum smooth entropies: Tight one-shot analysis of quantum privacy amplification [12.891210250935146]
  We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification)<n>Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements.<n>We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms.
  arXiv  Detail & Related papers  (2026-03-04T19:00:01Z)
• Exploring Variational Entanglement Hamiltonians [0.0]
  We analyze the convergence properties of the variationally obtained solutions and compare them to numerically exact calculations in quantum critical systems.<n>We demonstrate that interpreting the cost functional as an integral permits the deployment of iterative quadrature schemes.<n>We also show that a modified ansatz captures deviations from the Bisognano-Wichmann form in lattice models, improves convergence, and provides a cost-function-level diagnostic for quantum phase transitions.
  arXiv  Detail & Related papers  (2025-05-15T17:41:14Z)
• Efficient Hamiltonian, structure and trace distance learning of Gaussian states [2.949446809950691]
  We show that it is possible to learn the underlying interaction graph in a similar setting and sample complexity. Our results put the status of the quantum Hamiltonian learning problem for continuous variable systems in a much more advanced state.
  arXiv  Detail & Related papers  (2024-11-05T15:07:20Z)
• 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)
• Information reconciliation for discretely-modulated continuous-variable quantum key distribution [2.9914612342004503]
  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.
  arXiv  Detail & Related papers  (2023-10-26T16:44:06Z)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond [63.59034509960994]
  We study shuffling-based variants: minibatch and local Random Reshuffling, which draw gradients without replacement. For smooth functions satisfying the Polyak-Lojasiewicz condition, we obtain convergence bounds which show that these shuffling-based variants converge faster than their with-replacement counterparts. We propose an algorithmic modification called synchronized shuffling that leads to convergence rates faster than our lower bounds in near-homogeneous settings.
  arXiv  Detail & Related papers  (2021-10-20T02:25:25Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• 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)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• 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)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.