Continuous-Variable QKD with key rates far above Devetak-Winter
- URL: http://arxiv.org/abs/2402.04770v1
- Date: Wed, 7 Feb 2024 11:40:18 GMT
- Title: Continuous-Variable QKD with key rates far above Devetak-Winter
- Authors: Arpan Akash Ray and Boris Skoric
- Abstract summary: Continuous-Variable Quantum Key Distribution (CVQKD) at large distances has such high noise levels that the employed error-correcting codes must have very low rate.
We propose a random-codebook reverse reconciliation scheme for CVQKD that is inspired by spread-spectrum watermarking.
- Score: 0.9355115132408679
- 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 employed error-correcting codes 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
random-codebook reverse reconciliation scheme for CVQKD that is inspired by
spread-spectrum watermarking. Our scheme has a novel way of achieving
statistical decoupling between the publicly sent reconciliation data and the
secret key. We provide a theoretical analysis of the secret key rate and we
present numerical results. The best performance is obtained when the message
size exceeds the mutual information I(X;Y) between Alice and Bob's
measurements. 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 lengths that lie far above the Devetak-Winter value I(X;Y)-I(E;Y).
Related papers
- 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) - Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - 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) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - 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) - Experimental study and pratical realization of a reconciliation method
for quantum key distribution system [0.22099217573031674]
This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol.
The proposed method accomplishes reconciliation by using QTC in the special problem of sideinformation source coding.
arXiv Detail & Related papers (2020-02-16T21:40:36Z)
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.