Math 2.0

Quantum theory Definition

Quantum key distribution

Builds on Quantum channelDensity matrixPartial traceTrace distanceMutually unbiased bases

Definition

A quantum key distribution protocol is a protocol between two parties, Alice and Bob. They are linked by a quantum channel and by an authenticated public classical channel. Authenticated means that others can read its messages but cannot alter them. A third party, Eve, may act arbitrarily on the quantum channel and may read the classical channel. At the end the protocol either aborts or outputs bit strings KAK_A to Alice and KBK_B to Bob, of a fixed length ℓ\ell. Let pp be the probability that the protocol does not abort. Let ρKAE\rho_{K_A E} be the joint state of Alice's key and Eve's system, given no abort. Let ε≥0\varepsilon \ge 0. The protocol is ε\varepsilon-secure if, for every strategy of Eve, the following two conditions hold.

  1. Correctness: the probability that the protocol does not abort and KA≠KBK_A \ne K_B is at most ε\varepsilon.
  2. Secrecy: p⋅12∥ρKAE−ωℓ⊗ρE∥1≤εp \cdot \frac12 \norm{\rho_{K_A E} - \omega_\ell \otimes \rho_E}_1 \le \varepsilon.

Here ρE\rho_E is the partial trace of ρKAE\rho_{K_A E} over the key, and ωℓ=2−ℓ∑k∈{0,1}ℓ∣k⟩⟨k∣\omega_\ell = 2^{-\ell} \sum_{k \in \set{0,1}^\ell} \lvert k \rangle \langle k \rvert is the uniform distribution on keys.

Remarks

The secrecy clause says that the key is ε\varepsilon-close in trace distance to a uniform key independent of Eve. This form of security is composable: the key can be used in a later protocol, such as a one-time pad, at an added error of at most ε\varepsilon.

Example: in the BB84 protocol, Alice sends each bit in one of two mutually unbiased bases of a qubit, chosen at random, and Bob measures in a random basis. They keep the rounds where the bases agree, estimate the error rate on a sample, abort if it is too high, and then apply error correction and privacy amplification. For every ε>0\varepsilon > 0, BB84 with suitable parameters is ε\varepsilon-secure. The key length then depends on ε\varepsilon, on the number of rounds and on the observed error rate.

Non-example: a protocol that sends the key bits in a single fixed basis fails the secrecy clause. Eve can measure each qubit in that basis, learn the bit, and resend it without causing any error.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Density matrix concept
  2. Mutually unbiased bases concept
  3. Partial trace concept
  4. Quantum channel concept
  5. Trace distance concept
  6. Quantum key distribution definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Quantum_key_distribution
About this page
Tag9YXH2GT9BW
URIm2://9YXH2GT9BW
Kinddefinition
WritingW0 stub
MSC81P94, 94A60
DefinesQuantum key distribution
UsesQuantum channel, Density matrix, Partial trace, Trace distance, Mutually unbiased bases
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.