Device-Independent QKD
Security from Bell violations, trusting no hardware.
Every BB84 proof assumes that the devices do what the model says: this photon is a qubit, that detector measures . Hackers have repeatedly broken commercial systems by exploiting the gap. Device-independent QKD closes it from the other side: treat the devices as black boxes, possibly built by Eve, and certify the key from the observed CHSH violation alone. In 2022 it was demonstrated for the first time.
What you’ll learn
- Formulate the device-independent setting and list the assumptions that remain.
- State and sketch the proof of the Acín et al. key-rate bound for collective attacks.
- Explain how the entropy accumulation theorem extends security to general attacks with finite statistics.
- Compare DIQKD's noise and detection-efficiency requirements with BB84, and summarize the 2022 experiments and open problems.
Why trust nothing?
A security proof is a theorem about a model. Real QKD systems have been broken without contradicting any theorem, by violating the model: bright light can blind single-photon detectors and turn them into classical detectors that Eve controls (Lydersen et al., 2010), detection-time mismatches can leak basis information, and probe light injected into Alice's device can read out her settings. Each was patched, but each patch is another model assumption.
| Approach | Trusted | Untrusted |
|---|---|---|
| Prepare-and-measure (BB84 with decoys) | Characterized source and detectors | The channel |
| Measurement-device-independent (Lo, Curty & Qi, 2012) | Alice's and Bob's sources | All detectors: an untrusted relay performs Bell measurements |
| One-sided device-independent | One party's measurement device | The other party's device (security from steering) |
| Device-independent | Quantum theory, isolated labs, local randomness, classical processing | Every quantum device, including the source |
From CHSH to secrecy
In the standard protocol (Acín, Brunner, Gisin, Massar, Pironio & Scarani, 2007), one party has an extra setting used only for key. Say Alice chooses and Bob . Rounds with estimate the CHSH value
and rounds produce the raw key, with error rate . Honest devices share and measure , , , , giving and .
Reduce to qubits. Each box's binary measurements can be taken projective (enlarge the space, by Naimark). By Jordan's lemma, two binary projective observables on any Hilbert space decompose simultaneously into blocks of dimension at most 2: , and similarly for Bob. Giving Eve the block labels only helps her, so the problem becomes a mixture of qubit-pair problems.
Symmetrize. Within a block, local rotations put the observables in the – plane, and a symmetrization step (random correlated bit flips by Alice and Bob, which leave and unchanged and cannot help Eve) makes the state Bell-diagonal with eigenvalues .
The Horodecki criterion: the best CHSH value of a two-qubit state is , with the two largest singular values of its correlation matrix; here they are and .
Eve holds the purification. Her total state has entropy , and conditioned on Alice's outcome it has entropy .
Optimize and average. Maximizing over Bell-diagonal states with a given gives . Since is concave and decreasing, mixing blocks with different gives Eve at most (Jensen). Finally Devetak–Winter gives .
A DIQKD run observes and . Estimate the asymptotic key rate per key round, .
Show the answer
0.59
, so and . With , . For a depolarized (so ) the rate vanishes at , against 11% for BB84 with trusted devices: distrust has a price.
General attacks: entropy accumulation
Collective attacks assume the boxes behave identically and independently in every round, which is exactly what untrusted, memory-equipped devices need not do, and de Finetti-type symmetrization does not apply to them. Vazirani & Vidick (2014) gave the first proof against fully general attacks. The entropy accumulation theorem (EAT) then yielded essentially optimal rates (Arnon-Friedman, Dupuis, Fawzi, Renner & Vidick, 2018).
The first-order term is the von Neumann rate of the i.i.d. analysis, so coherent attacks cost nothing asymptotically. That matters, because the naive alternative, bounding each round's guessing probability, is much weaker. Pironio et al. (2010) showed , i.e. : about bits per round at , against .
Why is the entropy accumulation theorem needed for DIQKD, rather than the de Finetti or post-selection arguments used for BB84?
- Because DI devices measure in more than two bases
- Because untrusted devices with memory need not act identically and independently across rounds, and the protocol has no permutation symmetry to exploit; EAT handles sequential, memory-dependent rounds directly
- Because the CHSH value cannot be estimated from finitely many rounds
- Because DI security is only defined asymptotically
Show the answer
B. Because untrusted devices with memory need not act identically and independently across rounds, and the protocol has no permutation symmetry to exploit; EAT handles sequential, memory-dependent rounds directly
de Finetti-type reductions require permutation symmetry on a known, finite-dimensional system; black boxes have unknown dimension and memory. EAT needs only a sequential structure and a single-round entropy bound, and its first-order term matches the collective-attack rate.
The 2022 experiments, and the frontier
DIQKD needs a loophole-free Bell violation, with high fidelity, high detection efficiency and many rounds. Two experiments published together in 2022 crossed the line:
- Trapped ions (Nadlinger et al., Oxford): two strontium ions in separate traps about two meters apart, entangled via photons, produced a finite-size, composably secure key of order bits over roughly eight hours, the first complete DIQKD protocol.
- Neutral atoms (Zhang et al., Munich): two rubidium atoms in labs 400 m apart reached a CHSH violation and error rate sufficient for a positive key rate in the asymptotic limit.
A photonic experiment (Liu et al., 2022) demonstrated positive asymptotic rates with high-efficiency detectors over short fiber. In all cases rates are many orders of magnitude below trusted-device QKD.
| Requirement | BB84 (trusted devices) | CHSH-based DIQKD |
|---|---|---|
| Tolerable QBER, depolarizing noise | 11.0% (one-way) | ≈ 7.1% (Acín et al. bound) |
| Detection efficiency | Losses only reduce the rate (with decoys) | No-clicks must be kept as outcomes; even a CHSH violation needs for a maximally entangled state (as low as with partially entangled states, Eberhard); positive key needs more |
| What certifies security | Device model + error rates | The CHSH value alone |
Key takeaways
- DIQKD treats devices as black boxes and certifies secrecy from the Bell statistics, assuming only quantum theory, sealed labs, free settings and an authenticated channel.
- Against collective attacks, (Acín et al. 2007), proved via Jordan's lemma, Bell-diagonal symmetrization and Devetak–Winter.
- Entropy accumulation extends the same first-order rate to general attacks with finite-size corrections.
- DIQKD is far more demanding than BB84 (≈7.1% noise tolerance, high detection efficiency); the first complete demonstration (trapped ions) and an atom-based system 400 m apart appeared in 2022.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Which of these is not an assumption of device-independent QKD?
- Alice's and Bob's labs do not leak their boxes' inputs or outputs
- The measurement settings are chosen with randomness independent of the devices
- The devices measure qubits in the intended bases
- The classical channel is authenticated
Show the answer
C. The devices measure qubits in the intended bases
Not modeling the devices is the whole point: security follows from the observed CHSH value, whatever the boxes contain. Sealed labs, free settings, authentication and quantum theory itself remain assumptions.
A run gives and . What does the device-independent bound certify?
- One secret bit per key round, since there are no errors
- Nothing: , so and Eve may know the entire key
- About half a bit per round
- A key secure against individual but not collective attacks
Show the answer
B. Nothing: , so and Eve may know the entire key
At the statistics can be produced by a local deterministic strategy that Eve fixed in advance, so perfectly correlated outputs may be completely known to her. Error-free correlations alone certify nothing without a Bell violation.
What role does Jordan's lemma play in the Acín et al. proof?
- It shows that the devices must contain exactly one qubit each
- It bounds the CHSH value by
- It decomposes any two binary observables into blocks, reducing arbitrary-dimensional devices to a mixture of qubit problems
- It converts collective attacks into coherent ones
Show the answer
C. It decomposes any two binary observables into blocks, reducing arbitrary-dimensional devices to a mixture of qubit problems
Two projections on any Hilbert space can be simultaneously block-diagonalized into blocks of size at most 2. Eve may be handed the block label, which reduces the analysis to qubits.
Why can't a DIQKD protocol simply discard the rounds in which a detector fails to click, as BB84 does?
- Because Eve's boxes could choose when to "fail", keeping only rounds that fake a Bell violation (the detection loophole); no-clicks must be assigned outcomes
- Because discarded rounds reduce the key rate too much
- Because the CHSH value is defined only for photons
- Because no-clicks reveal the measurement setting to Eve
Show the answer
A. Because Eve's boxes could choose when to "fail", keeping only rounds that fake a Bell violation (the detection loophole); no-clicks must be assigned outcomes
With post-selection, a local model can reproduce by refusing to answer when its preprogrammed outcome would lose. Assigning a fixed outcome to no-clicks keeps the test honest, which is why high detection efficiency is essential.
Further reading
- A. Acín, N. Brunner, N. Gisin, S. Massar, S. Pironio & V. Scarani, "Device-independent security of quantum cryptography against collective attacks", Physical Review Letters 98, 230501 (2007).
- U. Vazirani & T. Vidick, "Fully device-independent quantum key distribution", Physical Review Letters 113, 140501 (2014).
- R. Arnon-Friedman, F. Dupuis, O. Fawzi, R. Renner & T. Vidick, "Practical device-independent quantum cryptography via entropy accumulation", Nature Communications 9, 459 (2018).
- D. P. Nadlinger et al., "Experimental quantum key distribution certified by Bell's theorem", Nature 607, 682 (2022).
- W. Zhang et al., "A device-independent quantum key distribution system for distant users", Nature 607, 687 (2022).