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.
Controlled Gates, Phase, and Entanglement
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurements, POVMs, and Instruments
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Objective
This page fixes control-first block conventions and separate access contracts for controlled and inverse unitary calls. It proves the distinction between standalone global phase and controlled relative phase, defines CNOT/CZ/SWAP and multi-control activation, and records the two exact projector-reflection signs and their rank-one phase behavior. It introduces no physical realization or free implementation-cost claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
A unit-vector outer product is a density operator
Statement
Let be a nonzero finite-dimensional complex inner-product space with the root pairing linear in its first argument, and let satisfy . Define by the root-linear-first Dirac convention. Then is self-adjoint and idempotent, has one-dimensional range, is non-negative, and has trace one. In particular, is a density operator.
Facts & Assumptions
Given: The finite-dimensional complex inner-product space and a unit vector .
Real and complex inner-product spaces and their induced length: the root pairing is linear in the first argument, conjugate-linear in the second, and conjugate-symmetric.
Dirac Notation Conversion: for every .
The adjoint is characterised by : satisfies .
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear endomorphism of has a unique adjoint.
Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form on every vector.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of the diagonal entries in any basis.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis: for an orthonormal basis , .
Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.
Proof
For every , [F2] and [F3] give , since . Thus is idempotent.
For all , [F1] and [F3] give . The outer product is linear by [F3], so [F4] and [F5] imply .
The image of lies in , and [F2] and [F3] give , so its range is exactly the one-dimensional span of . Also [F1] and [F3] give . With self-adjointness from step 1.2, [F6] makes non-negative.
Choose an orthonormal basis of using [F8]. By [F3] and [F7], , where [F9] gives the Parseval equality. Thus [L1] makes a density operator, using non-negativity from step 2.1. The basis is finite, so no choice axiom is used.
Pure-State Entanglement Across a Tensor Cut
Definition
Let be nonzero finite-dimensional complex inner-product spaces, with the ordered tensor product . A product ray is a ray containing a nonzero decomposable vector with and . A pure state on this cut is entangled when its ray is not a product ray.
For a nonzero vector , its Schmidt rank is the matrix rank of its coefficient matrix in any ordered orthonormal product basis; the verification proves this is independent of that basis. It also proves that this rank equals the number of positive terms in every Schmidt decomposition. Thus a pure ray is entangled exactly when its Schmidt rank exceeds one.
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces , their product inner product and ordered tensor convention, and a unit vector .
Pure state and ray defines a pure state as the equivalence class of a nonzero vector under multiplication by a nonzero complex scalar. Its current draft definition body was inspected; only this ray convention is used below, not its separate projector assertion.
Ordered tensor registers, their inner product, and wire permutations defines the ordered product basis and product inner product on elementary tensors. Its current draft proof was read; the basis construction, pairing, basis independence and permutation claims are derived from the listed tensor-product and coordinate interfaces.
Schmidt decomposition states that every tensor has a Schmidt expansion with positive coefficients and orthonormal factor families, whose coefficients are the positive singular values of the product-basis coefficient matrix. Its full current draft proof was read, along with the current tensor-register and Dirac-conversion definition bodies; this records body inspection, not acceptance of those draft suppliers.
Row space, column space, nullspace, row rank, column rank and matrix rank: the matrix rank is the dimension of the row space, and row rank equals column rank by Row rank equals column rank, and both equal the number of pivots.
The rank of a matrix equals the rank of the linear map : a matrix has the same rank as its associated coordinate linear map.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: every finite-dimensional map has an SVD with exactly its positive singular values.
The rank of a linear map is the number of its nonzero singular values: the number of positive singular values of a finite-dimensional map equals its rank.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Verification
Choose ordered orthonormal bases of using [F5], and let be the coefficient matrix of in their product basis [L2]. For any other ordered orthonormal bases, let have the new basis vectors as columns in the old coordinates. Their columns are orthonormal, so the finite row-by-column identities hold; because they are basis changes, both matrices are invertible and hence unitary. Expanding the new product basis vectors in the old one and using conjugate-linearity in the second argument gives , so the new coefficient matrix is . The factors and are invertible, so the map represented by is , where is the map represented by . Since is onto, its image is ; since is injective, this image has the same dimension as . By [F2], the matrix rank is therefore unchanged, so it is basis-independent. Multiplying by any nonzero scalar multiplies by that scalar and also preserves its rank.
In any Schmidt decomposition with all and orthonormal factor families, tensor coordinates multiply, so its coefficient matrix is , where the columns of are the coordinates of the and . The orthonormal columns give , so is injective; conjugating gives , so is surjective; and is invertible. Thus . Conversely, [L3] constructs such a Schmidt decomposition from the SVD, and [F3] and [F4] show that its number of positive coefficients is the rank of . Therefore the number of terms is the same for every Schmidt decomposition and equals the defined Schmidt rank.
If for nonzero , its coefficient matrix is for the coordinate columns , so its rank is one. Conversely, if has rank one, choose a nonzero column ; every column is a scalar multiple , so with . The coefficient expansion then gives for the vectors with coordinates . Thus the ray is a product ray exactly when the Schmidt rank is one.
Since , its coefficient matrix is nonzero and has positive rank. By the product-ray equivalence in step 2.1, failure to be a product ray is equivalent to Schmidt rank greater than one, which is precisely entanglement by the Definition.
Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged
Statement
Let be a nonzero finite-dimensional complex inner-product space with the root pairing linear in the first argument. For nonzero , put . If has , then and determine the same rank-one density operator. Consequently, for every finite POVM on , each defined outcome probability satisfies
The unnormalized vector itself gives and is not a density operator when .
Facts & Assumptions
Given: The finite-dimensional space and nonzero in the Statement, a scalar with , and a finite POVM .
Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument, conjugate-linear in its second, and positive definite.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any chosen basis.
Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.
Finite POVMs and their outcome law defines a finite POVM and the outcome weight for a density operator. Its current draft definition body was read.
Dirac Notation Conversion defines . Its current draft definition body was read.
A unit-vector outer product is a density operator proves directly that the outer product of every unit vector is a density operator, including its trace-one verification by Parseval.
POVM outcome weights are probabilities states nonnegativity and normalization of finite POVM weights. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.
Proof
Positive definiteness gives , so is defined. By [F1] and [F2], . Again using linearity in the first argument and conjugate-linearity in the second, . Taking nonnegative square roots gives both norms equal to one.
For every , the root-first conversion [L3] gives . Hence the two rank-one operators are equal.
By [L4], the common operator is a density operator, so the outcome law [L2] defines its weight for each effect . Since the density operator is identical for and , those weights agree; [L5] proves the finite family of weights is a probability distribution.
Since with a nonnegative real, [F1] and [L3] give . In any basis, its matrix is therefore times the matrix of ; summing the diagonal entries in that basis as in [F3] gives by [L4]. If , it is not trace one and hence is not a density operator by [L1].
Controlled Unitary Access
Definition
Let be a control qubit with ordered orthonormal basis , let be a finite-dimensional complex inner-product space, and let be unitary. On the control-first register , define
Thus and . Controlled access means that the chosen operation model explicitly grants a call to this block operator. An ordinary call to a black-box does not silently grant a controlled call, and no query or gate cost is assigned unless the model states it.
Facts & Assumptions
Given: The finite target space , the ordered control-first tensor product, and a unitary on .
Ordered tensor registers, their inner product, and wire permutations defines the ordered factors and product inner product after an ordered orthonormal basis is specified for each factor. Its proof establishes that the pairing is independent of those basis choices.
Exact one-qubit gates and rotations fixes the ordered qubit computational basis and exact one-qubit matrices. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft and no acceptance is claimed.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary operator on a finite-dimensional complex inner-product space is an invertible linear isometry, so it preserves every vector norm and has an inverse.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an ordered orthonormal basis.
Verification
Choose an ordered orthonormal basis of using [F2]. Together with the control basis in [L2], it supplies the factor bases required by [L1]; the pairing is independent of this choice by [L1]. Write an arbitrary vector of as . The orthonormal control basis and the product inner product from [L1] give squared norm .
The block operator sends that vector to . By [F1], , so the squared norm is unchanged.
The block matrix is a two-sided inverse for , so is invertible as well as norm-preserving. By the unitary definition in [F1], is unitary.
Relative Phase
Definition
Fix an ordered orthonormal pair in a finite-dimensional complex inner-product space. If a vector has nonzero coordinates on this pair, its relative phase on these coordinates is
The relative phase is undefined when either coordinate is zero. It is unchanged by multiplying the whole vector by any nonzero complex scalar. It can distinguish rays: for the unit vectors , distinct values of give distinct rank-one projectors and distinct rays.
Facts & Assumptions
Given: The ordered orthonormal pair and nonzero coordinates in the Definition.
Real and complex inner-product spaces and their induced length: the root pairing is linear in the first argument and conjugate-linear in the second.
Pure state and ray defines a pure state as a ray under nonzero common scalar multiplication. Its current draft definition body was read.
Exact one-qubit gates and rotations fixes the ordered computational basis for the qubit instance. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.
Dirac Notation Conversion defines and the Dirac pairing. Its current draft definition body was read; the separate coordinate-matrix identity is assigned to its linked QC01 theorem.
Dirac Notation Coordinate Identity proves that the coordinate matrix of is in the stated orthonormal bases. Its current draft proof was read.
Verification
For any nonzero scalar , the ratio of the two coordinates of is . Its unit-modulus part is therefore also unchanged, so the Definition assigns a property of the ray.
Since and are orthonormal, has norm one. In the qubit instance [L2] identifies this ordered pair with . By [L3] and [L4], its rank-one projector has matrix in the ordered pair.
If , the lower-left entries of these two projector matrices differ, so the projectors differ. Also, if for a nonzero scalar , comparison of the coordinate forces and comparison of the coordinate forces , a contradiction. Hence changing the relative phase can change the ray.
Inverse Unitary Access
Definition
For a finite-dimensional unitary , inverse access is the explicitly granted operation . Its availability and query or gate charge are recorded separately from forward access, including any controlled access in Controlled Unitary Access. For a chronological sequence of length that applies first and last, the total operator is when and when . For , the inverse sequence applies first, then , down to ; for it is the empty sequence.
Facts & Assumptions
Given: Finite-dimensional unitaries and an explicit access model for the operations named in the Definition.
Controlled Unitary Access fixes the target unitary whose forward and controlled capabilities are explicitly declared. Its carrier is present in this batch.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: for a finite-dimensional endomorphism, preserving norms implies and .
Adjoints satisfy , , , and : for composable finite-dimensional maps, .
The adjoint is characterised by : the adjoint is characterized by .
Verification
Each is an invertible isometry by the unitary convention in [L1] and [F1]. Thus its adjoint exists in finite dimension and is its inverse, so the inverse call specified in the Definition has the stated mathematical meaning.
For , repeated application of [F2] gives . Acting on a vector from right to left, this applies first and last, exactly reversing the original chronology.
For , the specified total map is and its inverse is also ; there are no calls or operations in either sequence. This covers the empty-sequence endpoint without interpreting an undefined product.
The matrix identity determines the inverse map but says nothing about whether the access model grants or charges its calls. The Definition therefore records inverse availability and cost explicitly instead of inferring either from forward access.
Controlled Phase Rotation
Definition
For a real angle , define the one-qubit phase matrix . In control-first order define
in the ordered basis . This is the exact controlled phase; no circuit cost or controlled access to an arbitrary black-box unitary is implied.
Facts & Assumptions
Given: A real , an ordered control-target qubit pair, and the exact phase convention of the Definition.
Controlled Unitary Access defines the control-first block action . Its carrier is present in this batch.
Exact one-qubit gates and rotations defines the exact exponential and computational basis. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.
Pauli formula for an axis rotation proves by the convergent Pauli exponential series. Its current draft proof was read; its item is now present in the QC07 manifest and page; the page remains draft.
The computational basis is orthonormal proves the ordered computational basis of is orthonormal; this supplier is in the dependency closure through [L3].
, , and : for real , and .
, and the complex exponential extends the real exponential: for complex .
Verification
The target computational basis is orthonormal by [L4], and [F1] gives modulus one for both diagonal entries of . Thus is an invertible isometry and hence unitary, so [L1] applies to its controlled block. The first control block applies the identity, so and are fixed. In the second block, fixes and sends to . These four actions give the diagonal matrix in the Definition.
Every diagonal entry of has modulus one by [F1]; its conjugate transpose is therefore its inverse, so it is unitary.
By [L3], . By [F2], multiplying it by gives . Therefore , which is the block phase applied after . Dropping that control phase would change the defined operation.
A Controlled Global Phase Becomes a Relative Control Phase
Statement
Let be a nonzero finite-dimensional complex-inner-product space and a unitary. Let , and suppose the model separately grants controlled access to both and . There is a normalized eigenvector with and . Let be the control qubit with ordered computational basis ; define and prepare with target . The two joint effects are . The outcome has probability after and after . Thus the two controlled maps give different outcome laws exactly when ; when , the controlled maps coincide. This is a mathematical witness; it does not assert that controlled access or the witness-state preparation is free.
Facts & Assumptions
Given: The finite-dimensional target , a unitary , a real , separate controlled access to and , and the finite control-state measurement specified in the Statement.
Controlled Unitary Access defines as the control-first block map and treats the capability as explicit. Its carrier is present in this batch.
Finite POVMs and their outcome law defines a finite POVM and the density-operator weight . Its current draft definition body was read.
Ordered tensor registers, their inner product, and wire permutations defines the ordered product pairing after an ordered orthonormal basis is specified for each factor and proves that the pairing is independent of those choices.
Tensor products of finitely many linear maps defines the tensor-map action on elementary tensors and its unique linear extension. Its current draft proof was read.
The computational basis is orthonormal proves the control basis is orthonormal. Its current draft proof was read.
A unit-vector outer product is a density operator proves directly that the outer product of every unit vector in a nonzero finite-dimensional space is a density operator.
Dirac Notation Conversion defines in the root linear-first convention.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis gives Parseval's identity for a finite orthonormal basis.
POVM outcome weights are probabilities states that finite POVM weights of a density operator form a probability distribution. Its current draft proof was read; its density-definition dependency is present in its current frontmatter.
Density operator: a density operator is non-negative and has trace one.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary is an invertible linear norm-preserving endomorphism.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: a finite-dimensional isometry satisfies and is normal.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a normal endomorphism of a finite-dimensional complex-inner-product space has an orthonormal eigenbasis.
, , and : for real , and .
, and exactly when : exactly when .
Real and complex inner-product spaces and their induced length: the root pairing is linear in its first argument and conjugate-linear in its second.
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in an orthonormal basis.
Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.
The adjoint is characterised by : is characterized by .
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear endomorphism of has a unique adjoint.
, and the complex exponential extends the real exponential: for complex .
Proof
By [F1] and [F2], satisfies , hence is normal. The complex spectral theorem [F3] gives an orthonormal eigenbasis; since is nonzero, choose one unit eigenvector and write . Norm preservation and [F6], [F7] give , so . This chooses one vector from a finite nonempty basis and uses no choice axiom.
Choose an ordered orthonormal basis of using [L8]. Together with the control basis from [L5], it supplies the factor bases required by [L3], whose proof shows the pairing is independent of this choice. Put on the control and on the joint register. By the Statement, . Using [L3] and [L5], direct inner-product calculations give and ; also and , so these vectors form an orthonormal basis. Every is a finite sum of elementary tensors; expanding each control factor in this basis and grouping terms writes . The product pairing [L3] makes these two summands orthogonal, and the tensor-map definition [L4] gives and . Hence and . Applying the same decomposition to gives ; the adjoint characterization [F10] and finite-dimensional existence/uniqueness [F11] imply each effect is self-adjoint. By [F9], each effect is non-negative; together with the two-element outcome set and , this is a finite POVM by [L2].
Set . By [L5], [F6], and [F7], its squared norm is ; the cross terms vanish by orthogonality. Since is unit, the product pairing [L3] makes unit. The controlled block rule [L1] gives .
Put . By [F4], . For every , [F6] and [F7] give ; since and is invertible, is invertible, so it is unitary by [F1]. For , [L5], [F6], [F7] and step 1.1 give . The separately granted controlled block gives . Its control factor has squared norm by [F4], [F6], and [F7]. No access to this block is inferred from a call to ; it is part of the explicit model assumption in the Given.
Let be either output in steps 2.1–2.2. Both factors are unit vectors, so the product norm [L3] makes ; [L6] makes a density operator by [L11]. Choose a finite orthonormal basis of by [L8]. From [L7] and [F8], , where self-adjointness from step 1.2 gives the middle equality and Parseval [L9] gives the last equality. By the product pairing [L3] and tensor-map action [L4], . The finite weights normalize by [L10], so this trace value is the probability of the plus outcome.
For the output in step 2.1, , so . For the output in step 2.2, . Put . By [F12], and ; [F4] gives and , so and . Hence and .
By [F5], means . Since , : equality would force and then , hence . Thus the probability from step 4.1 is strictly below one, while the other is one; the two outcome laws differ.
If , [F5] gives , so the two controlled block maps are identical by [L1]. The operators therefore produce the same state for every common input and hence the same outcome law for the specified POVM.
CNOT and Control-Target Order
Definition
In the ordered two-qubit basis , the controlled-NOT with first wire control and second wire target is
Equivalently, it is the control block of Controlled Unitary Access, where is the Pauli bit-flip matrix. The wire order is part of the definition.
Facts & Assumptions
Given: The two ordered qubit factors, their computational basis, and .
Controlled Unitary Access defines to fix the control-zero block and apply in the control-one block. Its carrier is present in this batch.
The Pauli matrices defines the exact Pauli- matrix in the ordered computational basis. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.
The computational basis is orthonormal: each qubit computational basis is orthonormal.
The product basis is orthonormal and tensor dimensions multiply: elementary tensors of ordered orthonormal factor bases form an orthonormal basis of the ordered tensor register.
Exact one-qubit gates and rotations verifies that the Pauli- matrix is unitary; this result is in the dependency closure of [L1].
Verification
By [L5], is unitary, so [L1] defines its controlled block. For control bit , the first block of is the identity, so and .
For control bit , [L2] flips the target, so and . These are exactly for the two remaining basis inputs.
The columns in the stated ordered basis are therefore , giving . By [L3] and [L4], this is a permutation of an orthonormal basis, so it preserves the sum of squared coordinate moduli and thus every vector norm. The permutation is its own inverse, so the operator is invertible and hence unitary. The displayed action fixes the stated control-target order.
Multi-Control Activation Pattern
Definition
Let , let the ordered control register be with computational basis indexed by , and let be a finite-dimensional target register disjoint from the controls. Let be unitary, and let be the activation string. Define the multi-controlled operation by
Extend this rule linearly. The all-one control is . For negative controls in , let and let be the tensor product of Pauli on controls in and identity on the other controls. Then
with the rightmost applied first and the leftmost restoring the original control string. The matrix definition does not itself grant an implementation or assign a cost to the operation.
Facts & Assumptions
Given: The ordered control basis, , a finite-dimensional target register , an activation string , and a unitary .
Controlled Unitary Access fixes the positive-control block convention and treats controlled access as an explicit model capability. Its carrier is present in this batch.
The Pauli matrices defines the exact Pauli- matrix. Its current draft definition body was read; the QC07 page carrier exists but remains draft.
Tensor products of finitely many linear maps defines the tensor map on elementary tensors and its linear extension. Its current draft proof was read and supplies the simultaneous control-flip/target-identity map.
Ordered tensor registers, their inner product, and wire permutations defines the ordered tensor register, computational product basis, and product pairing. Its current draft proof was read.
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary endomorphism is an invertible linear norm-preserving map.
Verification
By [L4], the vectors over the computational control basis span the joint register. The cases in the Definition therefore determine a unique linear operator and give the activation behavior on every superposition.
Let have exactly when . By [L2] and [L4], sends to . The middle positive-control block activates exactly when , which coordinatewise is equivalent to . The leftmost restores the original control string because . Thus the conjugated operation has exactly the defining action of , including and .
Write any joint vector uniquely as using the ordered product basis in [L4]. The Definition maps each block to , where and otherwise. Each is an invertible isometry by [F1], so orthogonality of the control basis and the product pairing give . The block map with and other blocks identity is a two-sided inverse. Hence is an invertible isometry, therefore unitary by [F1].
Controlled-Z and SWAP
Definition
In the ordered two-qubit basis , define
Define the SWAP operator on the ordered tensor product by for , and extend this rule linearly from the ordered product basis. SWAP is an operator that permutes the register state; it does not relabel the ordered wires.
Facts & Assumptions
Given: The ordered two-qubit computational basis and the definitions of and the tensor product register.
Controlled Phase Rotation defines in control-first order. Its carrier is present in this batch.
Ordered tensor registers, their inner product, and wire permutations defines the ordered factors and product basis. Its current draft proof was read.
The computational basis is orthonormal proves the computational basis is orthonormal. Its current draft proof was read, including the one-dimensional zero-qubit boundary case.
, , and : .
Verification
Substituting into [L1] gives by [F1].
SWAP fixes and and interchanges with . The ordered product basis in [L2] spans the tensor product, so these actions determine a unique linear map. By [L2] and [L3] it permutes an orthonormal basis, hence preserves norms and is its own inverse; therefore it is unitary.
The preceding action changes the state vector in the fixed ordered tensor product, while the first and second factors remain the declared wires. Thus the definition is an actual linear gate action, not a change of names for the tensor factors.
Hadamard Followed by CNOT Creates Bell Entanglement from |00>
Statement
On two qubit registers with the first wire as control,
The output is an entangled pure state across the first/second-qubit cut.
Facts & Assumptions
Given: The ordered qubit basis, the exact Hadamard matrix, and the CNOT and pure-state entanglement definitions.
CNOT and Control-Target Order gives with the first factor controlling. Its carrier is present in this batch.
Pure-State Entanglement Across a Tensor Cut defines entanglement as not being a product ray. Its carrier is present in this batch.
Exact one-qubit gates and rotations defines the exact Hadamard matrix. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.
Ordered tensor registers, their inner product, and wire permutations defines the ordered product basis and product pairing. Its current draft proof was read.
The computational basis is orthonormal proves the computational basis is orthonormal. Its current draft proof was read.
Proof
The first column of the Hadamard matrix in [L3] gives . Thus before CNOT the state is in the product order of [L4] and [L5].
By [L1], CNOT fixes and sends to . Linearity therefore gives the output in the Statement.
In the ordered product basis, the coefficient matrix of the output is , whose determinant is and whose rank is two. If a nonzero product vector is , its coefficient in row , column is , so its coefficient matrix is . Since , at least one column is nonzero and every column is a scalar multiple of ; its rank is exactly one. A nonzero scalar multiple of a product vector has the same rank-one property, so the output ray is not a product ray. By [L2] it is entangled.
Orthogonal-Projector Reflection and Access Contract
Definition
Let be a finite-dimensional complex-inner-product space and let be an orthogonal projection on . Fix the two signs
Thus acts as on and on ; reverses those signs. They are not interchangeable inside a controlled block. For a unit vector , the rank-one reflection is with the Dirac convention of Dirac Notation Conversion.
An access model counts a direct reflection as one primitive call only when that call is explicitly declared. Controlled reflection access is a separate declaration. If is a specified unit input in the same space , the state is prepared as for a declared unitary , and a reflection is implemented by conjugating , the construction is and its cost must include the calls to , , and . A state vector or matrix description alone implies neither an efficient reflection nor inverse access.
Remarks
The root theorem An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint identifies an orthogonal projection as a self-adjoint idempotent. Projector Reflections Are Hermitian Unitary Involutions ↗ proves the algebraic identities for both signs; Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control ↗ proves ray invariance and the controlled sign relation. Their actual proof inputs remain subject to cross-pair supplier reconciliation.
Projector Reflections Are Hermitian Unitary Involutions
Statement
Let be a finite-dimensional complex-inner-product space and let be an orthogonal projection. The operators and are self-adjoint unitary involutions, with . On they act as and , respectively; on they act as and . In control-first order,
Facts & Assumptions
Given: The finite-dimensional complex-inner-product space and orthogonal projection in the Statement.
Orthogonal-Projector Reflection and Access Contract fixes and , and requires explicit control access. Its carrier is present in this batch.
Controlled Unitary Access defines the control-first block operator . Its carrier is present in this batch.
The Pauli matrices defines the exact control- matrix. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.
An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint: an orthogonal projection satisfies and , and its range is orthogonal to its kernel.
The adjoint is characterised by defines the adjoint by .
Adjoints satisfy , , , and : adjoints are conjugate-linear in scalars, preserve sums, and reverse products.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: for an endomorphism of a finite-dimensional inner-product space, implies that is an invertible isometry and .
Proof
By [F1], and . The adjoint rules [F2] and [F3] give and .
Expanding with gives and , and the definitions give . Hence , so both are unitary by [F4].
If , then , so and . If , then , so and . Every splits as with the first term in the range and the second in the kernel; [F1] says these subspaces are orthogonal.
By [L2], . In the declared control-first order, , so .
Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control
Statement
Let be a finite-dimensional complex-inner-product space and let be a unit vector. Then is a rank-one orthogonal projection, and for every . Therefore and are well-defined on the ray. Standalone they differ by the global scalar ; when controlled in control-first order,
Let be the control qubit with ordered basis , and set . For input , produces and produces , so the control sign is relative rather than a target-wide global phase. If is a specified unit input denoted in an access model, is unitary, and , define and as in Orthogonal-Projector Reflection and Access Contract. Then and . This conjugation uses the separately supplied inverse call ; the equality itself grants no such access.
Facts & Assumptions
Given: A unit vector in a finite-dimensional complex-inner-product space, with the root pairing linear in its first argument.
Dirac Notation Conversion defines . Its current draft definition body was read.
Pure state and ray defines rays under nonzero scalar multiplication. Its current draft definition body was read; this theorem proves the projector phase identity directly, without relying on that item's separate projector-well-definedness result.
Orthogonal-Projector Reflection and Access Contract fixes , , and the explicit direct, controlled, and access conventions. Its carrier is present in this batch.
Projector Reflections Are Hermitian Unitary Involutions proves the projector identities and controlled-sign relation. Its carrier is present in this batch; QC07's page and items are now present as draft manifest entries, but not independently accepted.
Inverse Unitary Access makes availability and charge of the inverse call a separate access-model declaration. Its current draft definition and proof were read.
The computational basis is orthonormal proves the control basis is orthonormal.
Ordered tensor registers, their inner product, and wire permutations defines the product pairing after ordered orthonormal bases are specified for the factors and proves the pairing is independent of those choices.
Real and complex inner-product spaces and their induced length: is linear in the first argument and conjugate-linear in the second.
The adjoint is characterised by : is characterized by .
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique adjoint.
An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint: a self-adjoint idempotent is the orthogonal projection onto its range.
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent: a finite-dimensional isometry is unitary and its adjoint is its inverse.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis; this supplier occurs in the dependency closure of [F6].
Proof
By [L1], . Then . Also by [F1] and [F2]; uniqueness [F3] gives . Its image is contained in and , hence its range is exactly one-dimensional.
The self-adjoint idempotent result [F4] makes an orthogonal projection. For , [L1] and [F1] give for every .
If is any other unit representative of the ray of , [L2] gives for some nonzero scalar . By [F1] and [F5], , so . Step 2.1 then gives , and both reflection signs depend only on the ray.
Applying [L4] to gives both standalone reflections as unitary involutions and . Since , their standalone outputs differ only by the scalar and represent the same ray.
Choose an ordered orthonormal basis of using [F7]. Together with the control basis from [L6], it supplies the factor bases required by [L7], whose proof shows the pairing is independent of this choice. Because , [L4] gives and . The controlled input therefore becomes under and under . Since , [L6] gives and . By [L7], the two joint outputs are unit and orthogonal. Orthogonal nonzero vectors are not nonzero scalar multiples, so the ray definition [L2] makes the output rays distinct and the control sign relative.
Let be unitary and let for the specified unit input . For any , [L1] gives . The adjoint identity [F2] with , followed by conjugate symmetry [F1], gives . Thus as operators. By [F6], , so conjugating and gives and , respectively. The algebraic equality does not grant the calls: [L5] requires inverse availability and its cost to be stated separately.
5 · Examples, counterexamples and false statements
None yet.