Reference, Problems, and Notebooks
Reference material is useful only when its role is clear. A formula sheet supports recall, a state catalog supports recognition, a diagnostic table supports method selection, a problem set supports deliberate practice, and a notebook supports reproducible verification. None replaces the canonical explanation of why a result is true.
This chapter routes readers among those tasks and supplies a common validation protocol. When a lookup uncovers a conceptual gap, follow the canonical links back to the derivation before applying the formula.
Chapter Map
Section titled “Chapter Map”| Need | Canonical page | What it provides |
|---|---|---|
| recall notation or an identity | Formula Sheet | compact formulas with conventions and canonical links |
| recognize a standard state family | Common Composite States | product, Bell, multipartite, Fock, squeezed, determinant, and permanent templates |
| choose an entanglement test | Entanglement Diagnostic Table | state-class-specific diagnostics, conclusions, and limitations |
| practice tensor products and local operators | Tensor Product Exercises | solved basis, matrix, commutator, and coupled-system problems |
| practice reductions and local statistics | Partial Trace Exercises | solved product, Bell, multipartite, measurement, and purification problems |
| practice exchange symmetry | Identical Particle Exercises | solved symmetrization, determinant, exclusion, spin, and occupation problems |
| practice occupation-space operators | Fock Space Exercises | solved ladder, number, fermionic-sign, Hamiltonian, and commutator problems |
| design reproducible calculations | Computational Notebooks | notebook specifications, conventions, tests, and acceptance criteria |
Choose the Tool Before Calculating
Section titled “Choose the Tool Before Calculating”| Situation | Start here | Escalate when… |
|---|---|---|
| a convention or sign is uncertain | formula sheet | the formula’s assumptions are unclear |
| a state resembles a familiar template | common states | the partition or normalization differs |
| the goal is to prove entanglement | diagnostic table | the state lies outside the listed sufficient conditions |
| the algebra feels fragile | solved exercises | the problem introduces a new representation or domain issue |
| a matrix is larger than hand calculation | notebook specifications | convergence, sparsity, or regulator dependence matters |
The escalation rule protects the one-canonical-home policy. Reference entries point to derivations; they do not silently become second derivations.
Lookup Layer
Section titled “Lookup Layer”Formula sheet
Section titled “Formula sheet”The Formula Sheet collects identities for tensor products, partial traces, Schmidt decompositions, entropies, exchange projectors, Fock space, mode operators, and second-quantized Hamiltonians.
Every use still requires a convention check. For example, the partial trace can be written
but the basis must be orthonormal and complete in the traced subsystem. The result is basis independent; an implementation with the wrong basis ordering is not.
Common states
Section titled “Common states”The Common Composite States page helps recognize structure before doing algebra. A state label is not enough: the partition, normalization, phases, and allowed occupations must match.
For example,
is maximally entangled across the two-qubit split, while
is a product state despite having four computational-basis terms. Counting terms is not an entanglement diagnostic.
Diagnostic table
Section titled “Diagnostic table”The Entanglement Diagnostic Table separates state classes and claim strength. Typical first choices are:
- Pure bipartite state: Schmidt rank.
- Mixed two-qubit state: concurrence or PPT.
- Low-dimensional mixed state: PPT criterion.
- Experimental correlators: entanglement witness.
- Gaussian state: covariance-matrix criterion.
These arrows mean “appropriate first tool,” not “universally necessary and sufficient.” A positive partial transpose is sufficient for separability only in specified low-dimensional bipartite settings and selected structured families.
Practice Layer
Section titled “Practice Layer”Tensor products
Section titled “Tensor products”The Tensor Product Exercises develop basis ordering, local operators, Kronecker products, commutators, and simple coupled Hamiltonians. The central bookkeeping identity is
when the operator products are defined. Consequently,
A numerical answer can be correct in one tensor-product ordering and wrong in another, so every solution should state the basis order.
Reduced states
Section titled “Reduced states”The Partial Trace Exercises cover product states, Bell states, multipartite reductions, local statistics, and purification. Core invariants are
and, for every operator ,
The second equality is the defining operational test of a correct reduction.
Identical particles
Section titled “Identical particles”The Identical Particle Exercises move among exchange projectors, coordinate wavefunctions, Slater determinants, spin-spatial symmetry, and occupation notation.
For two particles,
with
The exercise set keeps two questions separate: whether a state obeys the correct exchange symmetry, and whether it is operationally entangled across a specified mode or region partition.
Fock space and second quantization
Section titled “Fock space and second quantization”The Fock Space Exercises cover bosonic square-root factors, fermionic ordering signs, number operators, and one- and two-body Hamiltonians.
The minimal algebraic checks are
for bosons and
for fermions. A number-conserving bilinear obeys
Correct local signs do not guarantee a correct many-mode calculation: the global fermionic mode order must remain fixed.
Computational Layer
Section titled “Computational Layer”The Computational Notebooks page specifies a reproducible suite for basis ordering, partial traces, Schmidt decomposition, Bell correlations, small-chain entropy, fermionic signs, and second-quantized Hamiltonians.
A trustworthy notebook records:
- software and library versions;
- basis ordering and subsystem dimensions;
- physical conventions and units;
- deterministic inputs or random seeds;
- analytic benchmark cases;
- invariant and tolerance checks;
- convergence or cutoff studies when applicable;
- the distinction between exact identities and floating-point evidence.
Code output is evidence only after these checks pass.
State Validation Protocol
Section titled “State Validation Protocol”For a candidate density matrix, verify
where is a documented numerical tolerance. Also check
in a stated matrix norm. Renormalizing a badly formed matrix can hide an upstream error; report the pre-correction residuals.
For a pure-state vector represented numerically,
If the vector is reshaped into subsystem dimensions, verify that the product of those dimensions equals its total length and that the reshape follows the declared basis order.
Partial-Trace Validation
Section titled “Partial-Trace Validation”If , test
Hermiticity and positivity, and several local-observable identities:
Use more than one . Identity, diagonal, and off-diagonal test operators catch different indexing mistakes.
Schmidt and SVD Validation
Section titled “Schmidt and SVD Validation”Write a bipartite pure state in product bases as a coefficient matrix . Its singular-value decomposition is
The Schmidt coefficients are the singular values . Check
and compare
Their nonzero eigenvalues should agree with to tolerance. Near-degenerate singular vectors are not individually stable, although the degenerate subspace and singular values can be stable. Tests should compare invariant subspaces or spectra rather than arbitrary phases and basis choices.
Operator and Hamiltonian Validation
Section titled “Operator and Hamiltonian Validation”For every constructed observable or Hamiltonian, check Hermiticity:
For a claimed conserved quantity , evaluate
For fermionic matrices, test the canonical anticommutation relations over every mode pair, not only one diagonal example. For a second-quantized Hamiltonian, compare a small sector against an independently constructed first-quantized matrix whenever possible.
Entanglement-Claim Validation
Section titled “Entanglement-Claim Validation”Before reporting entanglement, state:
- the subsystem or mode partition;
- whether the state is pure or mixed;
- the diagnostic and its assumptions;
- whether the result is necessary, sufficient, or both;
- numerical tolerance or statistical confidence;
- any postselection, symmetry restriction, or cutoff.
For a pure bipartite state, Schmidt rank greater than one is decisive. For a mixed state, one failed witness does not prove separability. For identical particles, exchange antisymmetry alone does not identify operational subsystems. For Gaussian states, covariance criteria require Gaussianity and a fixed quadrature convention.
Canonical-Home Rule
Section titled “Canonical-Home Rule”The reference layer should remain compact and link outward:
| Reference item | Canonical explanation |
|---|---|
| tensor-product identities | Tensor Product Foundations |
| product and entangled state definitions | Product, Separable, and Entangled States |
| reduced density matrices | Reduced States and Partial Trace |
| Schmidt and mixed-state diagnostics | Bipartite Entanglement |
| exchange symmetry and determinants | Identical Particles and Exchange Symmetry |
| occupation sectors | Fock Space and Occupation Number |
| creation, annihilation, and Hamiltonian lifts | Creation, Annihilation, and Second Quantization |
| Gaussian and EPR conventions | Continuous Variables and Modes |
| field-specific interpretation | Entanglement Across Fields |
When a reference entry begins to require motivation, proof, or substantial caveats, improve the canonical article and link to it rather than growing a duplicate derivation.
Study Workflows
Section titled “Study Workflows”First pass: read the relevant chapter home → solve two exercises without notes → check the supplied solutions → record the first incorrect assumption, not only the final algebraic error.
Exam review: use the Formula Sheet → classify examples with Common Composite States → choose tests with the Entanglement Diagnostic Table → solve a mixed set under time constraints.
Research onboarding: reproduce one analytic benchmark → implement the corresponding notebook checks → vary basis ordering and subsystem dimensions → document tolerances → follow the result back to its canonical theorem or derivation.
Many-body preparation: Identical Particle Exercises → Fock Space Exercises → Computational Notebooks.
Common Mistakes
Section titled “Common Mistakes”- Using a formula sheet as a substitute for assumptions. Every identity has a domain and convention.
- Recognizing a state by the number of basis terms. Factorization and Schmidt structure matter, not term count.
- Choosing a diagnostic before stating the state class. Pure, mixed, Gaussian, and identical-particle settings differ.
- Checking only trace one. A density matrix must also be Hermitian and positive.
- Silently clipping negative eigenvalues. Report residuals and determine whether they are numerical or conceptual.
- Trusting a partial trace without local-observable checks. Index-order mistakes often preserve trace.
- Comparing singular vectors in a degenerate subspace entry by entry. Compare spectra or invariant subspaces.
- Testing one fermionic sign and assuming the convention is global. Check all mode pairs and ordering rules.
- Reporting a notebook plot without acceptance criteria. A plausible curve is not a validation test.
- Calling a failed witness proof of separability. Most witnesses are sufficient detectors, not complete classifiers.
- Copying a derivation into reference material. Link to the canonical home and keep the lookup surface concise.
References
Section titled “References”- P. A. M. Dirac, The Principles of Quantum Mechanics, 4th ed., Oxford University Press, 1958.
- R. Shankar, Principles of Quantum Mechanics, 2nd ed., Springer, 1994.
- J. J. Sakurai and J. Napolitano, Modern Quantum Mechanics, 3rd ed., Cambridge University Press, 2020.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
- A. Peres, Quantum Theory: Concepts and Methods, Kluwer, 1995.
- R. Horodecki et al., “Quantum entanglement,” Reviews of Modern Physics 81, 865–942, 2009.
- G. H. Golub and C. F. Van Loan, Matrix Computations, 4th ed., Johns Hopkins University Press, 2013.
- L. N. Trefethen and D. Bau III, Numerical Linear Algebra, SIAM, 1997.
- A. L. Fetter and J. D. Walecka, Quantum Theory of Many-Particle Systems, Dover, 2003.
- O. Gühne and G. Tóth, “Entanglement detection,” Physics Reports 474, 1–75, 2009.
Exercises
Section titled “Exercises”Exercise 1: Select a diagnostic
Section titled “Exercise 1: Select a diagnostic”Choose an appropriate first entanglement diagnostic for each case: a pure two-qutrit state, an arbitrary mixed two-qubit state, a measured state with only selected correlators, and a two-mode Gaussian state with known covariance matrix. State one limitation for each choice.
Solution
- For the pure two-qutrit state, compute Schmidt rank or the reduced-state spectrum. This requires a pure-state assumption and a specified bipartition.
- For the mixed two-qubit state, PPT is necessary and sufficient for separability; concurrence is also available for two qubits. Neither statement extends unchanged to arbitrary dimensions.
- For selected experimental correlators, use a witness whose expectation can be reconstructed from those measurements. Failure to violate it does not prove separability.
- For the two-mode Gaussian state, use the covariance-matrix partial-transpose criterion in a fixed quadrature convention. The covariance matrix is not complete without Gaussianity.
Exercise 2: Validate a candidate density matrix
Section titled “Exercise 2: Validate a candidate density matrix”A numerical routine returns
Show that it is Hermitian and trace one, and find the condition on for positivity.
Solution
The off-diagonal entries are conjugates, so the matrix is Hermitian, and its trace is one. A Hermitian matrix with positive diagonal entries is positive semidefinite exactly when its determinant is nonnegative:
Therefore positivity requires
Trace and Hermiticity alone would not have caught a larger unphysical value.
Exercise 3: Cross-check an SVD
Section titled “Exercise 3: Cross-check an SVD”A normalized bipartite coefficient matrix has singular values and . Compute the reduced-state spectrum, purity, and entanglement entropy.
Solution
The normalization check is
The nonzero reduced-state eigenvalues are and . Hence
and
Because both Schmidt coefficients are nonzero, the pure state is entangled.
Exercise 4: Design a partial-trace test
Section titled “Exercise 4: Design a partial-trace test”Give three independent checks for a routine that traces out the second qubit of a two-qubit density matrix. Explain what kind of error each can catch.
Solution
- Check . This catches missing or duplicated diagonal blocks.
- Check Hermiticity and positivity of . This catches asymmetric indexing and many invalid contractions.
- Compare local expectations for at least , , and an off-diagonal operator such as :
Diagonal tests catch population ordering; also probes retained coherences. A Bell state and a generic random positive state make useful benchmark cases.
Exercise 5: Acceptance tests for a fermionic Hamiltonian
Section titled “Exercise 5: Acceptance tests for a fermionic Hamiltonian”List a minimal set of acceptance tests for a small-basis implementation of a number-conserving fermionic Hamiltonian.
Solution
A useful minimum is:
- Verify every canonical anticommutator to tolerance.
- Check .
- Construct and check .
- Confirm that the matrix is block diagonal by particle-number sector after the basis is sorted accordingly.
- Compare the vacuum, one-particle, and one small interacting sector against analytic or independently constructed matrices.
- Repeat after a unitary one-particle basis change and compare spectra.
- Record the global fermionic mode order and verify representative sign-sensitive matrix elements.
Together these tests probe the algebra, Hermiticity, conservation law, sector bookkeeping, basis covariance, and ordering signs. Passing only an eigenvalue spot check would leave several independent failure modes undetected.