Continuous-Variable Quantum Key Distribution with key rates far above the PLOB bound

• URL: http://arxiv.org/abs/2402.04770v2
• Date: Fri, 04 Oct 2024 13:22:30 GMT
• Title: Continuous-Variable Quantum Key Distribution with key rates far above the PLOB bound
• Authors: Arpan Akash Ray, Boris Skoric,
• Abstract summary: We provide an analysis of the secret key rate for the case of Gaussian collective attacks. We obtain secret key rates far above the Devetak-Winter value $I(X;Y) - I(E;Y)$, which is the upper bound in the case of one-way error correction.
• Score: 0.7918886297003017
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous-Variable Quantum Key Distribution (CVQKD) at large distances has such high noise levels that the error-correcting code must have very low rate. In this regime it becomes feasible to implement random-codebook error correction, which is known to perform close to capacity. We propose a reverse reconciliation scheme for CVQKD in which the first step is advantage distillation based on random-codebook error correction operated above the Shannon limit. Our scheme has a novel way of achieving statistical decoupling between the public reconciliation data and the secret key. We provide an analysis of the secret key rate for the case of Gaussian collective attacks, and we present numerical results. The best performance is obtained when the message size exceeds the mutual information $I(X;Y)$ between Alice's quadratures $X$ and Bob's measurements $Y$, i.e. the Shannon limit. This somewhat counter-intuitive result is understood from a tradeoff between code rate and frame rejection rate, combined with the fact that error correction for QKD needs to reconcile only random data. We obtain secret key rates that lie far above the Devetak-Winter value $I(X;Y) - I(E;Y)$, which is the upper bound in the case of one-way error correction. Furthermore, our key rates lie above the PLOB bound for Continuous-Variable detection, but below the PLOB bound for Discrete-Variable detection.

Related papers

• Random coding for long-range continuous-variable QKD [0.18907108368038208]
  Quantum Key Distribution (QKD) schemes are key exchange protocols based on the physical properties of quantum channels.<n>In this paper we introduce a random-codebook error correction method that is suitable for long range CVQKD.
  arXiv  Detail & Related papers  (2025-12-17T21:45:59Z)
• An exact Error Threshold of Surface Code under Correlated Nearest-Neighbor Errors: A Statistical Mechanical Analysis [1.8787735186976828]
  Current exact surface code threshold analyses are based on the assumption of independent and identically distributed (i.i.d.) errors.<n>Here, we establish an error-edge map, which allows for the mapping of quantum error correction to a square-octagonal random bond Ising model.<n>We then present the exact threshold under a realistic noise model that combines independent single-qubit errors with correlated errors between nearest-neighbor data qubits.
  arXiv  Detail & Related papers  (2025-10-28T08:35:07Z)
