Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Müller, Ronny, Ribezzo, Domenico, Zahidy, Mujtaba, Oxenløwe, Leif Katsuo, Bacco, Davide, Forchhammer, Søren
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914051501588480
author Müller, Ronny
Ribezzo, Domenico
Zahidy, Mujtaba
Oxenløwe, Leif Katsuo
Bacco, Davide
Forchhammer, Søren
author_facet Müller, Ronny
Ribezzo, Domenico
Zahidy, Mujtaba
Oxenløwe, Leif Katsuo
Bacco, Davide
Forchhammer, Søren
contents The Information Reconciliation phase in quantum key distribution has significant impact on the range and throughput of any QKD system. We explore this stage for high-dimensional QKD implementations and introduce two novel methods for reconciliation. 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.
format Preprint
id arxiv_https___arxiv_org_abs_2307_02225
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution
Müller, Ronny
Ribezzo, Domenico
Zahidy, Mujtaba
Oxenløwe, Leif Katsuo
Bacco, Davide
Forchhammer, Søren
Quantum Physics
The Information Reconciliation phase in quantum key distribution has significant impact on the range and throughput of any QKD system. We explore this stage for high-dimensional QKD implementations and introduce two novel methods for reconciliation. 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.
title Efficient Information Reconciliation for High-Dimensional Quantum Key Distribution
topic Quantum Physics
url https://arxiv.org/abs/2307.02225