Appendix C — Notation Conventions & Glossary

This is the single source of truth for symbols and terminology across the program. Lessons assume these conventions and link here on first use of a term. When a textbook uses a different convention (a few do), we note it.

1. Core Notational Conventions

Symbol	Meaning	Notes
$\lvert\psi\rangle$	ket — a (column) state vector in a Hilbert space $\mathcal H$
$\langle\psi\rvert$	bra — the dual (row) vector, $\langle\psi\rvert = \lvert\psi\rangle^\dagger$	conjugate transpose of the ket
$\langle\phi\vert\psi\rangle$	inner product	linear in the right, antilinear in the left argument
$\lvert\phi\rangle\langle\psi\rvert$	outer product (an operator)	$\lvert\psi\rangle\langle\psi\rvert$ is a projector if $\lvert\psi\rangle$ is normalized
$A^\dagger$	adjoint (conjugate transpose) of operator $A$	"dagger"
$A^{*}$	complex conjugate (entrywise)
$A^{T}$	transpose
$\otimes$	tensor product	$\lvert a\rangle\otimes\lvert b\rangle = \lvert a\rangle\lvert b\rangle = \lvert ab\rangle$
$\mathrm{Tr}(A)$	trace	basis-independent sum of eigenvalues
$\mathrm{Tr}_B(\rho)$	partial trace over subsystem $B$	yields reduced state of $A$
$[A,B]$	commutator $AB-BA$
$\{A,B\}$	anticommutator $AB+BA$
$\lVert\,\cdot\,\rVert$	vector norm $\sqrt{\langle\psi\vert\psi\rangle}$	trace norm/operator norm flagged explicitly when used
$\delta_{ij}$	Kronecker delta	$1$ if $i=j$ , else $0$
$\oplus$	direct sum / bitwise XOR	meaning is clear from context; XOR in oracle/algorithm settings
$\bmod$	modulo	as in $a^r \equiv 1 \pmod N$
$\mathbb{C}, \mathbb{R}, \mathbb{Z}$	complex / real / integer fields	$\mathbb{C}^n$ = $n$ -dim complex space
$\hbar$	reduced Planck constant	we set $\hbar = 1$ unless a lesson states otherwise; the Pre-Term keeps $\hbar$ explicit
$:=$	"is defined as"

State vectors and basis

Computational basis for one qubit: $\lvert 0\rangle = \begin{psmallmatrix}1\\0\end{psmallmatrix}$ , $\lvert 1\rangle = \begin{psmallmatrix}0\\1\end{psmallmatrix}$ .
Hadamard / X-basis: $\lvert +\rangle = \tfrac{1}{\sqrt2}(\lvert 0\rangle + \lvert 1\rangle)$ , $\lvert -\rangle = \tfrac{1}{\sqrt2}(\lvert 0\rangle - \lvert 1\rangle)$ .
Y-basis: $\lvert {+}i\rangle = \tfrac{1}{\sqrt2}(\lvert 0\rangle + i\lvert 1\rangle)$ , $\lvert {-}i\rangle = \tfrac{1}{\sqrt2}(\lvert 0\rangle - i\lvert 1\rangle)$ .
Normalization: physical states satisfy $\langle\psi\vert\psi\rangle = 1$ .
Global phase: $\lvert\psi\rangle$ and $e^{i\gamma}\lvert\psi\rangle$ are the same physical state; only relative phases are observable.

Wave mechanics (Pre-Term / position representation)

The Pre-Term works in the position representation with $\hbar$ explicit; these symbols bridge wave mechanics and the Dirac formalism above.

Symbol	Meaning	Notes
$\Psi(x,t)$ , $\psi(x)$	wavefunction — the position-representation state, $\Psi(x,t) = \langle x\vert\Psi(t)\rangle$	$\lvert\Psi(x,t)\rvert^2$ = position probability density (Born rule)
$\hat p = -i\hbar\,\partial_x$	momentum operator (position representation)	$[\hat x,\hat p] = i\hbar$
$\hat H = -\tfrac{\hbar^2}{2m}\partial_x^2 + V(x)$	Hamiltonian in the position representation	eigenvalue problem $\hat H\psi = E\psi$ (time-independent Schrödinger equation)
$\hat a_\pm$ (or $\hat a, \hat a^\dagger$ )	ladder operators of the harmonic oscillator	$[\hat a_-,\hat a_+] = 1$ ; $\hat H = \hbar\omega(\hat a_+\hat a_- + \tfrac12)$
$L^2$ , $L_z$	orbital angular momentum: total (squared) and $z$ -component	eigenvalues $\hbar^2\ell(\ell+1)$ and $\hbar m$
$Y_\ell^m(\theta,\varphi)$	spherical harmonics	joint eigenfunctions of $L^2$ and $L_z$
$n,\ \ell,\ m$	principal / orbital / magnetic quantum numbers	hydrogen: $n \ge 1$ , $0 \le \ell \le n-1$ , $\lvert m\rvert \le \ell$

