Work

Arithmetic Reconciliation for CVQKD: Challenges and Feasibility

Year: 2026

Type: preprint

Abstract: Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2602.05526

Authors: Leite, Rávilla R. S., de Assis, Juliana M., Dias, Micael A., de Assis, Francisco M.

Institutions: Universidade Federal de Campina Grande, Universidade Federal de Pernambuco, Technical University of Denmark

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: European Commission, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco

Awards: G2823776494, G3146980022, G8339135

OpenAlex ID: W7127953572

Cites:

Cited by:

Related to: