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 . For fixed and a fixed ordered CNOT skeleton with 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 . If , 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 wires, and AC for the normalized smooth volume.
One-Qubit Euler Decomposition: each gate is a scalar phase times an matrix parameterized by three real Euler angles.
CNOT and Control-Target Order: the first-wire-control CNOT maps to ; the reverse orientation is the same permutation with wires interchanged.
The Euclidean inverse function theorem: a smooth map between equal-dimensional Euclidean neighborhoods with invertible derivative is a local diffeomorphism.
Morse-Sard for Euclidean maps: for a map from an -dimensional Euclidean open set to a -dimensional one, with and , its image has Lebesgue measure zero.
Cayley Charts on the Unitary Matrix Group: is a smooth real manifold of dimension ; 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.
The Pauli matrices: are the displayed Pauli matrices in the ordered computational basis.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: a closed bounded subset of a finite-dimensional real Euclidean space is compact.
Denotational semantics of a finite layered circuit: chronological circuit layers denote the exact matrix product .
Finite circuit resource accounting: the operation model declares the allowed gate alphabet and counts only the named gate occurrences.
The computational basis is orthonormal: the ordered computational basis of a register is orthonormal.
AC is assumed to construct the normalized smooth volume; the optional Haar wording assumes full AC (The Axiom of Countable Choice (), The Axiom of Choice, The Axiom of Choice implies countable choice).
Proof
A matrix in has the form with : 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 is . On each of the eight open sets where one real coordinate is positive or negative, solve that coordinate as ; these smooth charts show 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 is a compact smooth real manifold of dimension . Collecting consecutive one-qubit gates into local layers and moving every scalar factor to the front writes each circuit with the fixed skeleton as where . 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.
Direct inspection of the matrices in [F6] shows that every traceless skew-Hermitian matrix is a unique real combination of : its diagonal entries are and its off-diagonal entries are , with . Fix one CNOT with control and target . Applying its basis action [F2] to the four affected basis vectors gives and . By [F10], the CNOT basis permutation is unitary. Its local commuting subgroup therefore consists of arbitrary factors on the other wires, rotations on , and rotations on . This product has real dimension . A complementary subspace of is spanned by and has dimension four.
Give and local coordinates from the charts in step 1.1 and angle charts on the two circles in . The local product map , , has derivative at equal to . The direct sum makes this derivative an isomorphism between -dimensional coordinate spaces, so [F3] gives neighborhoods on which every nearby local factor is with four real coordinates in and . The group is compact: each is the closed bounded set of matrices with , and a finite product of compact sets is compact. Translating the neighborhood and using compactness gives a finite cover of by such local product charts.
Starting with and proceeding downwards, use a finite chart to write the current local factor as , where is one of finitely many fixed local translations and has four real coordinates. Since commutes with , move it through and multiply it into the next local factor; that product remains in . Repeating this for all CNOTs leaves four-parameter factors and one arbitrary local layer with 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 .
The exact circuit set is compact, hence Borel: by step 1.1 it is the continuous image of the compact space . 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 and is Borel. If , every point of each parameter domain is critical for the smooth map into a target chart of , 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
- Finite circuit resource accounting
- Denotational semantics of a finite layered circuit
- CNOT and Control-Target Order
- The computational basis is orthonormal
- The Pauli matrices
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Morse-Sard for Euclidean maps
- Cayley Charts on the Unitary Matrix Group
- One-Qubit Euler Decomposition
- The Euclidean inverse function theorem
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
- The Axiom of Choice implies countable choice
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
- Vivek S. Shende, Igor L. Markov, and Stephen S. Bullock, Minimal Universal Two-Qubit CNOT-Based Circuits, arXiv:quant-ph/0308033v3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)