Qubit ordering and endianness (important!)

We use big-endian ordering: in $\lvert q_0 q_1 \cdots q_{n-1}\rangle$ , qubit 0 is the leftmost / most-significant bit. This matches the bit-strings returned by Braket (measurement_counts keys read qubit 0 first).
Tensor factors follow the same order: $\lvert q_0\rangle \otimes \lvert q_1\rangle \otimes \cdots$ .
⚠️ Some texts and other SDKs (e.g. parts of Qiskit) use little-endian. When porting circuits, reverse bit-strings/wires as needed. We flag this wherever it bites.

2. Standard Operators (quick reference)

Full matrices and identities live in Appendix E. Names and roles:

Symbol	Name	Role
$I$	Identity	does nothing
$X$	Pauli-X / NOT	bit flip; rotation about $x$
$Y$	Pauli-Y	bit+phase flip; rotation about $y$
$Z$	Pauli-Z	phase flip; rotation about $z$
$H$	Hadamard	$Z\leftrightarrow X$ basis change; creates superposition
$S$	Phase ( $\sqrt Z$ )	$\pi/2$ phase on $\lvert 1\rangle$
$T$	$\pi/8$ gate ( $\sqrt S$ )	$\pi/4$ phase; needed for universality
$R_x,R_y,R_z(\theta)$	rotations	$e^{-i\theta\sigma/2}$ about an axis
$\text{CNOT}/\text{CX}$	controlled-NOT	entangling two-qubit gate
$\text{CZ}$	controlled-Z	symmetric entangling gate
$\text{SWAP}$	swap	exchanges two qubits
$\text{CCX}$	Toffoli	controlled-controlled-NOT; reversible AND
$U$	generic unitary	$U^\dagger U = I$
$\rho$	density operator	state (pure or mixed); $\rho\succeq 0$ , $\mathrm{Tr}\rho=1$
$H$ (context!)	Hamiltonian	Hermitian generator of evolution — not the Hadamard. Disambiguated per lesson.

⚠️ Symbol clash: $H$ is both the Hadamard gate and the Hamiltonian. We use $H$ for Hadamard in circuit contexts and $\hat H$ or "the Hamiltonian $H$ " in physics contexts, and always say which on first use in a lesson.

3. Glossary of Terms

Terms are grouped thematically. Each links to the lesson where it's developed (links resolve as the program is generated).

Mathematical foundations

Hilbert space — a complete complex inner-product space; the state space of a quantum system. For qubits it's finite-dimensional, $\mathbb{C}^{2^n}$ .
Unitary operator — $U^\dagger U = UU^\dagger = I$ ; preserves inner products (hence probabilities). All closed-system quantum evolution is unitary.
Hermitian operator — $A = A^\dagger$ ; real eigenvalues; represents an observable.
Eigenvalue/eigenvector — $A\lvert v\rangle = \lambda\lvert v\rangle$ .
Spectral theorem — every normal operator is diagonalizable in an orthonormal eigenbasis.
Tensor product — combines state spaces of subsystems; $\dim(\mathcal H_A\otimes\mathcal H_B) = \dim\mathcal H_A \cdot \dim\mathcal H_B$.
Partial trace — operation $\mathrm{Tr}_B$ producing the reduced state of a subsystem.

Quantum mechanics

Qubit — a two-level quantum system; state in $\mathbb{C}^2$ .
Superposition — a linear combination $\alpha\lvert 0\rangle + \beta\lvert 1\rangle$ .
Born rule — probability of outcome $i$ is $\lvert\langle i\vert\psi\rangle\rvert^2$ .
Projective (von Neumann) measurement — measurement described by orthogonal projectors.
POVM — positive operator-valued measure; the most general measurement.
Observable — a Hermitian operator whose eigenvalues are measurement outcomes.
Expectation value — $\langle A\rangle = \langle\psi\vert A\vert\psi\rangle = \mathrm{Tr}(\rho A)$ .
Entanglement — a correlation with no classical analog; a state of $\mathcal H_A\otimes\mathcal H_B $not expressible as a single product$ \lvert a\rangle\otimes\lvert b\rangle$.
Bell states — the four maximally entangled two-qubit states.
Bloch sphere — geometric representation of a single qubit's state space.
Density matrix $\rho$ — operator describing pure or mixed states; $\rho = \lvert\psi\rangle\langle\psi\rvert$ when pure.
Mixed state — a statistical ensemble of pure states; $\mathrm{Tr}(\rho^2) < 1$ .
Purity — $\mathrm{Tr}(\rho^2)\in[1/d,\,1]$ ; equals $1$ iff pure.
Hamiltonian — Hermitian operator $H$ generating time evolution $U = e^{-iHt}$ (with $\hbar=1$ ).

