Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Optik

Error reconciliation for practical quantum cryptography

Feng Zhao, Mingxing Fu, Faqiang Wang, Lu Yi-Qun, Changjun Liao, Songhao Liu

Published Aug 9, 2006• 21 citations
Publisher
DOI
10.1016/j.ijleo.2006.05.013

Related papers

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov +1 more

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.

Journal of Experimental and Theoretical Physics•Aug 1, 2005•8 citations

Error correction in quantum cryptography

El Ashmawy, Mohamed Salah

•Jan 1, 2005•2 citations

Practical error-correction procedures in quantum cryptography

A. P. Makkaveev, S. N. Molotkov, D. I. Pomozov +1 more

Quantum cryptography (secure key distribution) systems must include procedures for correcting errors in the raw key transmitted over a quantum communication channel. Several reconciliation protocols are discussed and compared in terms of efficiency.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 24, 2006•3 citations

Quantum Error Correction and Quantum Cryptography

Masahito Hayashi, Satoshi Ishizaka, Akinori Kawachi +2 more

Graduate texts in physics•Aug 22, 2014•0 citations

Towards practical quantum cryptography

Surasak Chiangga, Patrick Zarda, Thomas D. Jennewein +1 more

Applied Physics B•Dec 1, 1999•15 citations

Fast, efficient error reconciliation for quantum cryptography

W. T. Buttler, S. K. Lamoreaux, Justin R. Torgerson +3 more

We describe an error-reconciliation protocol, which we call Winnow, based on the exchange of parity and Hamming's ``syndrome'' for N-bit subunits of a large dataset. The Winnow protocol was developed in the context of quantum-key distribution and offers significant advantages and net higher efficiency compared to other widely used protocols within the quantum cryptography community. A detailed mathematical analysis of the Winnow protocol is presented in the context of practical implementations of quantum-key distribution; in particular, the information overhead required for secure implementation is one of the most important criteria in the evaluation of a particular error-reconciliation protocol. The increase in efficiency for the Winnow protocol is largely due to the reduction in authenticated public communication required for its implementation.

arXiv:quant-ph/0203096•Physical Review A•May 15, 2003•201 citations
We describe an error-reconciliation protocol, which we call Winnow, based on the exchange of parity and Hamming's ``syndrome'' for N-bit subunits of a large dataset. The Winnow protocol was developed in the context of quantum-key distribution and offers significant advantages and net higher efficiency compared to other widely used protocols within the quantum cryptography community. A detailed mathematical analysis of the Winnow protocol is presented in the context of practical implementations of quantum-key distribution; in particular, the information overhead required for secure implementation is one of the most important criteria in the evaluation of a particular error-reconciliation protocol. The increase in efficiency for the Winnow protocol is largely due to the reduction in authenticated public communication required for its implementation.