Blind reconiliation

Martinez Mateo, Jesus and Elkouss Coronas, David and Martín Ayuso, Vicente (2012). Blind reconiliation. "Quantum Information & Computation", v. 12 (n. 9&10); pp. 791-812. ISSN 1533-7146.


Title: Blind reconiliation
  • Martinez Mateo, Jesus
  • Elkouss Coronas, David
  • Martín Ayuso, Vicente
Item Type: Article
Título de Revista/Publicación: Quantum Information & Computation
Date: 2012
Volume: 12
Freetext Keywords: Quantum key distribution, information reconciliation, low-density parity-check codes, rate-compatible, interactive reconciliation, short-length, distribución de clave cuántica, codes communicated, conciliación de información, códigos de comprobación de paridad de baja densidad, tasa compatible, códigos comunicados.
Faculty: Facultad de Informática (UPM)
Department: Matemática Aplicada
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (348kB) | Preview


Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation e?ciency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less e?cient but also less interactive ?just one message is exchanged? procedures, like the ones based in low-density parity-check (LDPC) codes. The price to pay in the LDPC case is that good e?ciency is only attained for very long codes and in a very narrow range centered around the quantum bit error rate (QBER) that the code was designed to reconcile, thus forcing to have several codes if a broad range of QBER needs to be catered for. Real world implementations of these methods are thus very demanding, either on computational or communication resources or both, to the extent that the last generation of GHz clocked QKD systems are ?nding a bottleneck in the classical part. In order to produce compact, high performance and reliable QKD systems it would be highly desirable to remove these problems. Here we analyse the use of short-length LDPC codes in the information reconciliation context using a low interactivity, blind, protocol that avoids an a priori error rate estimation. We demonstrate that 2×103 bits length LDPC codes are suitable for blind reconciliation. Such codes are of high interest in practice, since they can be used for hardware implementations with very high throughput.

More information

Item ID: 15609
DC Identifier:
OAI Identifier:
Deposited by: Memoria Investigacion
Deposited on: 05 Jun 2013 14:55
Last Modified: 21 Apr 2016 15:51
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM