Block-MDS QC-LDPC Codes with Application to High-Dimensional Quantum Key Distribution

High-dimensional quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we design our IR protocol to be aware of the PA step and utilize sampling to relax the requirement on the IR step without sacrificing the final key length of the PA step, allowing for more bits generated in key creation utilizing practical decoders. We provide a novel PA-aware LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys.

Authors

Institutions

Publication Details

Published
2024-11-24
DOI
https://doi.org/10.1109/itw61385.2024.10806945
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Block-MDS QC-LDPC Codes with Application to High-Dimensional Quantum Key Distribution

Jayanth Shreekumar, Murat Can Sarihan, Debarnab Mitra, Lev Tauz et al.
1 citations
Quantum Computing Algorithms and Architecture
0.35
article

Block-MDS QC-LDPC Codes with Application to High-Dimensional Quantum Key Distribution

Jayanth Shreekumar, Murat Can Sarihan, Debarnab Mitra, Lev Tauz, Chee Wei Wong, Lara Dolecek
article en
1 citations

Abstract

High-dimensional quantum key distribution (QKD) is a popular protocol that provides information theoretically secure keys to multiple parties. Two important steps of QKD are 1) the information reconciliation (IR) step, where parties reconcile mismatches in generated keys through classical communication, and 2) the privacy amplification (PA) step, where parties distill their common key into a new secure key that the adversary has little to no information about. In general, these two steps have been abstracted as two distinct problems. In this work, we design our IR protocol to be aware of the PA step and utilize sampling to relax the requirement on the IR step without sacrificing the final key length of the PA step, allowing for more bits generated in key creation utilizing practical decoders. We provide a novel PA-aware LDPC code construction known as Block-MDS QC-LDPC codes that can utilize the relaxed requirement. We demonstrate through simulations that our technique of sampling can provide notable gains in successfully creating secret keys.

University of California, Los Angeles (US)
Openalex Percentile: Top 30%
Quantum Computing Algorithms and Architecture
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Block-MDS QC-LDPC Codes with Application to High-Dimensional Quantum Key Distribution — Jayanth Shreekumar, Murat Can Sarihan, et al. · (2024) | TGRS Research Map | TGRS