Quantum and CircuitsReading edition

Homogeneous projection: cost and safety

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

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

Homogeneous projection: cost and safety

CLAIM C05 This chapter separates the nonlinear cost of a complete function from the nonlinear cost of one extracted homogeneous component. It also shows that an algebraic projection need not preserve safe support.

17.1 Two supporting lower bounds

Lemma 17.1: Affine subspace after multiplication restrictions

If a Boolean function on \(n\) inputs is computed with \(t\) AND gates in an XOR–AND circuit, there is an affine subspace of dimension at least \(n-t\) on which the output is affine.

Proof

Process the AND gates in topological order while maintaining an affine subspace on which all preceding product outputs are affine. The operands of the next gate are then affine on the current subspace. If an operand is constant, their product is already affine. Otherwise impose one nonempty affine equation setting that operand to zero. This loses at most one dimension and makes the product affine. Earlier affine outputs stay affine under restriction. After at most \(t\) restrictions the output is affine on a subspace of dimension at least \(n-t\).

This is the affine-restriction method used in the background literature on multiplicative complexity [53]. The proof is reproduced here in the scalar convention needed below.

Proposition 17.2: Exact cost of a nondegenerate paired quadratic

For even \(n\), let

\[ Q(x)=x_1x_2+x_3x_4+\cdots+x_{n-1}x_n. \]

Then

\[ M(Q)={T_{\mathrm{rest}}}(Q)=n/2. \]

Proof

The polar bilinear form of \(Q\) is the full-rank alternating form made of \(n/2\) disjoint \(2\times2\) blocks. If \(Q\) is affine on an affine subspace with direction space \(U\), its second differences vanish on \(U\), so \(U\) is totally isotropic. Nondegeneracy gives \(\dim U\le n/2\).

Lemma 17.1 therefore implies \(n-t\le n/2\), or \(t\ge n/2\), for any XOR–AND computation. Every restored Toffoli implementation gives such a computation by fixing its ancillary inputs and initial target, so the same lower bound applies to \({T_{\mathrm{rest}}}\). Directly add the \(n/2\) disjoint pair products to the target with one Toffoli each. This attains both bounds and requires no nonlinear work register.

Source and conversion record

Source SHA-256: d4ac05f793c2c04fc6b50c38e0f7e9a44269c2dc948f255a60b5edeecb2f7e4e

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