There is a version of this story that gets told in the usual way: two researchers, a breakthrough idea, a field emerges, decades later they receive the A.M. Turing Award. Clean, respectable, and a bit bland perhaps.
A more interesting version starts somewhere closer to a low-budget science fiction scene. Two people in the sea, one describing “quantum money” — a concept that sounds like it belongs in a Philip K. Dick novel — and the other trying to work out whether this is genius or nonsense. That moment, between Charles Bennett and Gilles Brassard, is where the foundations of quantum information science begin to crystallise.
Not because the idea was polished, but because it was wrong in an interesting way.
The Problem With Classical Cryptography (That Everyone Quietly Ignores)
Classical cryptography works like the locking mechanism in a heist film: complicated enough that breaking it takes time, but fundamentally breakable if the antagonist is clever enough or the plot demands it.
Everything hinges on mathematical difficulty. Factorising large numbers, solving discrete logs; problems that are assumed to be hard. Not proven to be hard. Assumed.
It’s a bit like building your entire security model on the belief that nobody will ever build a faster computer. Which, historically, has not been a winning strategy.
Then along comes Peter Shor with an algorithm that, given a sufficiently capable quantum computer, dismantles that assumption. Not weakens it. Removes it. The kind of moment that should make anyone responsible for infrastructure security slightly uncomfortable.
At that point, the usual instinct is to double down: find harder problems, stack more complexity, hope the arms race holds.
Bennett and Brassard take a different route entirely.
Stop Playing the Game
Instead of asking “how do we make this harder to break?”, they ask a more awkward question:
What if breaking the system is indistinguishable from revealing yourself?
That shift sounds minor. It isn’t. It changes the problem from computational to physical.
The key idea behind their work (crystallised in the BB84 protocol) is that quantum systems behave in ways that are deeply inconvenient if you are trying to spy on them. Measuring a quantum state disturbs it. Copying it perfectly is not allowed. Observation leaves a trace.
In another context, this would be a limitation. In cryptography, it becomes the mechanism.
You don’t prevent eavesdropping. You make it self-defeating.
If someone tries to intercept the key exchange, they introduce errors. If the errors exceed a threshold, the communication is discarded. No clever mathematics required. No assumptions about the attacker’s resources. Just physics enforcing the rules.
It’s less Ocean’s Eleven and more Minority Report: the system knows you’re there because reality itself refuses to cooperate with you.
The Accidental Architecture of a New Field
What follows is not immediate validation. For a long time, this work sits in an uncomfortable space.
- Too abstract for engineers who want systems that scale.
- Too applied for physicists who prefer cleaner theoretical problems.
- Too strange for computer scientists trained to think in terms of algorithms, not photons.
So it lingers on the edges. Which is often where the interesting things survive long enough to mature.
Then the rest of the world catches up. Quantum computing becomes more than a curiosity. Shor’s result becomes harder to ignore. The uncomfortable implication lands: the cryptographic foundations of the internet are temporary.
At that point, Bennett and Brassard’s work stops being exotic and becomes necessary.
From Thought Experiment to Engineering Problem
There is a tendency to treat quantum ideas as permanently theoretical, as if they belong in the same category as warp drives or time travel. That’s not what happened here.
They built it. Badly, by modern standards. Improvised optics, minimal resources, the kind of setup that feels closer to early cyberpunk tinkering than polished research infrastructure. And it worked.
Not at scale, not elegantly, but convincingly enough to shift the conversation from “is this nonsense?” to “how do we make this practical?”
That transition, from conceptual curiosity to engineering constraint, is where fields become real.
Why This Merits a Turing Award
The Turing Award is not given for being early. It is given for changing how computing is understood.
Bennett and Brassard didn’t just propose a new cryptographic protocol. They redefined the relationship between computation and the physical world.
Before their work, the boundaries were comfortable:
- Physics described systems
- Mathematics secured them
- Computer science implemented them
After their work, those boundaries collapse.
Information is no longer abstract. It is physical.
Security is no longer probabilistic. It can be derived from first principles.
Computation is no longer independent of physics. It is constrained by it.
That shift is structural. It doesn’t just improve cryptography — it reframes it.
The Less Comfortable Implication
There is a temptation to treat quantum cryptography as a clean solution to a known problem. It isn’t that tidy.
We are currently in an in-between state:
- Classical systems still run the world
- Quantum capabilities are not yet dominant
- Post-quantum fixes are being layered in, sometimes hastily
In other words, we are patching a system we know is fragile while building a new one we don’t fully understand operationally.
If this were a sci-fi narrative, this is the point where the system upgrade introduces a different class of failure. Not because the underlying theory is wrong, but because implementation always finds a way to be messier than theory allows.
What They Actually Did
Strip away the narrative, and the contribution becomes clearer.
They took properties of quantum mechanics that were widely considered inconvenient — measurement disturbance, no-cloning — and treated them as design primitives.
That is the move: Not optimisation. Not iteration. Reframing.
Instead of asking how to work around the constraints, they asked how to build systems that depend on them.
That is why they won the Turing Award. Not because they solved a known problem, but because they changed what the problem was.
And once that happens, the rest of the field has no choice but to follow.