Quantum computing

Gate — a unitary acting on a small number of qubits.
Circuit — an ordered sequence of gates (and measurements) on a qubit register.
Universal gate set — a finite set of gates that approximates any unitary to arbitrary accuracy (e.g. Clifford + $T$ ).
Clifford group — gates that map Paulis to Paulis under conjugation; efficiently classically simulable (Gottesman–Knill).
No-cloning theorem — no unitary can copy an arbitrary unknown quantum state.
Quantum teleportation — transferring a state using entanglement + 2 classical bits.
Superdense coding — sending 2 classical bits via 1 qubit + shared entanglement.
Quantum Fourier transform (QFT) — quantum analog of the DFT; basis of phase estimation.
Phase kickback — mechanism by which an eigenphase of a controlled- $U$ is written onto the control qubit.
Quantum phase estimation (QPE) — estimates the eigenphase of a unitary; engine of Shor/HHL.

Algorithms & complexity

Oracle / black box — a unitary encoding a function $f$ , queried as a subroutine.
Query complexity — number of oracle calls an algorithm needs.
Amplitude amplification — generalization of Grover's search that boosts a "good" subspace.
Variational quantum algorithm (VQA) — hybrid loop optimizing parameters of a quantum circuit (e.g. VQE, QAOA).
Ansatz — a parameterized circuit family used in a VQA.
BQP — Bounded-error Quantum Polynomial time; problems efficiently solvable by a quantum computer with bounded error.
Trotterization — approximating $e^{-i(A+B)t}$ by interleaving $e^{-iAt}$ , $e^{-iBt}$ .

Noise, hardware & error correction

Decoherence — loss of quantum coherence through environmental coupling.
$T_1$ / $T_2$ — energy-relaxation and dephasing time scales of a physical qubit.
Quantum channel — a completely positive, trace-preserving (CPTP) map describing (possibly noisy) evolution of $\rho$ .
Kraus operators — operator-sum elements $\{E_k\}$ with $\sum_k E_k^\dagger E_k = I$ representing a channel.
Depolarizing / dephasing / amplitude-damping channels — canonical noise models.
Error mitigation — reducing the effect of noise on estimates without full correction (ZNE, readout correction, PEC).
Quantum error correction (QEC) — encoding logical qubits into many physical qubits to detect and correct errors.
Stabilizer code — a code defined by a commuting group of Pauli operators.
Surface code — a leading topological stabilizer code with a high error threshold.
Fault tolerance — performing computation reliably despite faulty components.

AWS Braket (applied)

Device — a backend: a simulator (local/SV1/DM1/TN1) or a QPU.
Quantum task — one circuit-plus-shots submission to a device.
Shots — number of repeated measurements; controls statistical precision and (on QPUs) cost.
SV1 / DM1 / TN1 — on-demand state-vector / density-matrix / tensor-network simulators.
Hybrid Job — a managed run that interleaves classical compute with quantum tasks (for VQAs).
Verbatim compilation — running a circuit exactly as written on a QPU's native gates, bypassing the compiler.
AHS (Analog Hamiltonian Simulation) — Braket's analog (non-gate) paradigm for neutral-atom devices.

4. Conventions Cross-Check Against Textbooks

Topic	Our convention	Watch out for
Bit ordering	big-endian (qubit 0 leftmost)	Qiskit output is little-endian
$\hbar$	$\hbar = 1$	Sakurai/Griffiths keep $\hbar$ explicit
Rotation gates	$R_\sigma(\theta) = e^{-i\theta\sigma/2}$ (half-angle)	some texts/SDKs use $e^{-i\theta\sigma}$
Hadamard "basis"	$X$ -basis = $\{\lvert+\rangle,\lvert-\rangle\}$	"diagonal basis" elsewhere
Inner product linearity	linear in ket (right)	math texts often make it linear in the left
Fourier sign	$\omega = e^{2\pi i/N}$ in QFT	DFT references vary on the sign