Asymmetric adaptive LDPC-based information reconciliation for industrial
quantum key distribution
- URL: http://arxiv.org/abs/2212.01121v1
- Date: Fri, 2 Dec 2022 12:09:09 GMT
- Title: Asymmetric adaptive LDPC-based information reconciliation for industrial
quantum key distribution
- Authors: Nikolay Borisov, Ivan Petrov and Andrey Tayduganov
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We develop a new approach for asymmetric LDPC-based information
reconciliation in order to adapt to the current channel state and achieve
better performance and scalability in practical resource-constrained QKD
systems. The new scheme combines the advantages of LDPC codes, a priori error
rate estimation, rate-adaptive and blind information reconciliation techniques.
We compare the performance of several asymmetric and symmetric error correction
schemes using real industrial QKD setup. The proposed asymmetric algorithm
achieves significantly higher throughput, providing a secret key rate very
close to the symmetric one in a wide range of error rates. Thus, our approach
turns out to be particularly efficient for applications with high key rates,
limited classical channel capacity and asymmetric computational resource
allocation.
Related papers
- Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation [5.373015313199384]
Identifying optimal join orders (JOs) is a key challenge in database research and engineering.
Recent efforts have successfully explored reinforcement learning (RL) for JO.
We present a novel approach that uses quantum reinforcement learning (QRL) for JO based on a hybrid variational quantum ansatz.
arXiv Detail & Related papers (2024-05-13T14:14:12Z) - Parameter-Adaptive Approximate MPC: Tuning Neural-Network Controllers without Retraining [50.00291020618743]
This work introduces a novel, parameter-adaptive AMPC architecture capable of online tuning without recomputing large datasets and retraining.
We showcase the effectiveness of parameter-adaptive AMPC by controlling the swing-ups of two different real cartpole systems with a severely resource-constrained microcontroller (MCU)
Taken together, these contributions represent a marked step toward the practical application of AMPC in real-world systems.
arXiv Detail & Related papers (2024-04-08T20:02:19Z) - Asymmetric mode-pairing quantum key distribution [4.122493139863035]
Mode-pairing quantum key distribution (MP-QKD) can surpass the repeaterless rate-transmittance bound without requiring global phase locking.
MP-QKD necessitates equal communication distances in two channels, which is a challenging requirement in practical applications.
We introduce an optimal-pulse-intensity method, adaptable to various scenarios, to enhance key rates by calculating ideal pulse intensities.
arXiv Detail & Related papers (2024-01-03T13:06:29Z) - Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution [2.4277680835263005]
We introduce two novel methods for reconciliation in high-dimensional QKD systems.
The methods are based on nonbinary LDPC codes and the Cascade algorithm, and achieve efficiencies close the the Slepian-Wolf bound on q-ary symmetric channels.
arXiv Detail & Related papers (2023-07-05T12:06:27Z) - Fair and Efficient Distributed Edge Learning with Hybrid Multipath TCP [62.81300791178381]
The bottleneck of distributed edge learning over wireless has shifted from computing to communication.
Existing TCP-based data networking schemes for DEL are application-agnostic and fail to deliver adjustments according to application layer requirements.
We develop a hybrid multipath TCP (MP TCP) by combining model-based and deep reinforcement learning (DRL) based MP TCP for DEL.
arXiv Detail & Related papers (2022-11-03T09:08:30Z) - Model-based Deep Learning Receiver Design for Rate-Splitting Multiple
Access [65.21117658030235]
This work proposes a novel design for a practical RSMA receiver based on model-based deep learning (MBDL) methods.
The MBDL receiver is evaluated in terms of uncoded Symbol Error Rate (SER), throughput performance through Link-Level Simulations (LLS) and average training overhead.
Results reveal that the MBDL outperforms by a significant margin the SIC receiver with imperfect CSIR.
arXiv Detail & Related papers (2022-05-02T12:23:55Z) - Reliably-stabilizing piecewise-affine neural network controllers [5.203329540700177]
A common problem affecting neural network (NN) approximations of model predictive control (MPC) policies is the lack of analytical tools to assess the stability of the closed-loop system under the action of the NN-based controller.
We present a general procedure to quantify the performance of such a controller, or to design minimum complexity NNs that preserve the desirable properties of a given MPC scheme.
arXiv Detail & Related papers (2021-11-13T20:01:43Z) - DESTRESS: Computation-Optimal and Communication-Efficient Decentralized
Nonconvex Finite-Sum Optimization [43.31016937305845]
Internet-of-things, networked sensing, autonomous systems and federated learning call for decentralized algorithms for finite-sum optimizations.
We develop DEcentralized STochastic REcurSive methodDESTRESS for non finite-sum optimization.
Detailed theoretical and numerical comparisons show that DESTRESS improves upon prior decentralized algorithms.
arXiv Detail & Related papers (2021-10-04T03:17:41Z) - OptiDICE: Offline Policy Optimization via Stationary Distribution
Correction Estimation [59.469401906712555]
We present an offline reinforcement learning algorithm that prevents overestimation in a more principled way.
Our algorithm, OptiDICE, directly estimates the stationary distribution corrections of the optimal policy.
We show that OptiDICE performs competitively with the state-of-the-art methods.
arXiv Detail & Related papers (2021-06-21T00:43:30Z) - Amortized Conditional Normalized Maximum Likelihood: Reliable Out of
Distribution Uncertainty Estimation [99.92568326314667]
We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation.
Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle.
We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
arXiv Detail & Related papers (2020-11-05T08:04:34Z) - Adaptive Subcarrier, Parameter, and Power Allocation for Partitioned
Edge Learning Over Broadband Channels [69.18343801164741]
partitioned edge learning (PARTEL) implements parameter-server training, a well known distributed learning method, in wireless network.
We consider the case of deep neural network (DNN) models which can be trained using PARTEL by introducing some auxiliary variables.
arXiv Detail & Related papers (2020-10-08T15:27:50Z)
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.