High-Capacity Multi-Copy Quantum Key Distribution via Hypercontractive Complexity Games

Abstract The rate-loss trade-off in repeaterless quantum key distribution (QKD) bounds the secret key capacity of optical links. The Quantum Computational Timelock (QCT) framework overcomes this limit by utilizing the difference between computational security and quantum memory coherence times. We introduce the Information Reconciled Khot-Vishnoi (IR-KV-QCT) protocol, which maps the Khot-Vishnoi communication complexity game onto a high-dimensional prepare-and-measure QKD scheme under the QCT framework. Using a large-alphabet phase encoding, the protocol transmits $\log_2 n$ bits per qudit and corrects phase-alignment and channel-induced decoding errors via non-binary Slepian-Wolf Information Reconciliation. To combat channel attenuation, the protocol transmits identical copies of each state. We prove that this multi-copy ensemble is confined to the symmetric subspace, whereby Holevo's theorem strictly bounds the adversary's accessible information from an immediate measurement. Furthermore, we demonstrate that current and near-future quantum error correction thresholds are insufficient to sustain coherent attacks under the QCT framework, thereby limiting the operational threat model to collective attacks. Under this constraint, we bound the adversary's accessible information and prove the security of the protocol using the hypercontractivity of the Khot-Vishnoi game. This exponential suppression of information extraction supports a secure multi-copy transmission threshold of $\mathcal{O}(n / \log_2 n)$. Consequently, the protocol circumvents the exponential rate-loss decay of single-photon schemes, enabling high-capacity key rates with everlasting security against collective attacks.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-16
DOI
https://doi.org/10.21203/rs.3.rs-10354796/v1
Primary Topic
Quantum Information and Cryptography
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

High-Capacity Multi-Copy Quantum Key Distribution via Hypercontractive Complexity Games

Nilesh Vyas
1 links
Research Square
Quantum Information and Cryptography
preprint

High-Capacity Multi-Copy Quantum Key Distribution via Hypercontractive Complexity Games

Nilesh Vyas
preprint en

Abstract

Abstract The rate-loss trade-off in repeaterless quantum key distribution (QKD) bounds the secret key capacity of optical links. The Quantum Computational Timelock (QCT) framework overcomes this limit by utilizing the difference between computational security and quantum memory coherence times. We introduce the Information Reconciled Khot-Vishnoi (IR-KV-QCT) protocol, which maps the Khot-Vishnoi communication complexity game onto a high-dimensional prepare-and-measure QKD scheme under the QCT framework. Using a large-alphabet phase encoding, the protocol transmits $\log_2 n$ bits per qudit and corrects phase-alignment and channel-induced decoding errors via non-binary Slepian-Wolf Information Reconciliation. To combat channel attenuation, the protocol transmits identical copies of each state. We prove that this multi-copy ensemble is confined to the symmetric subspace, whereby Holevo's theorem strictly bounds the adversary's accessible information from an immediate measurement. Furthermore, we demonstrate that current and near-future quantum error correction thresholds are insufficient to sustain coherent attacks under the QCT framework, thereby limiting the operational threat model to collective attacks. Under this constraint, we bound the adversary's accessible information and prove the security of the protocol using the hypercontractivity of the Khot-Vishnoi game. This exponential suppression of information extraction supports a secure multi-copy transmission threshold of $\mathcal{O}(n / \log_2 n)$. Consequently, the protocol circumvents the exponential rate-loss decay of single-photon schemes, enabling high-capacity key rates with everlasting security against collective attacks.

Research Square
Airbus (Germany) (DE)
Quantum Information and Cryptography
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.

Laika access coming soon