• Finite-size secret-key rates of discrete modulation CV QKD under passive attacks [0.0]
  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.
  arXiv  Detail & Related papers  (2025-09-17T18:22:07Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Continuous K-Max Bandits [54.21533414838677]
  We study the $K$-Max multi-armed bandits problem with continuous outcome distributions and weak value-index feedback. This setting captures critical applications in recommendation systems, distributed computing, server scheduling, etc. Our key contribution is the computationally efficient algorithm DCK-UCB, which combines adaptive discretization with bias-corrected confidence bounds.
  arXiv  Detail & Related papers  (2025-02-19T06:37:37Z)
• Wasserstein-regularized Conformal Prediction under General Distribution Shift [21.29977879431466]
  Conformal prediction yields a prediction set with guaranteed $1-alpha$ coverage of the true target under the i.i.d. assumption. We propose a Wasserstein distance-based upper bound of the coverage gap and analyze the bound using probability measure pushforwards. We exploit the separation to design an algorithm based on importance weighting and regularized representation learning (WR-CP) to reduce the Wasserstein bound with a finite-sample error bound.
  arXiv  Detail & Related papers  (2025-01-23T07:29:44Z)
• The random coupled-plaquette gauge model and the surface code under circuit-level noise [1.351813974961217]
  We optimally account for genuine Y-errors in the surface code in a setting with noisy measurements. We tackle the circuit-level noise scenario, where we use a reduction technique to find effective asymmetric depolarizing and syndrome noise rates.
  arXiv  Detail & Related papers  (2024-12-18T16:20:14Z)
• Semiparametric conformal prediction [79.6147286161434]
  Risk-sensitive applications require well-calibrated prediction sets over multiple, potentially correlated target variables. We treat the scores as random vectors and aim to construct the prediction set accounting for their joint correlation structure. We report desired coverage and competitive efficiency on a range of real-world regression problems.
  arXiv  Detail & Related papers  (2024-11-04T14:29:02Z)
• Better-than-KL PAC-Bayes Bounds [23.87003743389573]
  We show that it is possible to achieve a strictly tighter bound with a novel and better-than-KL divergence. Our result is first-of-its-kind in that existing PAC-Bayes bounds with non-KL divergences are not known to be strictly better than KL.
  arXiv  Detail & Related papers  (2024-02-14T14:33:39Z)
• Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Towards Optimal Statistical Watermarking [95.46650092476372]
  We study statistical watermarking by formulating it as a hypothesis testing problem. Key to our formulation is a coupling of the output tokens and the rejection region. We characterize the Uniformly Most Powerful (UMP) watermark in the general hypothesis testing setting.
  arXiv  Detail & Related papers  (2023-12-13T06:57:00Z)
• Precise Phase Error Rate Analysis for Quantum Key Distribution with Phase Postselection [14.638851224694692]
  Quantum key distribution (QKD) stands as a pioneering method for establishing information-theoretically secure communication channels. Here we make a precise phase error rate analysis for QKD protocols with phase postselection. We further apply our analysis in sending-or-not-sending twin-field quantum key distribution (SNS-TFQKD) and mode-pairing quantum key distribution (MP-QKD)
  arXiv  Detail & Related papers  (2023-12-11T13:49:40Z)
• Converging State Distributions for Discrete Modulated CVQKD Protocols [2.4366811507669124]
  We show that the loss of secret key rate quickly falls below $10-5$ as the distance increases. By using a 256-QAM with Gauss-Hermite shaping, the loss of secret key rate quickly falls below $10-5$ as the distance increases.
  arXiv  Detail & Related papers  (2023-05-10T22:28:16Z)
• Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms [59.8188496313214]
  We study the semi-bandits (CMAB) and focus on reducing the dependency of the batch-size $K$ in the regret bound. First, for the setting of CMAB with probabilistically triggered arms (CMAB-T), we propose a BCUCB-T algorithm with variance-aware confidence intervals. Second, for the setting of non-triggering CMAB with independent arms, we propose a SESCB algorithm which leverages on the non-triggering version of the TPVM condition.
  arXiv  Detail & Related papers  (2022-08-31T13:09:39Z)
• Finite-key analysis for quantum key distribution with discrete phase randomization [21.561489948824274]
  We develop a technique based on conjugate measurement and quantum state distinguishment to ana-lyze the security. Our result shows that TF-QKD with reasonable number of discrete random phases, e.g. 8 phases from 0, pi/4, pi/2,..., 7pi/4, can achieve satisfactory performance.
  arXiv  Detail & Related papers  (2022-01-09T15:45:44Z)
• 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)
• On the Practicality of Differential Privacy in Federated Learning by Tuning Iteration Times [51.61278695776151]
  Federated Learning (FL) is well known for its privacy protection when training machine learning models among distributed clients collaboratively. Recent studies have pointed out that the naive FL is susceptible to gradient leakage attacks. Differential Privacy (DP) emerges as a promising countermeasure to defend against gradient leakage attacks.
  arXiv  Detail & Related papers  (2021-01-11T19:43:12Z)
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [0.0]
  We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings. We then establish a connection between covert communication and deniability to propose DC-QKE. We present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.
  arXiv  Detail & Related papers  (2020-03-25T22:20:47Z)

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.