Quantum and CircuitsReading edition

The formal endpoint

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

The formal endpoint

Let \(c\) be a finite legal classical NOT/CNOT/Toffoli circuit. For \(n\) input bits and \(a\) zero-initialized ancillas, assume for every \(x\) and both initial target values \(b\) that

\[ \operatorname{run}(c)(x,0^a,b)=(x,0^a,b{\mathbin{\oplus}} f(x)). \]

Write \(T={\operatorname{tc}}(c)\) for its number of Toffoli gates. The Block 02 joint endpoint is

Degree and complete-cover bound

\[ \boxed{{\operatorname{DegreeLE}}(T+1,f)\quad\text{and}\quad 2\beta^*(f)\le T+3.} \]

CircuitObstructions.restored_degree_and_cover_bound

The first conclusion is an explicit certificate that \(f\) has a Boolean polynomial representation of degree at most \(T+1\). The second is the affine-optimized complete safe-cover lower bound, equivalently \(T\ge\max\{0,2\beta^*(f)-3\}\).

This applies even when the output controls intermediate gates, the inputs are modified temporarily, and workspace is dirty internally. It requires restoration only at the boundary. It makes no restriction to clean intermediate representations.

What changed

Block 01 proved that discrepancies between a prefix and an inverse suffix form a complete safe cover. Block 02 supplies the missing degree dependency, proves that the cover parameters exist, constructs the balanced cut, and implements affine-output adjustment using legal zero-Toffoli circuits.

What did not change

The mathematical scope remains the eight maintained claim groups. C02 is still partial as a group: its dual-certificate theorem is not included. The formal source also proves

\[ \beta(f)\le\beta^*(f)\le n. \]

This ceiling prevents the degree parameter alone from producing a superpolynomial lower bound. No new best-known bound or publication-novelty claim is made.

Where the proof lives

Every proof term is in formalization/lean/CircuitObstructions/. The source inventory, archived 21 September elaboration log, and archived axiom report identify the exact statements. The register in this document lists all 115 maintained theorem declarations, including the 40 inherited declarations. Imported standard-library theorems are not counted.

Source and conversion record

Source SHA-256: 36eb83548efd74b42264ab400e359c2de20c701b436b132b8b2859312d2dcdba

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