Physics for Software Engineers

📡

Electromagnetic Theory & Signal Propagation

Maxwell's Equations · Shannon's Theorem · Path Loss · TEMPEST

▼

Every wireless communication system — from Wi-Fi to 5G to satellite links — operates according to Maxwell's equations, the four fundamental laws governing electric and magnetic fields (Griffiths & Schroeter, 2018). For software engineers, understanding EM theory explains bandwidth limits, signal interference, and side-channel vulnerabilities.

Shannon's Channel Capacity Theorem C = B log₂(1 + S/N)
C = channel capacity (bits/s) · B = bandwidth (Hz) · S/N = signal-to-noise ratio

Shannon's theorem (C = B log₂(1 + S/N)) is a direct consequence of electromagnetic signal physics. The physical bandwidth of a channel bounds the maximum achievable data rate. This is why 5G uses higher-frequency millimeter waves — more bandwidth — at the cost of shorter range due to increased path loss.

Free-space path loss follows the inverse-square law: FSPL = (4πdf/c)², where d is distance, f is frequency, and c is the speed of light. Higher frequencies experience greater path loss, which is why 5G millimeter-wave signals require dense cell deployments.

Relevance to cybersecurity:

TEMPEST attacks: Every electronic device emits unintentional electromagnetic radiation that correlates with internal data processing. The NSA's TEMPEST program classifies techniques to intercept EM emanations from monitors, keyboards, and CPUs at distances up to hundreds of meters (Kocher et al., 1999).
RF jamming & interference: Wireless networks can be disrupted by intentional EM interference — a denial-of-service attack at the physical layer.
Antenna design & directional attacks: Understanding antenna radiation patterns enables targeted wireless attacks (Evil Twin APs, deauthentication attacks).

Key Insight

Every digital system is ultimately an electromagnetic system. Side-channel attacks exploit the gap between the logical abstraction (software) and the physical reality (EM fields, power consumption, heat).

🔬

Semiconductor Physics & Computing

Band Theory · MOSFET · Power Analysis · Rowhammer

▼

Every transistor — the building block of CPUs, GPUs, FPGAs, and memory chips — is a quantum mechanical device. Semiconductor physics explains how hardware works at the atomic level and reveals exploitable vulnerabilities (Seabaugh & Zhang, 2010).

Concept	Explanation	Security Implication
Band Theory	Electrons occupy energy bands separated by band gaps (~1 eV for Si). Conductors, insulators, and semiconductors differ by gap size.	Basis for all transistor operation
Doping & p-n Junctions	Donor/acceptor atoms create n-type/p-type regions. The p-n junction is the basis of diodes and transistors.	Hardware Trojans at transistor level
MOSFET Operation	Gate voltage modulates channel conductivity. Gate oxides approaching atomic layers → quantum tunneling leakage.	Moore's Law physical limits
Johnson-Nyquist Noise	S_V = 4k_BT·R — thermal noise sets the noise floor for ADCs and RF receivers.	Affects side-channel signal quality

Power analysis attacks (SPA/DPA): The dynamic power consumption of a CMOS circuit (P = α C V² f) correlates with data being processed. Simple and differential power analysis can extract cryptographic keys from smart cards, HSMs, and embedded devices (Kocher et al., 1999).

Rowhammer attacks: Repeated electrical access to one row of DRAM cells induces bit flips in adjacent rows through capacitive coupling — an exploitable vulnerability arising directly from semiconductor physics.

Key Insight

Hardware vulnerabilities (Rowhammer, power analysis, EM emanations) are physics problems, not software bugs. You cannot patch the laws of physics — only mitigate their exploitation through shielding, constant-time code, and power-noise injection.

💡

Photonics & Optical Computing

Fiber Optics · LiDAR · QKD · Photonic Integrated Circuits

▼

Photonics — the science of generating, controlling, and detecting light — is increasingly central to computing and networking (Strikis et al., 2025).

