Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Parameter Count for a Fixed CNOT Skeleton

Statement

Assume ACω to form normalized Frobenius volume on U(2n). For fixed n≥1 and a fixed ordered CNOT skeleton with m CNOTs, arbitrary exact one-qubit gates, and no ancillas, the set of exact circuit matrices is contained in a finite union of smooth images of real parameter spaces of dimension at most 3n+4m+1. If 3n+4m+1<4n, this fixed skeleton has measure zero. Under full AC, it is Haar-null.

Facts & Assumptions

Given: The exact one-qubit/CNOT gate model, a fixed list of CNOT locations on n wires, and ACω for the normalized smooth volume.

[F1]

One-Qubit Euler Decomposition: each U(2) gate is a scalar phase times an SU(2) matrix parameterized by three real Euler angles.

[F2]

CNOT and Control-Target Order: the first-wire-control CNOT maps ∣a,t⟩ to ∣a,t⊕a⟩; the reverse orientation is the same permutation with wires interchanged.

[F3]

The Euclidean inverse function theorem: a smooth map between equal-dimensional Euclidean neighborhoods with invertible derivative is a local diffeomorphism.

[F4]

Morse-Sard for Euclidean maps: for a Cr map from an a-dimensional Euclidean open set to a b-dimensional one, with a<b and r>b−a, its image has Lebesgue measure zero.

[F5]

Cayley Charts on the Unitary Matrix Group: U(2n) is a smooth real manifold of dimension 4n; under ACω, a Borel subset has normalized Frobenius volume zero exactly when it is Lebesgue-null in every chart. Under full AC this is normalized Haar measure.

[F6]

The Pauli matrices: X,Y,Z are the displayed Pauli matrices in the ordered computational basis.

[F8]

Denotational semantics of a finite layered circuit: chronological circuit layers L1,…,Ld denote the exact matrix product ULd⋯UL1.

[F9]

Finite circuit resource accounting: the operation model declares the allowed gate alphabet and counts only the named gate occurrences.

[F10]

The computational basis is orthonormal: the ordered computational basis of a register is orthonormal.

[A1]

ACω is assumed to construct the normalized smooth volume; the optional Haar wording assumes full AC (The Axiom of Countable Choice (ACω), The Axiom of Choice, The Axiom of Choice implies countable choice).

Proof

1.1givenF1F6F7F8F9algebra

A matrix in SU(2) has the form (ab−bˉaˉ) with ∣a∣2+∣b∣2=1: its first column is a unit vector, orthogonality and determinant one fix the second column, as in the two-column calculation in the Euler proof. Conversely, direct multiplication verifies that every displayed matrix is unitary with determinant one. Thus SU(2) is S3⊂R4. On each of the eight open sets where one real coordinate is positive or negative, solve that coordinate as ±1−u12−u22−u32; these smooth charts show SU(2) is a real 3-manifold. It is closed and bounded, hence compact by [F7]. The tangent Lie algebra is the three-dimensional span in [F6]. Thus G=SU(2)n is a compact smooth real manifold of dimension 3n. Collecting consecutive one-qubit gates into local layers and moving every scalar factor to the front writes each circuit with the fixed skeleton as eiϕKmCmKm−1⋯C1K0, where Kj∈G. The scalar phases commute with all gates and combine into one real parameter ϕ; [F1] parameterizes each one-qubit special-unitary factor by three real angles. The chronological matrix convention is [F8], and [F9] fixes the counted gate alphabet.

1.2givenF2F6F10algebra

Direct inspection of the matrices in [F6] shows that every traceless skew-Hermitian 2×2 matrix is a unique real combination of iX,iY,iZ: its diagonal entries are ir,−ir and its off-diagonal entries are z,−zˉ, with r∈R,z∈C. Fix one CNOT Cj with control c and target t. Applying its basis action [F2] to the four affected basis vectors gives CjZcCj=Zc and CjXtCj=Xt. By [F10], the CNOT basis permutation is unitary. Its local commuting subgroup Hj≤G therefore consists of arbitrary SU(2) factors on the n−2 other wires, rotations eisZ on c, and rotations eirX on t. This product has real dimension 3(n−2)+1+1=3n−4. A complementary subspace mj of su(2)n is spanned by iXc,iYc,iYt,iZt and has dimension four.

2.1step 1.1step 1.2F3algebra

Give mj×Hj and G local coordinates from the S3 charts in step 1.1 and angle charts on the two circles in Hj. The local product map Φj:mj×Hj→G, (X,h)↦eXh, has derivative at (0,I) equal to (X,Y)↦X+Y. The direct sum mj⊕hj=su(2)n makes this derivative an isomorphism between 3n-dimensional coordinate spaces, so [F3] gives neighborhoods on which every nearby local factor is eXh with four real coordinates in X and h∈Hj. The group G is compact: each SU(2) is the closed bounded set of matrices (ab−bˉaˉ) with ∣a∣2+∣b∣2=1, and a finite product of compact sets is compact. Translating the neighborhood and using compactness gives a finite cover of G by such local product charts.

2.2step 1.1step 1.2F1F2algebra

Starting with Km and proceeding downwards, use a finite chart to write the current local factor as gℓeXjhj, where gℓ is one of finitely many fixed local translations and Xj has four real coordinates. Since hj commutes with Cj, move it through Cj and multiply it into the next local factor; that product remains in G. Repeating this for all m CNOTs leaves m four-parameter factors and one arbitrary local layer K0 with 3n parameters. Each chart choice has finitely many possibilities, and the global phase adds one parameter, so the exact image is contained in a finite union of smooth images with dimension 4m+3n+1.

3.1step 1.1step 2.2F4F5F7A1algebra∎

The exact circuit set is compact, hence Borel: by step 1.1 it is the continuous image of the compact space S1×Gm+1. Each open Euclidean parameter domain has a countable compact exhaustion, so each smooth parameter image is a countable union of compact, hence closed, subsets of U(2n) and is Borel. If 4m+3n+1<4n, every point of each parameter domain is critical for the smooth map into a target chart of U(2n), since its derivative has rank at most the smaller domain dimension. Apply [F4] on the open preimages of the finitely many target charts from [F5]; each Borel image is Lebesgue-null there, hence volume-null by [F5]. A finite union over parameter-chart choices is still null. Under full AC, [F5] identifies that null set as Haar-null. Thus the fixed skeleton has the claimed null image.

Depends on

Used by

Dependency tree · two levels

91 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources