Dimiter Ostrev proposes a new QKD protocol that uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically outperforms previous QKD protocols for small block sizes.


Check out the <a href="https://quantum-journal.org/papers/q-2023-01-13-894/" target="_blank" rel="noopener noreferer">original paper</a>, or read my <a href="https://medium.com/@quantumsumm/qkd-parameter-estimation-by-two-universal-hashing-c647ed0819e3" target="_blank" rel="noopener noreferer">medium </a>or <a href="qkd-parameter-estimation-by-two-universal-hashing" target="_blank" rel="noopener noreferer">WordPress</a> versions of the summary.

Dimiter Ostrev proposes a new QKD protocol that uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically outperforms previous QKD protocols for small block sizes. Check out the original paper, or read my medium or WordPress versions of the summary.

Dimiter Ostrev proposes a new QKD protocol that uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This protocol dramatically outperforms previous QKD protocols for small block sizes.


Check out the <a href="https://quantum-journal.org/papers/q-2023-01-13-894/" rel="noopener noreferrer">original paper</a>, or read my <a href="https://medium.com/@quantumsumm/qkd-parameter-estimation-by-two-universal-hashing-c647ed0819e3" rel="noopener noreferrer">medium </a>or <a href="qkd-parameter-estimation-by-two-universal-hashing" rel="noopener noreferrer">WordPress</a> versions of the summary.

QKD parameter estimation by two-universal hashing

Summaries of papers on quantum computing, longer than the abstract, shorter than the paper.

Share QKD parameter estimation by two-universal hashing

Sign up to save your podcasts

QKD parameter estimation by two-universal hashing

QKD parameter estimation by two-universal hashing