An Open Dossier · 001 · self-explaining edition · v1.0.1 — living

Reading More From Every Photon

How to read this: the whole paper is on this one page, written to explain itself. Tap any for a plain-language explanation. Tap any to see what that source actually showed, in two sentences. No rabbit holes. No prerequisites. The PDF and equations are linked at the bottom for those who want them.

01The promise hiding in a pair of photons

Some crystals do something remarkable when you shine a laser through them: occasionally, one photon of laser light splits into two photons, born at the same instant. This process is called , and the two photons it produces are in energy and time. They were born together — to within about a tenth of a trillionth of a second — but when the pair is born within any given stretch of time is completely random.

That randomness is not a bug. Shared randomness that two distant people both possess, and no one else does, is the raw material of : Alice keeps one photon, sends Bob the other, and they each write down their photon's arrival time. Because the photons were born together, their two notebooks match — a shared secret delivered by physics.

Now the question this whole field turns on: how many secret bits does each photon pair carry? Here is the striking answer. The pair's birth-moment is sharp to about 100 , while the window of uncertainty about when it occurs stretches over hundreds of nanoseconds — a million times longer. The number of distinguishable 'slots' the birth could land in is the ratio of those two times, roughly a million, which works out to 16–20 bits of potential secret key per photon pair . For comparison, most quantum cryptography systems extract less than one bit per detected photon.

Go deeper: the Schmidt number
The information content is quantified by the Schmidt number K = Tcohc: the pair's coherence time (set by the pump laser's linewidth, ~0.1–1 μs for a good cw laser) divided by the correlation time (set by the crystal/filter bandwidth, ~100 fs). K counts the independent 'modes' the state occupies.
K ≈ 10⁵–10⁶ → log₂K ≈ 16–20 bits per pair
This framework comes from Law & Eberly .

02So why do we only get a few bits?

In 2007, this author and colleagues built the first large-alphabet system on this idea and extracted 4 clean bits per pair . The best system since reached 6.9 bits . Both are far below the 16–20 bits the photons actually carry. The thief is not physics — it's the stopwatch.

Single-photon detectors have : their click smears the true arrival time. The photons are synchronized to 100 femtoseconds, but even a heroic detector blurs that to 3,000 femtoseconds — like photographing a hummingbird's wings with a shutter 30 times too slow. Every factor of two in blur costs one full bit of key. The blur costs us 5–10 bits per pair, every pair, forever. The best such detectors, called , get the blur down to 3 picoseconds — still 30× too slow for these photons.

For twenty years the field has tried to build a faster stopwatch. This paper asks instead: what if we slow down the hummingbird?

03A magnifying glass for time

Here is the idea at the heart of this proposal. There is a deep mathematical symmetry in optics: the way a light pulse spreads out as it travels through is mathematically identical to the way a light beam spreads out by diffraction as it travels through space. And since a glass lens can undo spatial spreading and form a magnified image, the same trick works in time: a sandwiched between two dispersive elements stretches a waveform's time axis by a magnification M .

Put one in front of your detector, and events too fast for the detector get magnified until they're slow enough to see. The detector never improved — the moment got bigger. And this is not speculative: a single-photon time lens with magnification M = 158 and picosecond-scale resolution was demonstrated in 2022, by a group that built it explicitly to beat detector jitter . Time lenses have also already magnified the correlations of entangled photon pairs and compressed single-photon bandwidths .

What nobody had done — to our knowledge — is put this tool inside a cryptography protocol. That integration, with the math of how many bits it recovers and when it pays for itself, is the core contribution of this paper. The headline: with a demonstrated lens and an ordinary 30-picosecond detector, the recoverable key jumps to about 13 bits per pair — and the cheap-detector-plus-lens combination beats the most exotic cryogenic detector used alone. Room-temperature optics substituting for heroic cryogenics.

Go deeper: the resolution formula and the break-even rule
With magnification M and lens point-spread δτL, each receiver's effective timing error becomes
ε = √[(τ_jitter/M)² + δτ_L²]
and the extractable bits per pair are log₂[T_frame/(α·σ_obs)] where σ_obs combines ε from both receivers with the intrinsic 100 fs correlation. A lens with efficiency ηL (it loses some photons) pays for itself photon-for-photon when ηL > I(without)/I(with) — about 0.66 for the 30-ps example. But the deeper point: modern photon sources are so bright that DETECTORS, not photons, are the bottleneck. In that regime you simply turn up the source to compensate lens loss, and every extra bit multiplies the key rate nearly for free. Every number in this paragraph is recomputed live by the verification console.