Technology	How It Works	Application
Optical Fiber	Total internal reflection confines light in glass fiber. ~0.2 dB/km attenuation at 1550 nm.	Global internet backbone, WDM multiplexing
Photonic ICs (PICs)	Waveguides, modulators, detectors integrated on silicon chips.	PsiQuantum's photonic quantum computers
Optical Interconnects	VCSELs and photodetectors replace copper at ever-shorter distances.	Data center rack-to-rack and chip-to-chip
LiDAR	Time-of-flight measurement of laser pulses for 3D mapping.	Autonomous vehicles, GlideCart navigation

Fiber tapping: Physical layer interception requires bending the fiber to extract evanescent field coupling. Optical time-domain reflectometry (OTDR) can detect unauthorized splices.

Quantum Key Distribution (QKD) uses the quantum properties of photons (polarization states) to distribute cryptographic keys with information-theoretic security (Bennett & Brassard, 1984).

GlideCart Connection

LiDAR is the primary navigation sensor for autonomous systems like GlideCart. Photonic technologies bridge classical hardware (LiDAR, fiber optics) and quantum hardware (photonic quantum computers, QKD).

🌡️

Thermodynamics of Computing

Landauer's Principle · Reversible Computing · Entropy & Key Generation

▼

The relationship between information processing and thermodynamics has deep implications for energy efficiency, hardware design, and fundamental computing limits (Landauer, 1961; Bérut et al., 2012).

Landauer's Principle (1961) E_min = k_B · T · ln2 ≈ 2.9 × 10⁻²¹ J per bit (at 300 K)
The minimum energy required to erase one bit of information

Rolf Landauer proved that erasing one bit of information must dissipate at least k_BT·ln2 of energy as heat. Modern processors dissipate ~10⁹ times more energy per operation than this fundamental limit — indicating enormous room for efficiency improvement, but also a hard physical floor.

Implication	Detail
Reversible Computing	If operations are thermodynamically reversible (no information erasure), power consumption approaches zero. Motivates adiabatic computing research.
Data Center Cooling	Large data centers consume 10–50 MW. Chip thermal management (liquid cooling, phase-change) is grounded in thermodynamics.
Quantum Computer Cooling	Superconducting quantum processors operate at ~15 millikelvin — colder than outer space — requiring dilution refrigerators.
Entropy & Key Generation	The second law guarantees truly random processes exist, providing the physical basis for hardware random number generators (HRNGs) in cryptographic key generation.

Von Neumann-Landauer entropy: The minimum thermodynamic entropy decrease associated with a quantum measurement is S = k_B·ln2 per qubit, connecting quantum mechanics and thermodynamics.

Key Insight

Information is physical. Erasing a bit costs energy. True randomness comes from physical entropy. These aren't abstractions — they're engineering constraints on every computing system.

🌊

Wave-Particle Duality

Double-Slit Experiment · de Broglie Wavelength · Born Rule

▼

Wave-particle duality is one of the most counterintuitive and foundational principles of quantum mechanics. Every quantum entity — electrons, photons, atoms — exhibits both wave-like and particle-like behavior depending on the experimental context (Griffiths & Schroeter, 2018; de Broglie, 1925).

The Double-Slit Experiment:

de Broglie Wavelength (1924) λ = h / p
λ = wavelength · h = Planck's constant · p = momentum

Historical milestones:

1801 — Thomas Young's double-slit experiment demonstrated light's wave nature
1905 — Einstein explained the photoelectric effect (E = hf) — light as particles (photons)
1924 — de Broglie proposed matter has wave nature with λ = h/p
1927 — Davisson and Germer confirmed electron diffraction experimentally

Born rule: The quantum state is described by a wave function ψ(x, t). The probability of finding the particle at position x is |ψ(x,t)|² — quantum mechanics is inherently probabilistic (Sakurai & Napolitano, 2017).

Complementarity principle (Bohr): Wave and particle behaviors are complementary. When you measure which slit an electron passed through, the interference pattern disappears.

Computing Relevance

The wave nature of electrons explains quantum tunneling (limiting transistor scaling), electron diffraction (chip defect inspection), and photon behavior (QKD security).

