QKD parameter estimation by two-universal hashing

from Quantum Computing Summaries · host Mark McGuire

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.

Episode metadata supplied by the publisher feed · Published Jun 27, 2023

Embed this episode

Attribution link and audio player

Ready to play

QKD parameter estimation by two-universal hashing

0:00 4:52

1×

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

No similar episodes found.

Similar Podcasts

The New Quantum Era - innovation in quantum computing, science and technology Sebastian Hassinger Your host, Sebastian Hassinger, interviews brilliant research scientists, software developers, engineers and others actively exploring the possibilities of our new quantum era. We will cover topics in quantum computing, networking and sensing, focusing on hardware, algorithms and general theory. The show aims for accessibility - Sebastian is not a physicist - and we'll try to provide context for the terminology and glimpses at the fascinating history of this new field as it evolves in real time.

Frequently Asked Questions

How long is this episode of Quantum Computing Summaries?

This episode is 4 minutes long.

When was this Quantum Computing Summaries episode published?

This episode was published on June 27, 2023.

Can I download this Quantum Computing Summaries episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.

URL copied to clipboard!