Quantum and CircuitsReading edition

Proof details and auxiliary derivations

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Verification statements describe the retained edition and its recorded evidence. This HTML presentation adds no Lean execution or proof review.

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

B.1 Proof details and auxiliary derivations

B.1.1 Residue projector formula

Let \(Q{\lvert \psi_k\rangle}=k{\lvert \psi_k\rangle}\). Then

\[ \frac1M\sum_{\ell=0}^{M-1} \omega_M^{-r\ell}e^{2\pi i\ell Q/M}{\lvert \psi_k\rangle} = \left( \frac1M\sum_{\ell=0}^{M-1} \omega_M^{(k-r)\ell} \right){\lvert \psi_k\rangle}. \]

The bracket equals one when \(k\equiv r\pmod M\) and zero otherwise. This proves Equation (3.1) and the orthogonality of the residue packets.

B.1.2 Circuit leakage telescoping

Let \(V_j=PG_jP\). Insert and subtract one factor at a time:

\[ G_m\cdots G_1P-V_m\cdots V_1P = \sum_{k=1}^m G_m\cdots G_{k+1}(G_k-V_k)V_{k-1}\cdots V_1P. \]

Every \(G_j\) has norm one and every \(V_j\) has norm at most one. On \(P{\mathcal H}\),

\[ (G_k-V_k)P=(I-P)G_kP. \]

Taking norms gives Proposition 3.10.

B.1.3 Hypercube quotient coupling

Let

\[ {\lvert k\rangle} = \binom nk^{-1/2} \sum_{|x|=k}{\lvert x\rangle}. \]

Every weight-\(k\) string has \(n-k\) neighbors of weight \(k+1\), while every weight-\((k+1)\) string has \(k+1\) neighbors of weight \(k\). Counting the bipartite edges yields

\[ {\langle k+1\rvert}A{\lvert k\rangle} = \frac{\binom nk(n-k)} {\sqrt{\binom nk\binom n{k+1}}} = \sqrt{(k+1)(n-k)}, \]

proving Equation (4.10).

B.1.4 Symmetric-subspace dimension

A symmetric basis state of \(n\) qudits is indexed by occupation numbers

\[ (n_1,\ldots,n_d), \qquad n_1+\cdots+n_d=n. \]

The stars-and-bars count is

\[ \binom{n+d-1}{d-1}, \]

proving Equation (4.1).

B.1.5 Bosonic and fermionic dimensions

Bosonic occupations are weak compositions of \(N\) into \(m\) parts, giving \(\binom{N+m-1}{N}\). Fermionic occupations are \(N\)-element subsets of \(m\) modes, giving \(\binom mN\).

B.1.6 Acceptance-probability stability

If normalized states \({\lvert \psi\rangle},{\lvert \phi\rangle}\) satisfy

\[ \|{\lvert \psi\rangle}-{\lvert \phi\rangle}\|\le\varepsilon \]

and \(0\le M\le I\), then

\[ |{\langle \psi\rvert} M{\lvert \psi\rangle}-{\langle \phi\rvert} M{\lvert \phi\rangle}| \le 2\varepsilon. \]

Indeed, add and subtract \({\langle \phi\rvert} M{\lvert \psi\rangle}\) and use Cauchy–Schwarz. This converts state-vector leakage bounds into measurement-error bounds.

B.1.7 Orbit quotient invariance

For an automorphism group \(G\), the adjacency matrix commutes with the permutation representation. The fixed subspace of the action is spanned by normalized orbit states. Therefore adjacency preserves that span. Polynomial-time simulation additionally requires direct computation of the quotient entries.

Source and conversion record

Source SHA-256: 23a87511bb01d6ac8a31d9dff3d3290aca01c001576115b905e5ccc8fde31b60

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index