⚛️

Quantum Superposition

Probability Amplitudes · Exponential State Space · Interference

▼

Superposition is one of the two foundational pillars of quantum computing power (the other being entanglement). In classical computing, a bit is either 0 or 1. In quantum mechanics, a system can exist in a linear combination of multiple states simultaneously (Nielsen & Chuang, 2010).

General Qubit State |ψ⟩ = α|0⟩ + β|1⟩
|α|² + |β|² = 1 · Probabilities: P(0) = |α|² , P(1) = |β|²

Feature	Classical Bit	Qubit
State	Either 0 or 1	α\|0⟩ + β\|1⟩ (both simultaneously)
n units	Holds exactly 1 value	Superposition of 2ⁿ values
50 units	One 50-bit number	2⁵⁰ ≈ 10¹⁵ states simultaneously
Measurement	Read without disturbance	Collapses to \|0⟩ or \|1⟩ (irreversible)

Interference: Because amplitudes are complex numbers, they can interfere constructively (adding up) or destructively (canceling). Quantum algorithms amplify correct answers and cancel wrong ones through controlled interference.

The Hadamard gate (H) creates superposition: applying H to |0...0⟩ creates an equal superposition of all 2ⁿ computational basis states. This is the gateway to quantum parallelism (Preskill, 1998).

Key Concept

Superposition is NOT "the qubit is 0 and 1 at the same time" — it exists in a probability amplitude space where measurement forces a definite outcome. The power comes from manipulating amplitudes before measurement.

🔗

Quantum Entanglement

Bell States · Bell Inequalities · EPR Paradox · Quantum Teleportation

▼

Entanglement is the phenomenon where quantum states of two or more particles become correlated such that the state of each particle cannot be described independently — even when separated by arbitrarily large distances. Einstein called it "spooky action at a distance" (Bell, 1964; Ekert, 1991).

Bell State (Maximally Entangled) |Φ⁺⟩ = (1/√2)(|00⟩ + |11⟩)
Cannot be written as |ψ_A⟩ ⊗ |ψ_B⟩ — the particles are inseparable

If qubit A is measured as |0⟩, qubit B instantaneously collapses to |0⟩; if A gives |1⟩, B gives |1⟩ — regardless of distance.

Bell's theorem (1964): John Bell proved that if quantum correlations were due to local hidden variables, they would satisfy certain mathematical inequalities (Bell inequalities). Experiments by Aspect (1982), Hensen et al. (2015, loophole-free), and others have repeatedly violated Bell inequalities, confirming that entanglement is genuinely non-local (Bell, 1964).

How entanglement is created:

SPDC: A photon through a nonlinear crystal splits into two entangled photons
Quantum gates: H gate + CNOT on |00⟩ creates the Bell state |Φ⁺⟩
Atomic interactions: Controlled collisions or photon exchange

