Introduction
What quantum computing changes, superposition, entanglement, interference, physical anchors, history, and the book’s roadmap.
Volume I · Foundations · A problem book with full solutions for a two-semester course
Can you derive the result—not merely recognize it?

Volume I of Quantum Computing by Derivation is a problem-driven study and reference book for advanced undergraduates, beginning graduate students, instructors, researchers, and engineers who need more than an introductory survey. The two volumes serve a two-semester first course in quantum computing.
It pairs mathematically explicit derivations with an entrance mock examination, worked problem banks, circuit practice, and structured verification. The aim is active fluency: knowing how a result is built, when it applies, and how to check it.
Volume I contains fourteen chapters and one appendix, beginning with an introduction and entrance mock examination before developing the mathematical and physical foundations of quantum computing.
What quantum computing changes, superposition, entanglement, interference, physical anchors, history, and the book’s roadmap.
A rules-based diagnostic examination with problems and complete solutions.
Kets, bras, inner and outer products, adjoints, completeness, basis changes, operator reconstruction, and continuous bases.
Tensor products, Bell states, traces, commutators, vectors, norms, projectors, eigenvalues, and eigenvectors.
The Stern–Gerlach experiment and the distinction between superposition and statistical mixture.
Pauli identities, projector representations, basis decomposition, commutation relations, exponentials, rotations, and gate conjugation.
Spinors, phases, overlaps, normalization, spin measurement, uncertainty, Bloch vectors, state geometry, and precession.
Single- and two-qubit expectation values, variance, uncertainty, Born-rule examples, shot-based estimators, and Hamiltonian checks.
Single-, two-, and multi-qubit gates, unitarity, rotations, circuit identities, optical gates, interferometers, and controlled operations.
Purity, partial traces, entanglement measures, Kraus operators, Choi representations, state distances, entropy, correlations, and open systems.
Bell and GHZ preparation, measurement structure, reduced states, entropy, teleportation, swapping, separability, and CHSH checks.
Exact evolution from energies to measurements, propagators, Larmor precession, controlled approximation, confinement, and detuning.
Classical Ising bonds, the transverse-field Ising model, XY and Heisenberg exchange, total spin, spectra, conservation, three-spin Hamiltonians, and exact dynamics.
Lie–Trotter and Suzuki formulas, spin-chain circuits, nested commutators, accuracy targets, and slice and resource counts.
A practical appendix on measurement settings and expectation estimation for Pauli strings.

Quantum Algorithms, Variational Methods, and Verification.
This volume continues the problem-solving sequence of Volume I. Its selected second-semester route develops applied quantum algorithms, variational energy estimation, fermionic encodings, generated distributions, parameter sensitivity, and numerical verification.
Thirteen chapters lead to a cumulative final examination.
The three worked questions
Try each problem before opening its worked solution. Every solution keeps the intermediate vectors, matrices, algebra, and independent checks visible.
Sample 01 · Expectation values
Let
This is a single Pauli operator applied to a two-component state, worked out one row at a time.
Complex conjugation changes \(2i\) into \(-2i\). Therefore
The safest route is to calculate \(P|\psi\rangle\) first and only then multiply by \(\langle\psi|\). This keeps the row-by-column bookkeeping visible.
\(X\) swaps the amplitudes.
The factors of \(i\) cancel.
\(Z\) flips the \(|1\rangle\) sign.
Since \(Z^2=I\), \(\langle Z^2\rangle=1\):
Independently, \(p_0=1/5\), \(p_1=4/5\), \(\mu_Z=(+1)p_0+(-1)p_1=-3/5\), and \(\mathbb E[Z^2]=1\).
The Bloch vector \((0,4/5,-3/5)\) has unit length, independently confirming a pure state and consistent arithmetic.
Sample 02 · Dirac notation
Two normalized qubit states are
Taking a bra conjugates every coefficient: \(-i\mapsto+i\) and \(e^{i\pi/4}\mapsto e^{-i\pi/4}\).
The probability is the squared length of the component of \(|\psi\rangle\) along \(|\phi\rangle\), not the complex overlap itself.
Off-diagonal entries are conjugates.
One eigenvalue is one.
The other eigenvalue is zero.
Sample 09 · Entanglement
Consider the normalized two-qubit state
The equal outcomes are \(00\) and \(11\), so \(P(\text{equal bits})=2/3\). The probabilities sum to one.
It is real and symmetric.
Diagonal entries sum to one.
Both eigenvalues are positive.
The global state is pure but the reduced state is mixed. Therefore \(|\Psi\rangle\) is entangled.
The reduced-state entropy is approximately \(0.550\) bits: nonzero, but below the one ebit of a Bell state.
The manuscript makes basis order, notation, intermediate steps, and acceptance criteria visible. Solutions are not compressed into answer-key form; they are written so a reader can reconstruct the reasoning and locate an error.
“The result matters. The route to the result is what makes it reusable.”
Passive familiarity
Definitions and finished formulas can create a sense of recognition without testing whether the formalism can be retrieved and used.
Technical fluency
Worked derivations, problem banks, and computational checks make the reader choose a representation, carry the algebra, and test the result.
The progression runs from Dirac notation, linear algebra, and quantum physics to Pauli algebra, spin-1/2 and Bloch geometry, measurement, circuits, quantum information, entanglement, Hamiltonian dynamics, coupled spins, and product-formula simulation.
A derivation should survive more than one form of scrutiny.
Learn
Follow complete solutions with explicit notation, intermediate reasoning, and clearly stated assumptions.
Practise
Use chapter-aligned problem banks and the entrance mock examination for structured revision.
Verify
Reproduce analytical claims with computational checks and portable implementation guidance.
Book details
Kashani, Shlomo, and Eli Bordo.
Quantum Computing by Derivation.
A Problem Book with Full Solutions
for a Two-Semester Course.
Volume I: Foundations.
Volume II: Quantum Algorithms,
Variational Methods, and Verification.
First edition, 2026. A4 softcover.