Volume I · Foundations · A problem book with full solutions for a two-semester course

Quantum Computing
by Derivation

Shlomo Kashani · Dr. Eli Bordo

Volume I · First edition · 2026

1Foundations2Full derivations3Circuits4Verification

Can you derive the result—not merely recognize it?

Front cover of Quantum Computing by Derivation, Volume I
View full-size cover

The book

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.

Purchase link coming at publicationExplore Volume ISee Volume II
1

Inside the book

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.

01

Introduction

What quantum computing changes, superposition, entanglement, interference, physical anchors, history, and the book’s roadmap.

02

Entrance Mock Exam

A rules-based diagnostic examination with problems and complete solutions.

03

Dirac Notation

Kets, bras, inner and outer products, adjoints, completeness, basis changes, operator reconstruction, and continuous bases.

04

Linear Algebra Foundations for Quantum Computing

Tensor products, Bell states, traces, commutators, vectors, norms, projectors, eigenvalues, and eigenvectors.

05

Quantum Physics for Quantum Computing

The Stern–Gerlach experiment and the distinction between superposition and statistical mixture.

06

Pauli Matrices and the Single-Qubit Operator Algebra

Pauli identities, projector representations, basis decomposition, commutation relations, exponentials, rotations, and gate conjugation.

07

Spin-1/2 and Bloch Geometry

Spinors, phases, overlaps, normalization, spin measurement, uncertainty, Bloch vectors, state geometry, and precession.

08

Expectation Values and Measurement

Single- and two-qubit expectation values, variance, uncertainty, Born-rule examples, shot-based estimators, and Hamiltonian checks.

09

Quantum Gates and Circuit Operations

Single-, two-, and multi-qubit gates, unitarity, rotations, circuit identities, optical gates, interferometers, and controlled operations.

10

Quantum Information: Density Matrices, Channels, and Entropy

Purity, partial traces, entanglement measures, Kraus operators, Choi representations, state distances, entropy, correlations, and open systems.

11

Entanglement: Bell States, GHZ, and the EPR Paradox

Bell and GHZ preparation, measurement structure, reduced states, entropy, teleportation, swapping, separability, and CHSH checks.

12

Hamiltonians and Exact Time Evolution

Exact evolution from energies to measurements, propagators, Larmor precession, controlled approximation, confinement, and detuning.

13

Coupled Spins: From Ising to Heisenberg

Classical Ising bonds, the transverse-field Ising model, XY and Heisenberg exchange, total spin, spectra, conservation, three-spin Hamiltonians, and exact dynamics.

14

Hamiltonian Simulation by Product Formulas

Lie–Trotter and Suzuki formulas, spin-chain circuits, nested commutators, accuracy targets, and slice and resource counts.

A

Pauli-String Expectation Estimation on a Quantum Computer

A practical appendix on measurement settings and expectation estimation for Pauli strings.

Front cover of Quantum Computing by Derivation, Volume II
View full-size cover

Volume II

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.

01

Quantum Fourier Transform From Derivation to Circuit

02

Advanced Quantum Protocols and Reasoning

03

Algorithmic Methods for Variational and Hamiltonian Problems

04

Applied VQE and Hamiltonian Validation Problems

05

QAOA for Max-Cut Cost Landscapes and Parameter Analysis

06

Fermi-Hubbard Dynamics on Small Lattices

07

Compact VQE Analysis and Diagnostics

08

Molecular VQE for Electronic Structure Problems

09

Quantum Circuit Born Machines

10

Quantum Fisher Information and Parameter Sensitivity

11

Diagnostic Problems in Random Hamiltonians and Teleportation

12

Scaling, Resource Analysis, and Numerical Reporting

13

Cumulative Final Examination

About the authors

2

Two authors, one problem book

Shlomo Kashani

Author

Shlomo Kashani

Shlomo Kashani is an author, educator, and quantum physicist based in Jerusalem. He is co-author of Quantum Computing by Derivation and the author of Deep Learning Interviews, which covers the theoretical and practical foundations of deep learning.

He holds four academic degrees. His studies include advanced signal processing at Queen Mary University of London, where he graduated with distinction, and quantum physics and computing through Johns Hopkins University. He is currently pursuing a fifth degree in Defence and Strategic Studies at Missouri State University.

Dr. Eli Bordo

Author

Dr. Eli Bordo