Application	Description
Quantum Teleportation	Transmit an unknown quantum state via entanglement + classical channel (no FTL information)
Quantum Dense Coding	Send 2 classical bits using 1 qubit via pre-shared entanglement
Quantum Computing	Multi-qubit entanglement enables quantum parallelism (Shor's exponential speedup)
E91 Protocol	Entanglement-based QKD — Bell inequality violation certifies key security (Ekert, 1991)

With 300 entangled qubits, the system inhabits a Hilbert space with 2³⁰⁰ dimensions — vastly exceeding the number of atoms in the observable universe (Nielsen & Chuang, 2010).

Key Concept

Entanglement is a resource, not communication. No information travels faster than light. The classical channel is always required. But entanglement enables computational and cryptographic feats impossible classically.

🚇

Quantum Tunneling

Transmission Coefficient · Flash Memory · Josephson Junctions · MOSFET Leakage

▼

Quantum tunneling is the phenomenon by which a particle penetrates and passes through a potential energy barrier that it would classically be forbidden to cross. It arises from the wave nature of particles (Seabaugh & Zhang, 2010).

Transmission Coefficient (Tunneling Probability) T ≈ exp(−2κL) , where κ = √(2m(V₀−E)) / ℏ
L = barrier width · V₀ = barrier height · E = particle energy · m = mass

Key observations: Tunneling probability decreases exponentially with barrier width L, increases for lighter particles, and decreases with the barrier height above the particle's energy.

Application	Mechanism	Impact
Flash Memory	Fowler-Nordheim tunneling through thin gate oxide traps charge on floating gate	How flash drives write/erase data
Tunnel Diodes	Heavily doped p-n junctions exploit tunneling for ultra-fast switching	High-frequency oscillators
STM Microscope	Tunneling current varies exponentially with tip-surface distance	Atomic-resolution imaging
MOSFET Leakage	Gate oxides below ~2 nm → direct tunneling becomes dominant leakage	Limits transistor scaling
Josephson Junctions	Cooper pairs tunnel through thin insulator between superconductors	Basis of IBM/Google quantum processors
D-Wave Annealing	Quantum tunneling escapes local minima in optimization landscapes	Optimization faster than classical annealing

Key Insight

Quantum tunneling is both a problem (MOSFET leakage limits Moore's Law) and a resource (flash memory, Josephson junctions, quantum annealing). The same physics that limits classical computing enables quantum computing.

📐

Quantum States & Dirac Notation

Kets · Bra-Ket · Density Matrices · Hilbert Space

▼

Paul Dirac introduced bra-ket notation in 1939 as a compact mathematical language for quantum mechanics. It is now universally used in quantum computing (Nielsen & Chuang, 2010; Sakurai & Napolitano, 2017).

Notation	Name	Meaning
\|ψ⟩	Ket	State vector in Hilbert space. \|0⟩ = [1,0]ᵀ, \|1⟩ = [0,1]ᵀ
⟨ψ\|	Bra	Conjugate transpose of ket. ⟨0\| = [1,0], ⟨1\| = [0,1]
⟨φ\|ψ⟩	Inner product	Complex number. ⟨0\|0⟩ = 1 (normalized), ⟨0\|1⟩ = 0 (orthogonal)
\|ψ⟩⟨φ\|	Outer product	Matrix/operator. \|ψ⟩⟨ψ\| is a projector onto \|ψ⟩
⟨ψ\|Ô\|ψ⟩	Expectation value	Average measurement outcome for observable Ô in state \|ψ⟩

Physical qubit implementations:

Spin-up/spin-down states of an electron
Two lowest energy levels of a trapped ion (IonQ)
Two polarization states of a photon (PsiQuantum)
Two energy levels of a superconducting circuit — transmon (IBM, Google)
Ground/excited state of a neutral atom (QuEra)

Multi-qubit states: Two qubits span a 4-dimensional Hilbert space: |ψ⟩ = a₀₀|00⟩ + a₀₁|01⟩ + a₁₀|10⟩ + a₁₁|11⟩. In general, n qubits require 2ⁿ complex numbers — the source of quantum computational power.

Density matrices: A mixed state (statistical ensemble due to decoherence) is described by ρ = Σᵢ pᵢ |ψᵢ⟩⟨ψᵢ| where pᵢ are classical probabilities with Σpᵢ = 1.

Key Concept

Dirac notation is the "programming language" of quantum mechanics. |0⟩ and |1⟩ are the quantum analog of bits 0 and 1. Master bra-ket notation and everything else in quantum computing follows.

🌐

The Bloch Sphere

Parameterization · Visual Representation · Gates as Rotations

▼

The Bloch sphere is a geometric representation of the state space of a single qubit. It maps every pure qubit state to a unique point on the surface of a unit sphere, providing intuitive visualization of quantum operations (Nielsen & Chuang, 2010).

Bloch Sphere Parameterization |ψ⟩ = cos(θ/2)|0⟩ + e^(iφ) sin(θ/2)|1⟩
θ ∈ [0, π] (polar angle) · φ ∈ [0, 2π) (azimuthal angle)

Point	Angles	State
North pole (+Z)	θ = 0	\|0⟩
South pole (−Z)	θ = π	\|1⟩
+X axis	θ = π/2, φ = 0	(\|0⟩+\|1⟩)/√2 = \|+⟩
−X axis	θ = π/2, φ = π	(\|0⟩−\|1⟩)/√2 = \|−⟩
+Y axis	θ = π/2, φ = π/2	(\|0⟩+i\|1⟩)/√2
−Y axis	θ = π/2, φ = 3π/2	(\|0⟩−i\|1⟩)/√2

Bloch Sphere Visualization:

|0⟩ (North pole) ● /|\ / | \ |−⟩ ●---|---● |+⟩ ← equator = superposition states \ | / \|/ ● |1⟩ (South pole) Single-qubit gates = rotations of the Bloch vector: • Pauli-X: 180° around X-axis (bit flip) • Pauli-Z: 180° around Z-axis (phase flip) • Hadamard: 180° around axis bisecting X and Z

Mixed states (caused by decoherence) are points inside the sphere (Bloch vector length < 1). The center represents the maximally mixed state ρ = I/2.

Limitation: The Bloch sphere represents single-qubit states only. Entangled multi-qubit states require higher-dimensional Hilbert spaces that cannot be visualized on a single sphere (Preskill, 1998).

Key Concept

The Bloch sphere is your visual debugger for single-qubit operations. North pole = |0⟩, South pole = |1⟩, Equator = superposition states. Every quantum gate is a rotation on this sphere.

🔀

Quantum Gates

Pauli X/Y/Z · Hadamard · CNOT · Toffoli · SWAP · Universality

▼

Quantum gates are reversible transformations on qubit states, represented by unitary matrices (U†U = I). All quantum gates preserve total probability and are reversible — a fundamental difference from classical gates like AND/OR (Nielsen & Chuang, 2010).

Single-Qubit Gates:

Pauli-X

[ 0 1 ]
[ 1 0 ]

Bit flip: |0⟩↔|1⟩ (quantum NOT)

Pauli-Y

[ 0 −i ]
[ i 0 ]

Combined bit + phase flip

Pauli-Z

[ 1 0 ]
[ 0 −1 ]

Phase flip: |1⟩ → −|1⟩

Hadamard (H)

(1/√2) [ 1 1 ]
[ 1 −1 ]

Creates superposition: H|0⟩ = |+⟩

S Gate

[ 1 0 ]
[ 0 i ]

π/2 phase to |1⟩

T Gate

[ 1 0 ]
[ 0 e^(iπ/4) ]

π/4 phase to |1⟩ · {H,T} is universal

Multi-Qubit Gates:

CNOT

[ 1 0 0 0 ]
[ 0 1 0 0 ]
[ 0 0 0 1 ]
[ 0 0 1 0 ]

If control=|1⟩, flip target. Creates entanglement.

Toffoli (CCNOT)

3-qubit: flip target only
when BOTH controls = |1⟩

Universal for classical reversible computation

SWAP

Exchanges states of
two qubits = 3 CNOTs

|ψ⟩|φ⟩ → |φ⟩|ψ⟩

Universality: A gate set is universal if any n-qubit unitary can be approximated to arbitrary precision. Universal sets include: {H, CNOT, T}, {Toffoli, H}, and {CNOT, all single-qubit unitaries} (Di Vincenzo, 1995).

Key Concept

H + CNOT = entanglement factory (creates Bell states). H + T = any single-qubit rotation (Solovay-Kitaev theorem). {H, CNOT, T} = universal quantum computation. These three gates are all you need.

⚡

Quantum Algorithms

Shor's · Grover's · QAOA · VQE

▼

Quantum algorithms exploit superposition, interference, and entanglement to solve specific problems exponentially or polynomially faster than the best known classical algorithms (Shor, 1994; Grover, 1996; Farhi et al., 2014).

Shor's Algorithm (1994) — Integer Factorization

How Shor's Algorithm Works:

Step 1: Reduce factoring to order-finding: find period r of f(x) = aˣ mod N Step 2: Quantum Fourier Transform (QFT) finds r efficiently QFT maps periodic function → frequency peaks at multiples of 1/r Step 3: Classical post-processing: gcd(a^(r/2) ± 1, N) → factors with high probability Classical: exp(O(n^⅓ log^⅔ n)) — sub-exponential Quantum: O((log N)² log log N) — POLYNOMIAL ← exponential speedup!

Security impact: A fault-tolerant quantum computer running Shor's would break RSA, Diffie-Hellman, and ECC. Estimates: ~20 million physical qubits needed to break RSA-2048 in 8 hours. This motivates the urgent PQC transition (NIST, 2024a).

Grover's Algorithm (1996) — Unstructured Search

Grover's Search Steps:

1. Initialize n qubits → equal superposition of all N = 2ⁿ states 2. Apply oracle O_ω → flips phase of target: O_ω|ω⟩ = −|ω⟩ 3. Apply diffusion operator (inversion about the average) → amplifies marked state amplitude 4. Repeat ~π√N/4 times, then measure Classical: O(N) checks needed Quantum: O(√N) checks — QUADRATIC speedup

Security impact: Grover's effectively halves symmetric key security. AES-128 → only 64-bit quantum security. AES-256 → 128-bit quantum security (considered quantum-safe) (Grover, 1996).

QAOA — Quantum Approximate Optimization (Farhi et al., 2014)

Step	Description
1. Encode	Map optimization problem to cost Hamiltonian H_C (ground state = optimal solution)
2. Apply layers	p alternating layers of cost unitary e^(−iγH_C) and mixing unitary e^(−iβH_B)
3. Measure & optimize	Measure ⟨H_C⟩, classically optimize γ and β via gradient descent
4. Extract	Repeat until convergence; measure to extract approximate solution

GlideCart relevance: QAOA is directly applicable to Vehicle Routing Problem (VRP) and Traveling Salesman Problem (TSP) — optimal delivery paths for an autonomous cart. Encodable as QUBO. IBM Quantum demonstrated convergence in ~25 iterations (Farhi et al., 2014).

VQE — Variational Quantum Eigensolver (Peruzzo et al., 2014)

A hybrid quantum-classical algorithm that finds ground state energy of quantum systems. Choose ansatz U(θ), prepare |ψ(θ)⟩ on quantum hardware, measure E(θ) = ⟨ψ(θ)|H|ψ(θ)⟩, and classically optimize θ. By the variational principle, E(θ) ≥ E₀, so minimization converges toward the ground state. Applications: drug discovery, materials science, battery design (Peruzzo et al., 2014).

Algorithm Summary

Shor's = breaks RSA (exponential speedup). Grover's = fast search (quadratic speedup, halves key length). QAOA = optimization on NISQ hardware (GlideCart routing). VQE = quantum chemistry simulation.

🛡️

Quantum Error Correction

Repetition Codes · Steane [7,1,3] · Surface Codes · Fault-Tolerant Thresholds

▼

Quantum information is extraordinarily fragile. Unlike classical bits, qubits suffer from bit-flip errors (X), phase-flip errors (Z), and decoherence. The no-cloning theorem prevents redundant copying, so quantum error correction must encode logical qubits into larger entangled states (Steane, 1996; Calderbank & Shor, 1996).

Repetition Code (Bit-Flip Protection)

3-Qubit Repetition Code:

Encode: |0_L⟩ = |000⟩ , |1_L⟩ = |111⟩ If one qubit flips: |010⟩ → majority vote → correct! Limitation: Only corrects bit-flip errors, not phase flips.

Steane [[7,1,3]] Code (1996)

Property	Detail
Encoding	1 logical qubit in 7 physical qubits
Error correction	Corrects any single-qubit error (both bit-flip and phase-flip)
Distance	3 — corrects up to 1 error, detects up to 2
Based on	Classical [7,4,3] Hamming code (CSS construction)
Implementation	9 CNOT + 4 Hadamard gates; demonstrated on trapped-ion and superconducting platforms (Steane, 1996)

Surface Codes — The Leading Approach

Surface codes are favored by Google, IBM, and Microsoft for large-scale fault-tolerant quantum computing. Physical qubits are arranged on a 2D grid; a distance-d surface code encodes 1 logical qubit in ~d² physical qubits and corrects up to ⌊(d−1)/2⌋ errors (Acharya et al., 2024).

Google Willow (2024) breakthrough: Distance-7 code on 101 qubits achieved 0.143% ± 0.003% logical error per cycle. Logical error rate suppressed by factor Λ = 2.14 ± 0.02 when code distance increased by 2. First convincing demonstration of below-threshold operation (Acharya et al., 2024).

Code Type	Threshold	Notes
Surface code	~0.5–1% per gate	Most hardware-compatible
Concatenated codes	~10⁻³–10⁻⁴	Theoretical; harder experimentally
Color codes	~0.1–0.2%	Advantages for transversal gates

Fault-Tolerance Theorem

If physical error rates per gate are below threshold p_th (~1% for surface codes), then arbitrarily accurate quantum computation is possible at polynomial overhead cost (Knill et al., 1998; Aharonov & Ben-Or, 1997).

🔐

Quantum Cryptography & Post-Quantum

BB84 Protocol · QKD · NIST FIPS 203/204/205 · Lattice Cryptography

▼

Quantum cryptography uses the laws of physics — rather than computational hardness assumptions — to achieve provably secure communication (Bennett & Brassard, 1984).

BB84 Protocol (Bennett & Brassard, 1984)

BB84 QKD Protocol Steps:

1. Alice prepares photons in random polarization states: Rectilinear (+): → (0) or ↑ (1) Diagonal (×): ↗ (0) or ↘ (1) 2. Alice → sends photons → Bob (quantum channel) 3. Bob measures each photon using random basis (+) or (×) 4. Sifting: Compare bases over classical channel. Keep only matching-basis bits (~50%) → "sifted key" 5. Error check: Compare random subset → estimate QBER If QBER > ~11% → ABORT (eavesdropping detected!) 6. Post-processing: Error correction + privacy amplification → Final secure key Security: Heisenberg uncertainty + no-cloning theorem → ANY eavesdropping introduces detectable errors

QKD landscape:

Protocol	Year	Type	Key Feature
BB84	1984	Prepare-and-measure	Polarization states (Bennett & Brassard, 1984)
B92	1992	Prepare-and-measure	Only 2 non-orthogonal states
E91 (Ekert)	1991	Entanglement-based	Bell inequality violation certifies security (Ekert, 1991)
SARG04	2004	Prepare-and-measure	Improved vs. photon-number-splitting attacks
CV-QKD	2000s	Continuous variable	Gaussian states, standard detectors

NIST Post-Quantum Cryptography Standards (August 2024)

Standard	Algorithm	Type	Mathematical Basis
FIPS 203	ML-KEM (Kyber)	Key encapsulation	Module lattice (Learning With Errors)
FIPS 204	ML-DSA (Dilithium)	Digital signature	Module lattice
FIPS 205	SLH-DSA (SPHINCS+)	Digital signature	Stateless hash-based

Lattice problems (Learning With Errors, Shortest Vector Problem) are believed hard for both classical and quantum computers — no known quantum speedup. NIST IR 8547 mandates federal migration to PQC by 2025–2026, with full migration by 2035 (NIST, 2024d).

"Harvest Now, Decrypt Later" (HNDL): Adversaries store encrypted data today to decrypt once quantum computers arrive. This makes immediate PQC migration critical — even though large-scale quantum computers are years away.

Dual Strategy

PQC (FIPS 203/204/205) = deploy NOW on existing hardware for software security. QKD = deploy for high-assurance point-to-point links (government, finance). Use hybrid classical+PQC encryption as a transition measure.

📉

Decoherence & Noise Models

T₁/T₂ Times · Depolarizing · Amplitude Damping · Magic State Distillation

▼

Decoherence is the process by which a quantum system loses its coherent quantum properties through unintended interactions with its environment. It is the primary obstacle to building useful quantum computers (Abanin et al., 2019).

Parameter	Symbol	Definition	Typical Values
Relaxation time	T₁	Time for excited → ground state decay	Superconducting: 10–500 μs; Ions: ~100 s
Dephasing time	T₂	Time for phase coherence decay	T₂ ≤ 2T₁
Gate time	t_gate	Time to perform one quantum gate	SC: ~10–100 ns; Ions: ~1–100 μs
Coherence ratio	T₂/t_gate	Gates possible before decoherence	Need >10,000 for fault tolerance

Standard Noise Models

Model	Formula	Physical Meaning
Depolarizing	ε(ρ) = (1−p)ρ + p·I/2	With probability p, qubit replaced by completely mixed state
Amplitude damping	\|1⟩ decays to \|0⟩	Models T₁ relaxation (spontaneous emission)
Dephasing	Off-diagonals of ρ decay	Models T₂ dephasing without energy loss
Pauli channel	Random {I, X, Y, Z} errors	Standard model for surface code threshold calculations

Magic state distillation: Universal fault-tolerant quantum computation requires high-quality T gates (non-Clifford). These cannot be implemented transversally in most codes, requiring distillation of high-fidelity T states from many noisy ones. QuEra and Harvard demonstrated the first logical-level magic state distillation in 2025 — a key milestone (Bluvstein et al., 2024).

Key Concept

Decoherence is the enemy. T₂/t_gate > 10,000 is the target. Trapped ions have the best coherence times (seconds) but slowest gates. Superconducting qubits are fast but decohere in microseconds. The race is to push error rates below threshold before decoherence destroys the computation.

🖥️

Quantum Hardware Platforms

IonQ · IBM · Google · PsiQuantum · QuEra — Comparison

▼

Four major physical platforms compete for quantum advantage, each with distinct trade-offs (Duan & Monroe, 2010; Acharya et al., 2024; Strikis et al., 2025; Bluvstein et al., 2024).

Platform Comparison

Property	Trapped Ion (IonQ)	Superconducting (IBM/Google)	Photonic (PsiQuantum)	Neutral Atom (QuEra)
Coherence	Excellent (s–min)	Good (μs–ms)	Excellent	Excellent (s)
Gate Speed	Slow (μs)	Fast (ns)	Moderate	Moderate (μs)
Fidelity	Highest (99.99%)	High (99.5–99.9%)	Moderate	High (99.5%+)
Scalability	Modular	CMOS-compatible	CMOS-compatible	Tweezer arrays
Temperature	Room + trap	15 mK (cryo)	Room temp	Near room temp
Connectivity	All-to-all	Limited grid	Flexible	Reconfigurable

Key Milestones (2024–2025):

IonQ Forte Enterprise: Commercially deployed on AWS, Azure, Google Cloud. 99.99% two-qubit fidelity. Targeting >2M physical qubits by end of decade (Duan & Monroe, 2010).
IBM Condor/Heron: 1,000+ qubit processors deployed. Heavy-hex connectivity. Million-qubit target by end of decade.
Google Willow (2024): Below-threshold surface code on 105 qubits. Benchmark: 10²⁵ years on classical supercomputer (Acharya et al., 2024).
PsiQuantum (2025): Silicon photonics modules with 98.9% single-photon detector efficiency. Room-temperature, CMOS-compatible manufacturing (Strikis et al., 2025).
Harvard/MIT/QuEra (2025): 448-atom processor, 96 logical qubits, 400+ logical entangling gates below fault-tolerance threshold. First logical-level magic state distillation (Bluvstein et al., 2024).

Platform Summary

IonQ = highest fidelity, slow gates, cloud-accessible. IBM/Google = fastest gates, CMOS scalable, needs cryo. PsiQuantum = room temp, photonic, fab-compatible. QuEra = reconfigurable, most advanced fault-tolerant demo.