04Catching an eavesdropper without an interferometer

A key is only secret if you can prove nobody intercepted it. The quantum trick is to measure the photons in two — time for the key, energy for the alarm system. An eavesdropper ('Eve') who measures arrival times precisely enough to steal the key must, by the uncertainty principle itself, damage the energy correlations. Alice and Bob check those correlations on a sample of pairs; intact correlations mathematically bound how much Eve can know .

The 2007 experiment did this energy check with interferometers — but that classic method has a genuine, demonstrated security hole: it relies on , and in 2015 that hole was exploited in a live attack using nothing but classical light .

This paper instead uses the dispersive check, proposed at MIT in 2013 : Alice's photon passes through normal dispersion, Bob's through equal-and-opposite anomalous dispersion. Here physics does something genuinely strange, called : each photon alone becomes a featureless blur, but the pair's correlation stays sharp — if and only if the entanglement survived the journey intact. Eve's tampering shows up as broadening. No interferometers, no path postselection, no known loophole of that kind — and it's been demonstrated in a working QKD system .

05The strange one: a lens that exists only in coincidences

The same anti-correlation that powers the security check permits something stranger. A time lens needs three parts: input dispersion, the lens, output dispersion. Because dispersion on Bob's photon acts — in the joint correlations — exactly like dispersion on Alice's, the three parts don't have to be on the same photon's path. The dispersion of Bob's own delivery fiber — normally an impairment to be compensated — can serve as the input element, with the lens and output dispersion sitting entirely on Alice's bench. No single photon passes through a complete imaging system. Bob's receiver holds nothing but a detector. Yet the joint correlation — the thing the key is made of — comes out magnified.

OPEN-UNVERIFIEDHonest label: this distributed-lens claim is published as a conjecture. The formal derivation has not been carried through by anyone, human or machine — by deliberate choice, as part of this dossier's verification doctrine. It is claim C11 in the public ledger, and it is an open challenge: the first person to confirm or refute it gets named credit in v1.1. The mathematical tools exist . Fork the repo and have at it.

06The numbers, honestly

Where does this land against the world? The fastest quantum key system ever demonstrated runs at 115.8 megabits per second . This proposal projects a comparable order — about 10⁸ bits per second — so we claim parity with the overall record, not supremacy. The honest pitch is different: those record systems extract less than one bit per detected photon and win by clocking blindingly fast. This protocol extracts ~13–15 bits per detected pair. Wherever detected photons are the scarce resource — long fibers, satellites, saturated detectors, many users sharing a network — bits-per-photon is what sets the speed limit, and there this approach wins by an order of magnitude. Against its own family, entanglement-based time-energy systems, the projected gain is about a hundredfold .

And one receipt that matters more than any projection: during this paper's own pre-launch audit, the verification pipeline caught the results table overstating these numbers by about 2 bits. It was corrected in public before launch, and the catch is documented in the audit trail. The checks you can run on this page are the same ones that drew that blood.

AMENDED · 12 JUN 2026Living-paper update, hours after launch: the author's own reality check sharpened the biggest open finding. The time lens stretches its accepted window by M, so each lens-and-detector channel accepts only ~1/M of continuous input time — and the rate projections above implicitly assumed an aperture architecture the paper never specified. The bits-per-photon claims are unaffected; the 10⁸ b/s figure is now labeled architecture-dependent pending one of three quantified fixes (pulsed/Talbot pump alignment, M-way output demultiplexing, or ~M-channel parallelization). Full statement: issue #1 in the public record. The archived v1.0.0 at Zenodo stays frozen; this page is the living edition.

07What's still open, and how to attack it

Published with this paper, not hidden from it: seven open findings from the adversarial review. The two biggest, in plain terms. First, the lens has a limited time 'window', while the photons can arrive anywhere in a much longer frame — a real tension between the protocol's two key assumptions — sharpened hours after launch by the author's own reality check into a ~1/M per-channel acceptance penalty, logged as issue #1. Second, the 'turn up the source to pay for lens loss' argument needs one inequality pinned down about how hard you can pump before multi-pair noise bites. Both are stated in the manuscript as caveats, both are tickets anyone can claim. The full list, with severity rankings, lives in the audit trail — and the repository's issues page is the review venue. Disagreement is a contribution.

Don't trust this paper. Run it, expand it, attack it — it was built to survive that, in public.

Want to publish like this?

You just read a paper that explains itself. You can publish one too — Open Dossier is a free template, and an AI agent does the drafting, typesetting, citations, and verification. Idea to live publication in an afternoon.

Publish your own →