AETHERIX
Learning Objective
Understand the foundational quantum mechanics principles that make Quantum Key Distribution (QKD) possible, and why these matter for securing interplanetary communications. Maps to exam objective b. Quantum Communication and Cryptography.
The Core Concept
Classical cryptography — AES, RSA, even ECC — relies on computational hardness: "this problem is too expensive for a computer to solve." The threat? A sufficiently powerful quantum computer running Shor's algorithm breaks RSA and ECC in polynomial time. The promise of quantum communication is fundamentally different: security guaranteed not by computational difficulty, but by the laws of physics.
The Four Pillars You Must Understand
1. Superposition A classical bit is 0 or 1. A quantum bit (qubit) can exist in a superposition — simultaneously 0 and 1 — until measured. Think of it like a spinning coin: while spinning, it's neither heads nor tails. The moment you look (measure), it collapses to one state.
In AETHERIX, the Qubit class represents this:
- Rectilinear basis (Z): |0⟩ and |1⟩
- Diagonal basis (X): |+⟩ and |−⟩
2. The No-Cloning Theorem This is the bedrock of QKD security. Quantum mechanics proves that it is impossible to create an identical copy of an unknown quantum state. Unlike classical bits — which can be freely copied, intercepted, and retransmitted — a qubit cannot be perfectly copied.
Why this matters: If an eavesdropper (Eve) tries to intercept quantum key material, she must measure the qubits. But measuring disturbs them. She can't copy and forward — she must guess a measurement basis, and half the time she'll be wrong, introducing detectable errors.
3. Measurement Disturbance When you measure a qubit in the wrong basis, you get a random result and you've collapsed the state. This is irreversible. It's like trying to read a letter by burning it and analyzing the smoke — you get information, but you've destroyed the original.
4. Entanglement (covered in depth on Day 12) Two qubits can be entangled — correlated in a way that has no classical analogue. Measuring one instantly determines the outcome of the other, regardless of distance. Einstein called it "spooky action at a distance." For QKD, entanglement enables protocols like E91 where security is guaranteed by Bell inequality violation.
Why Space QKD?
QKD over fiber is limited to ~100-500 km due to photon absorption. Free-space optical links extend this dramatically — the Micius satellite demonstrated QKD from LEO (1200 km) to ground in 2017. For interplanetary distances, free-space is the only option, and even then, quantum repeaters are needed (Day 13).
AETHERIX envisions QKD for the command link — the most security-critical channel. Command bundles sent from Earth to Mars assets must be authenticated beyond any doubt. QKD provides information-theoretic security: no computer, quantum or classical, can break it.
Diagrams & Data
flowchart TD
Q["Qubit prepared in a random basis"] --> M{"Measured in<br/>matching basis?"}
M -->|"Yes"| OK["Deterministic result<br/>state preserved"]
M -->|"No"| COL["State collapses<br/>result is random"]
COL --> ERR["Introduces detectable errors"]
ERR --> QBER["QBER rises above threshold"]
QBER --> AB["Key discarded - eavesdropper inferred"]
NC["No-cloning theorem"] --> NOCOPY["Eve cannot copy a qubit<br/>and forward the original"]
NOCOPY --> ERRIn AETHERIX
The quantum security module lives in src/security/qkd.py. Key classes:
Basis(Enum):RECTILINEAR("R", Z basis) andDIAGONAL("D", X basis)Qubit(dataclass): Storesbit(0 or 1),basis, and a visual state string (|0⟩,|1⟩,|+⟩,|−⟩)QKDResult(dataclass): Capturesalice_key,bob_key,sifted_key_length,qber,secure,raw_key_length,efficiency
The module defines two protocols — BB84Protocol and E91Protocol — plus a QuantumRepeater class and a calculate_key_rate() utility function.
Supporting files:
- src/security/repeater_chain.py — Multi-hop quantum repeater chain with entanglement purification
- src/security/privacy_amplification.py — CASCADE reconciliation and universal hashing
The simulation's Module 5 demonstrates: 2048 qubits exchanged, clean channel QBER = 0.0%, eavesdropped channel QBER = 24.7%, key discarded.
Key Numbers & Formulas
- QBER security threshold: < 11% (Shor-Preskill threshold)
- BB84 key rate (LEO): 1-10 kbps
- BB84 key rate (GEO): 100-1000 bps
- Earth-Mars key rate: ~1-10 bps (extremely low — needs repeaters)
- Sifting efficiency: ~50% (half the qubits are discarded when bases don't match)
- Eavesdropper detection rate: ~25% QBER for intercept-resend attack
Standards & References
How the Examiner Will Probe This
QWhat makes quantum key distribution fundamentally different from classical cryptography?
Classical crypto relies on computational hardness (RSA = factoring is hard). QKD relies on the laws of physics — specifically, the no-cloning theorem means an eavesdropper cannot copy quantum states without disturbing them. The security is information-theoretic, not computational.
QIf a quantum computer can break RSA, why not just use AES-256?
AES-256 is still considered quantum-resistant (Grover's algorithm halves the effective key length to 128 bits, which is still secure). The issue is key exchange — RSA and ECC for sharing AES keys are broken by Shor's algorithm. QKD replaces key exchange with a physics-guaranteed method.
QWhat's the practical limitation of QKD in space?
Key rate. At Earth-Mars distance, the key rate is ~1-10 bps due to photon loss across 54.6-401 million km. This limits QKD to high-value links (command authentication), not bulk data encryption.
Self-Check Questions
Deep Dive Resources
- Source code:
src/security/qkd.py— Read theBasis,Qubit, andQKDResultclasses - Topic summary:
interview_prep/topic_summaries/quantum_basics.md - Live demo: QKD Interactive Demo
- Learn page: Science Behind QKD
- Cheat sheet:
interview_prep/cheat_sheets/constants.md— quantum thresholds