Multi-matrix rate-compatible reconciliation for quantum key distribution

• URL: http://arxiv.org/abs/2001.01074v1
• Date: Sat, 4 Jan 2020 13:03:04 GMT
• Title: Multi-matrix rate-compatible reconciliation for quantum key distribution
• Authors: Chaohui Gao, Yu Guo, Dong Jiang, and Lijun Chen
• Abstract summary: Reconciliation efficiency is the most important figure for judging the quality of a reconciliation scheme. To improve reconciliation efficiency, rate-compatible technologies was proposed for key reconciliation. In this paper, a recently suggested technique called multi-matrix reconciliation is introduced into SRCR. We show that MRCR we proposed outperforms SRCR in reconciliation efficiency and throughput.
• Score: 4.112451875105169
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Key reconciliation of quantum key distribution (QKD) is the process of correcting errors caused by channel noise and eavesdropper to identify the keys of two legitimate users. Reconciliation efficiency is the most important figure for judging the quality of a reconciliation scheme. To improve reconciliation efficiency, rate-compatible technologies was proposed for key reconciliation, which is denoted as the single-matrix ratecompatible reconciliation (SRCR). In this paper, a recently suggested technique called multi-matrix reconciliation is introduced into SRCR, which is referred to as the multi-matrix rate-compatible reconciliation (MRCR), to further improve reconciliation efficiency and promote the throughput of SRCR. Simulation results show that MRCR we proposed outperforms SRCR in reconciliation efficiency and throughput.

Related papers

• Arithmetic Reconciliation for CVQKD: Challenges and Feasibility [0.0]
  A reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs.<n>Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.
  arXiv  Detail & Related papers  (2026-02-05T10:37:24Z)
• Search-R2: Enhancing Search-Integrated Reasoning via Actor-Refiner Collaboration [49.9937230730202]
  We propose Search-R2, a novel Actor-Refiner collaboration framework that enhances reasoning through targeted intervention.<n>Our approach decomposes the generation process into an Actor, which produces initial reasoning trajectories.<n>We show that Search-R2 consistently outperforms strong RAG and RL-based baselines across model scales.
  arXiv  Detail & Related papers  (2026-02-03T15:32:09Z)
• Stable and Efficient Single-Rollout RL for Multimodal Reasoning [66.53652874617217]
  $textbfMSSR$ (Multimodal Stabilized Single-Rollout) is a group-free RLVR framework that achieves both stable optimization and effective multimodal reasoning performance.<n>In in-distribution evaluations, MSSR demonstrates superior training compute efficiency, achieving similar validation accuracy to the group-based baseline with half the training steps.
  arXiv  Detail & Related papers  (2025-12-20T05:07:53Z)
• Joint Channel Estimation and Computation Offloading in Fluid Antenna-assisted MEC Networks [81.36647816787713]
  We propose an FA-assisted offloading framework to minimize the delay of channel estimation.<n>We show that the proposed system significantly reduces the accuracy under efficient communication.
  arXiv  Detail & Related papers  (2025-09-16T08:48:44Z)
• Joint parameter estimation and multidimensional reconciliation for CV-QKD [7.277058557395869]
  We propose a novel joint message-passing scheme that unifies channel parameter estimation and information reconciliation within a Bayesian framework.<n>To the best of our knowledge, this is the first work to unify multidimensional reconciliation and channel parameter estimation in CV-QKD.
  arXiv  Detail & Related papers  (2025-08-07T16:38:33Z)
• Soft Reverse Reconciliation for Discrete Modulations [0.552480439325792]
  This work introduces a reverse reconciliation softening (RRS) procedure designed for CV-QKD scenarios employing discrete modulations. We investigate how the mutual information between Alice's and Bob's variables changes when the additional metric is shared. We show numerically that RRS improves the mutual information with respect to RR with hard decoding, practically achieving the same mutual information as DR with soft decoding.
  arXiv  Detail & Related papers  (2024-11-06T17:28:28Z)
• Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion [14.542166904874147]
  Similarity Completion Matrix serves as a fundamental tool at the core of numerous machinelearning tasks. To address this issue, Similarity Matrix Theoretical (SMC) methods have been proposed, but they suffer complexity. We present two novel, scalable, and effective algorithms, which investigate the PSD property to guide the estimation process and incorporate non low-rank regularizer to ensure the low-rank solution.
  arXiv  Detail & Related papers  (2024-09-29T04:27:23Z)
• Performance of Cascade and LDPC-codes for Information Reconciliation on Industrial Quantum Key Distribution Systems [69.47813697920358]
  We analyze, simulate, optimize, and compare the performance of two prevalent algorithms used for Information Reconciliation. We focus on their applicability in practical and industrial settings, operating in realistic and application-close conditions.
  arXiv  Detail & Related papers  (2024-08-28T12:51:03Z)
• Active RIS-aided EH-NOMA Networks: A Deep Reinforcement Learning Approach [66.53364438507208]
  An active reconfigurable intelligent surface (RIS)-aided multi-user downlink communication system is investigated. Non-orthogonal multiple access (NOMA) is employed to improve spectral efficiency, and the active RIS is powered by energy harvesting (EH) An advanced LSTM based algorithm is developed to predict users' dynamic communication state. A DDPG based algorithm is proposed to joint control the amplification matrix and phase shift matrix RIS.
  arXiv  Detail & Related papers  (2023-04-11T13:16:28Z)
• Asymmetric adaptive LDPC-based information reconciliation for industrial quantum key distribution [0.0]
  We develop a new approach for asymmetric LDPC-based information reconciliation in order to adapt to the current channel state. The new scheme combines the advantages of LDPC codes, a priori error rate estimation, rate-adaptive and blind information reconciliation techniques.
  arXiv  Detail & Related papers  (2022-12-02T12:09:09Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Self-supervised Representation Learning with Relative Predictive Coding [102.93854542031396]
  Relative Predictive Coding (RPC) is a new contrastive representation learning objective. RPC maintains a good balance among training stability, minibatch size sensitivity, and downstream task performance. We empirically verify the effectiveness of RPC on benchmark vision and speech self-supervised learning tasks.
  arXiv  Detail & Related papers  (2021-03-21T01:04:24Z)
• Fully Quantized Image Super-Resolution Networks [81.75002888152159]
  We propose a Fully Quantized image Super-Resolution framework (FQSR) to jointly optimize efficiency and accuracy. We apply our quantization scheme on multiple mainstream super-resolution architectures, including SRResNet, SRGAN and EDSR. Our FQSR using low bits quantization can achieve on par performance compared with the full-precision counterparts on five benchmark datasets.
  arXiv  Detail & Related papers  (2020-11-29T03:53:49Z)
• Millimeter Wave Communications with an Intelligent Reflector: Performance Optimization and Distributional Reinforcement Learning [119.97450366894718]
  A novel framework is proposed to optimize the downlink multi-user communication of a millimeter wave base station. A channel estimation approach is developed to measure the channel state information (CSI) in real-time. A distributional reinforcement learning (DRL) approach is proposed to learn the optimal IR reflection and maximize the expectation of downlink capacity.
  arXiv  Detail & Related papers  (2020-02-24T22:18:54Z)
• Reconciliation for Practical Quantum Key Distribution with BB84 protocol [0.22099217573031674]
  We describe an explicit reconciliation method based on Turbo codes. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on discrete quantum states.
  arXiv  Detail & Related papers  (2020-02-16T20:46:18Z)
• 100Mbps Reconciliation for Quantum Key Distribution Using a Single Graphics Processing Unit [4.492558237024044]
  Experimental results indicate that GPU-based algorithm can highly improve reconciliation throughput to an average 85.67 Mbps and a maximum 102.084 Mbps with typical code rate and efficiency.
  arXiv  Detail & Related papers  (2020-01-22T12:11:43Z)

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.