Skip to main content
London Tutorsby KnowledgeDottCom

7 November 2026 · London Tutors

Quantum Messages That Prove Who Sent Them — Without Ever Sharing a Secret Key

Researchers at Sorbonne Université and the University of Edinburgh have run entanglement-based quantum key distribution in which the two parties held no shared secret beforehand, with the result accepted by Physical Review Research on 1 November 2026.

Quantum Messages That Prove Who Sent Them — Without Ever Sharing a Secret Key

Quantum key distribution, or QKD, is a way for two people to agree on a secret code using the strange rules of quantum physics — a code that, in theory, cannot be cracked even by a future quantum computer. But it has always had an awkward catch: before the quantum part can begin, the two sides need to prove who they are to each other, and that has traditionally required them to already share a secret key.

Now researchers at Sorbonne Université in Paris and the University of Edinburgh have run an entanglement-based QKD protocol in which the two parties held no shared secret before the session began. The result was accepted by the journal Physical Review Research on 1 November 2026.

The key that was never shared

The team — Nicolas Laurent-Puig, Mina Doosti, Adriano Innocenzi and Eleni Diamanti — replaced the pre-shared key with a device called a hybrid entangled physical unclonable function, or PUF. A PUF is a physical object whose tiny manufacturing imperfections give it a unique fingerprint: ask it a question, and it answers in a way that no copy could reproduce.

In this experiment, each answer from the PUF was encoded into one of two entangled quantum states (known as Bell states), which an eavesdropper holding a single photon cannot tell apart. That let the two sides authenticate each other — prove they really were who they claimed to be — and then run the full quantum key exchange, with no secret shared in advance.

The experiment ran at telecom wavelength — the kind of light used in ordinary fibre-optic networks — over 50 decibels of simulated channel loss, held the quantum bit error rate below 0.6 percent, and spent 237 bits of the initial key on authentication per session. The work was first posted as a preprint on 6 May 2026 (arXiv:2605.04650) and presented at the QCrypt 2026 conference in Ottawa in August.

Why this matters

The missing pre-shared key has been the main objection raised against QKD for a decade — including by national security agencies. If two people need a secret key to start, how did they share that first key safely? Removing that step is a genuine advance towards quantum networks that could one day protect real messages.

It is important to keep the scale honest. This is a laboratory proof of concept, not a finished device: in this experiment the PUF itself was emulated in software and the fibre was replaced by attenuators, so the team describes it as an experimental demonstration rather than a laboratory-validated unit. The authors say it is a significant step towards practical quantum networks using lightweight, readily available hardware — without weakening the security guarantees.

A lesson in solving the right problem

For students, this is a neat example of how progress often comes from removing a hidden assumption. Everyone had accepted that QKD needed a pre-shared key. The Paris and Edinburgh team asked what could take its place — and found the answer in a physical fingerprint that cannot be copied.

If your child is curious about codes, secrets and quantum physics, a first lesson in physics can start with this unshareable key and end with why the hardest part of secret messages is not the code itself, but proving who sent it. Book your first lesson

Sources:

  • Nicolas Laurent-Puig, Mina Doosti, Adriano Innocenzi and Eleni Diamanti, "Unconditional Authentication in Quantum Key Distribution via Hybrid Entangled Physical Unclonable Functions", Physical Review Research, accepted 1 November 2026. DOI: 10.1103/9mjz-fddy. Preprint: https://arxiv.org/abs/2605.04650

London Tutors — post your tutoring request and we will match you with a verified tutor.

Ready to find the right tutor?

Browse verified tutors, compare fees upfront, and book a trial lesson — free to sign up.

Find a tutor — sign up free

Related guides