Dr. Eli Bordo is a physicist by training and a technology leader by profession. He received his Ph.D. in quantum and ultrafast optics from the Technion, Israel Institute of Technology, studying light at the scales where classical intuition begins to give way to quantum mechanics. Today, he leads R&D efforts across quantum technologies, photonics, and other emerging fields, with a particular interest in turning elegant physics into working technology.

3

Three questions from the entrance mock exam

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

Basic expectation values and variance

Warm-up

Let

\[|\psi\rangle=\frac{|0\rangle+2i|1\rangle}{\sqrt5}.\]

This is a single Pauli operator applied to a two-component state, worked out one row at a time.

  1. Verify that \(|\psi\rangle\) is normalized.
  2. Compute \(\langle X\rangle\), \(\langle Y\rangle\), and \(\langle Z\rangle\) directly from the \(2\times2\) Pauli matrices.
  3. Compute \(\operatorname{Var}(Z)\), then check the pure-state Bloch-vector identity.
Open worked solution

1. Normalize the state and form the bra

Complex conjugation changes \(2i\) into \(-2i\). Therefore

\[|\psi\rangle=\frac1{\sqrt5}\begin{pmatrix}1\\2i\end{pmatrix},\qquad \langle\psi|=\frac1{\sqrt5}\begin{pmatrix}1&-2i\end{pmatrix}.\]
Square each amplitude→Add the probabilities→Confirm unit norm
\[\langle\psi|\psi\rangle=\frac{|1|^2+|2i|^2}{5}=\boxed{1}.\]

2. Apply each Pauli matrix before taking the inner product

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
\[X|\psi\rangle=\frac1{\sqrt5}\begin{pmatrix}2i\\1\end{pmatrix},\quad \langle X\rangle=0.\]

\(X\) swaps the amplitudes.

Y
\[Y|\psi\rangle=\frac1{\sqrt5}\begin{pmatrix}2\\i\end{pmatrix},\quad \langle Y\rangle=\frac45.\]

The factors of \(i\) cancel.

Z
\[Z|\psi\rangle=\frac1{\sqrt5}\begin{pmatrix}1\\-2i\end{pmatrix},\quad \langle Z\rangle=-\frac35.\]

\(Z\) flips the \(|1\rangle\) sign.

X mean\(0\)
Y mean\(4/5\)
Z mean\(-3/5\)

3. Compute the variance two ways

Since \(Z^2=I\), \(\langle Z^2\rangle=1\):

\[\operatorname{Var}(Z)=1-\left(-\frac35\right)^2=\boxed{\frac{16}{25}}.\]

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\).

4. Verify the pure-state identity

\[0^2+\left(\frac45\right)^2+\left(-\frac35\right)^2=1.\]
Interpretation

The Bloch vector \((0,4/5,-3/5)\) has unit length, independently confirming a pure state and consistent arithmetic.

Sample 02 · Dirac notation

Overlaps, projectors, and a complex relative phase

Core

Two normalized qubit states are

\[|\psi\rangle=\frac{2|0\rangle-i|1\rangle}{\sqrt5},\qquad |\phi\rangle=\frac{|0\rangle+e^{i\pi/4}|1\rangle}{\sqrt2}.\]
  1. Write both bras and compute \(\langle\phi|\psi\rangle\).
  2. For \(\{P_\phi,I-P_\phi\}\), find the probability of “yes.”
  3. Construct \(P_\phi\), test it, and confirm the probability by matrix methods.
Open worked solution

1. Form the bras carefully

Taking a bra conjugates every coefficient: \(-i\mapsto+i\) and \(e^{i\pi/4}\mapsto e^{-i\pi/4}\).

\[\langle\psi|=\frac1{\sqrt5}\begin{pmatrix}2&i\end{pmatrix},\qquad \langle\phi|=\frac1{\sqrt2}\begin{pmatrix}1&e^{-i\pi/4}\end{pmatrix}.\]
\[\begin{aligned}\langle\phi|\psi\rangle&=\frac1{\sqrt{10}}\left(2-i e^{-i\pi/4}\right)\\&=\frac1{\sqrt{10}}\left[\left(2-\frac1{\sqrt2}\right)-\frac{i}{\sqrt2}\right].\end{aligned}\]

2. Apply the Born rule without skipping the modulus

\[\begin{aligned}p_\phi&=\frac1{10}\left[\left(2-\frac1{\sqrt2}\right)^2+\left(\frac1{\sqrt2}\right)^2\right]\\&=\boxed{\frac{5-2\sqrt2}{10}}\approx0.217157.\end{aligned}\]
Meaning of the answer

The probability is the squared length of the component of \(|\psi\rangle\) along \(|\phi\rangle\), not the complex overlap itself.

3. Construct and test the projector

\[P_\phi=\frac12\begin{pmatrix}1&e^{-i\pi/4}\\e^{i\pi/4}&1\end{pmatrix}.\]
Hermitian\(P_\phi^\dagger=P_\phi\)

Off-diagonal entries are conjugates.

Unit trace\(\operatorname{Tr}P_\phi=1\)

One eigenvalue is one.

Rank one\(\det P_\phi=0\)

The other eigenvalue is zero.

4. Verify idempotence and the probability

\[P_\phi^2=|\phi\rangle\underbrace{\langle\phi|\phi\rangle}_{1}\langle\phi|=P_\phi,\qquad \langle\psi|P_\phi|\psi\rangle=\boxed{\frac{5-2\sqrt2}{10}}.\]

Sample 09 · Entanglement

Reduced states and Schmidt coefficients

Synthesis

Consider the normalized two-qubit state

\[|\Psi\rangle=\frac{|00\rangle+|01\rangle+|11\rangle}{\sqrt3}.\]
  1. Find the complete basis distribution.
  2. Compute \(\rho_A\).
  3. Use \(\rho_A\) to show entanglement.
  4. Find the Schmidt coefficients.
Open worked solution

1. Read every amplitude before squaring

\[|\Psi\rangle=\frac1{\sqrt3}\begin{pmatrix}1\\1\\0\\1\end{pmatrix},\qquad P(00)=P(01)=P(11)=\frac13,\quad P(10)=0.\]

The equal outcomes are \(00\) and \(11\), so \(P(\text{equal bits})=2/3\). The probabilities sum to one.

2. Organize the coefficients before tracing out B

\[|\Psi\rangle=\frac1{\sqrt3}\left[|0\rangle_A(|0\rangle_B+|1\rangle_B)+|1\rangle_A|1\rangle_B\right].\]
\[C=\frac1{\sqrt3}\begin{pmatrix}1&1\\0&1\end{pmatrix},\qquad \rho_A=CC^\dagger=\boxed{\frac13\begin{pmatrix}2&1\\1&1\end{pmatrix}}.\]

3. Validate the reduced state

Hermitian\(\rho_A^\dagger=\rho_A\)

It is real and symmetric.

Normalized\(\operatorname{Tr}\rho_A=1\)

Diagonal entries sum to one.

Positive\(\det\rho_A=1/9>0\)

Both eigenvalues are positive.

4. Use purity to diagnose entanglement

\[\rho_A^2=\frac19\begin{pmatrix}5&3\\3&2\end{pmatrix},\qquad \operatorname{Tr}(\rho_A^2)=\frac79<1.\]

The global state is pure but the reduced state is mixed. Therefore \(|\Psi\rangle\) is entangled.

5. Derive the Schmidt coefficients

\[\det(\rho_A-\lambda I)=\lambda^2-\lambda+\frac19=0,\qquad \lambda_\pm=\frac{3\pm\sqrt5}{6}.\]
\[\boxed{s_\pm=\sqrt{\frac{3\pm\sqrt5}{6}}},\qquad s_+^2+s_-^2=1.\]
Entanglement in one number

The reduced-state entropy is approximately \(0.550\) bits: nonzero, but below the one ebit of a Bell state.

4

Derivation turns familiarity into command

The working sequence
01Framethe state, basis, and assumptions
02Derivethe result line by line
03Verifythe algebra and computation
04Generalizethe method to a new problem

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.”
5

Built for active problem-solving fluency

Passive familiarity

Recognize the vocabulary

Definitions and finished formulas can create a sense of recognition without testing whether the formalism can be retrieved and used.

Technical fluency

Reconstruct the argument

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.

6

From formalism to executable checks

A derivation should survive more than one form of scrutiny.

Analytical control
  • Fix the basis order
  • Track dimensions and phases
  • State assumptions
  • Check limiting cases
Does the implementation reproduce the derivation?
Computational control
  • Construct the operator
  • Run the reference case
  • Compare observables
  • Report tolerance and error
7

One volume, three ways to use it

Learn

Study the derivation

Follow complete solutions with explicit notation, intermediate reasoning, and clearly stated assumptions.

Practise

Work the problem

Use chapter-aligned problem banks and the entrance mock examination for structured revision.

Verify

Test the result

Reproduce analytical claims with computational checks and portable implementation guidance.

Book details

Derive.
Then verify.

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.