Alphabeta Math
Pipeline-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.

Controlled Gates, Phase, and Entanglement

1 · Prerequisites

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

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

A unit-vector outer product is a density operator

Statement

Let H be a nonzero finite-dimensional complex inner-product space with the root pairing linear in its first argument, and let u∈H satisfy ∥u∥=1. Define Pu:=∣u⟩⟨u∣ by the root-linear-first Dirac convention. Then Pu is self-adjoint and idempotent, has one-dimensional range, is non-negative, and has trace one. In particular, Pu is a density operator.

Facts & Assumptions

Given: The finite-dimensional complex inner-product space H and a unit vector u∈H.

[F1]

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.

[F3]

Dirac Notation Conversion: Puz=⟨z,u⟩rootu for every z∈H.

[F4]
[F5]
[F6]

Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form on every vector.

[F7]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of the diagonal entries in any basis.

[F8]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F9]

Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis: for an orthonormal basis (ej), ∑j∣⟨v,ej⟩∣2=∥v∥2.

[L1]

Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.

Proof

1.1givenF2F3algebra

For every z∈H, [F2] and [F3] give Pu2z=⟨z,u⟩⟨u,u⟩u=⟨z,u⟩u=Puz, since ⟨u,u⟩=∥u∥2=1. Thus Pu is idempotent.

1.2givenF1F3F4F5algebra

For all z,w∈H, [F1] and [F3] give ⟨Puz,w⟩=⟨z,u⟩⟨u,w⟩=⟨z,⟨w,u⟩u⟩=⟨z,Puw⟩. The outer product is linear by [F3], so [F4] and [F5] imply Pu∗=Pu.

2.1givenF1F2F3F6step 1.2algebra

The image of Pu lies in Cu, and [F2] and [F3] give Puu=⟨u,u⟩u=u, so its range is exactly the one-dimensional span of u. Also [F1] and [F3] give ⟨Puz,z⟩=⟨z,u⟩⟨u,z⟩=∣⟨z,u⟩∣2≥0. With self-adjointness from step 1.2, [F6] makes Pu non-negative.

3.1givenF2F3F7F8F9L1step 2.1choosealgebra∎

Choose an orthonormal basis (ej)j<n of H using [F8]. By [F3] and [F7], tr⁡(Pu)=∑j<n⟨Puej,ej⟩=∑j<n∣⟨ej,u⟩∣2=∥u∥2=1, where [F9] gives the Parseval equality. Thus [L1] makes Pu a density operator, using non-negativity from step 2.1. The basis is finite, so no choice axiom is used.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Pure-State Entanglement Across a Tensor Cut

Definition

Let HA,HB be nonzero finite-dimensional complex inner-product spaces, with the ordered tensor product HA⊗HB. A product ray is a ray containing a nonzero decomposable vector a⊗b with a∈HA and b∈HB. A pure state on this cut is entangled when its ray is not a product ray.

For a nonzero vector ψ∈HA⊗HB, 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 HA,HB, their product inner product and ordered tensor convention, and a unit vector ψ∈HA⊗HB.

[L1]

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.

[L2]

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.

[L3]

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.

[F1]
[F2]

The rank of a matrix equals the rank of the linear map x↦Ax: a matrix has the same rank as its associated coordinate linear map.

[F3]

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.

[F4]

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.

[F5]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

Verification

1.1givenL1L2F1F2F5choosealgebra

Choose ordered orthonormal bases of HA,HB using [F5], and let C be the coefficient matrix of ψ in their product basis [L2]. For any other ordered orthonormal bases, let A,B have the new basis vectors as columns in the old coordinates. Their columns are orthonormal, so the finite row-by-column identities A∗A=B∗B=I 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 cpq′=∑i,kAip‾cikBkq‾, so the new coefficient matrix is C′=A∗CB‾. The factors A∗ and B‾ are invertible, so the map represented by C′=A∗CB‾ is A∗∘TC∘B‾, where TC is the map represented by C. Since B‾ is onto, its image is A∗(im⁡TC); since A∗ is injective, this image has the same dimension as im⁡TC. By [F2], the matrix rank is therefore unchanged, so it is basis-independent. Multiplying ψ by any nonzero scalar multiplies C by that scalar and also preserves its rank.

1.2givenL2L3F2F3F4algebra

In any Schmidt decomposition ψ=∑j=1rsjuj⊗vj with all sj>0 and orthonormal factor families, tensor coordinates multiply, so its coefficient matrix is C=UDVT, where the columns of U,V are the coordinates of the uj,vj and D=diag⁡(s1,…,sr). The orthonormal columns give U∗U=V∗V=Ir, so U is injective; conjugating V∗V=Ir gives VTV‾=Ir, so VT is surjective; and D is invertible. Thus rank⁡(C)=r. 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 C. Therefore the number of terms is the same for every Schmidt decomposition and equals the defined Schmidt rank.

2.1givenL1L2F1F2step 1.1step 1.2choosealgebra

If ψ=c(a⊗b) for nonzero a,b,c, its coefficient matrix is cαβT for the coordinate columns α,β, so its rank is one. Conversely, if C has rank one, choose a nonzero column α; every column is a scalar multiple βkα, so C=αβT with β≠0. The coefficient expansion then gives ψ=a⊗b for the vectors with coordinates α,β. Thus the ray is a product ray exactly when the Schmidt rank is one.

3.1givenL1step 2.1algebra∎

Since ψ≠0, 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.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged

Statement

Let H be a nonzero finite-dimensional complex inner-product space with the root pairing linear in the first argument. For nonzero x∈H, put u=x/∥x∥. If λ∈C has ∣λ∣=1, then u and λu determine the same rank-one density operator. Consequently, for every finite POVM (Ea)a∈Ω on H, each defined outcome probability satisfies

tr⁡(∣u⟩⟨u∣Ea)=tr⁡(∣λu⟩⟨λu∣Ea).

The unnormalized vector x itself gives tr⁡(∣x⟩⟨x∣)=∥x∥2 and is not a density operator when ∥x∥≠1.

Facts & Assumptions

Given: The finite-dimensional space and nonzero x in the Statement, a scalar λ with ∣λ∣=1, and a finite POVM (Ea)a∈Ω.

[F1]

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.

[F3]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: endomorphism trace is the matrix trace in any chosen basis.

[L1]

Density operator: a density operator is a non-negative endomorphism of trace one on a nonzero finite-dimensional space.

[L2]

Finite POVMs and their outcome law defines a finite POVM and the outcome weight pa=tr⁡(ρEa) for a density operator. Its current draft definition body was read.

[L3]

Dirac Notation Conversion defines ∣v⟩⟨w∣z=⟨z,w⟩rootv. Its current draft definition body was read.

[L4]

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.

[L5]

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

1.1givenF1F2algebra

Positive definiteness gives ∥x∥>0, so u is defined. By [F1] and [F2], ∥u∥2=⟨x/∥x∥,x/∥x∥⟩=⟨x,x⟩/∥x∥2=1. Again using linearity in the first argument and conjugate-linearity in the second, ∥λu∥2=⟨λu,λu⟩=∣λ∣2⟨u,u⟩=1. Taking nonnegative square roots gives both norms equal to one.

1.2givenF1L3algebra

For every z∈H, the root-first conversion [L3] gives ∣λu⟩⟨λu∣z=⟨z,λu⟩rootλu=λ‾λ⟨z,u⟩rootu=∣u⟩⟨u∣z. Hence the two rank-one operators are equal.

2.1step 1.2L1L2L4L5algebra

By [L4], the common operator is a density operator, so the outcome law [L2] defines its weight for each effect Ea. Since the density operator is identical for u and λu, those weights agree; [L5] proves the finite family of weights is a probability distribution.

3.1givenF1F3L1L3L4algebra∎

Since x=∥x∥u with ∥x∥ a nonnegative real, [F1] and [L3] give ∣x⟩⟨x∣=∥x∥2∣u⟩⟨u∣. In any basis, its matrix is therefore ∥x∥2 times the matrix of ∣u⟩⟨u∣; summing the diagonal entries in that basis as in [F3] gives tr⁡(∣x⟩⟨x∣)=∥x∥2tr⁡(∣u⟩⟨u∣)=∥x∥2 by [L4]. If ∥x∥≠1, it is not trace one and hence is not a density operator by [L1].

DefinitionDefinition: AI-adaptedProof: AI-generatedOpen item page →

Controlled Unitary Access

Definition

Let C=C2 be a control qubit with ordered orthonormal basis ∣0⟩,∣1⟩, let H be a finite-dimensional complex inner-product space, and let U:H→H be unitary. On the control-first register C⊗H, define

C(U):=(IH00U).

Thus C(U)(∣0⟩⊗v)=∣0⟩⊗v and C(U)(∣1⟩⊗v)=∣1⟩⊗Uv. Controlled access means that the chosen operation model explicitly grants a call to this block operator. An ordinary call to a black-box U 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 H, the ordered control-first tensor product, and a unitary U on H.

[L1]

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.

[L2]

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.

[F1]

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.

[F2]

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

1.1givenL1L2F2choose

Choose an ordered orthonormal basis of H 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 C⊗H as ∣0⟩⊗v0+∣1⟩⊗v1. The orthonormal control basis and the product inner product from [L1] give squared norm ∥v0∥2+∥v1∥2.

2.1step 1.1F1algebra

The block operator sends that vector to ∣0⟩⊗v0+∣1⟩⊗Uv1. By [F1], ∥Uv1∥=∥v1∥, so the squared norm is unchanged.

3.1givenF1algebra∎

The block matrix diag⁡(IH,U−1) is a two-sided inverse for C(U), so C(U) is invertible as well as norm-preserving. By the unitary definition in [F1], C(U) is unitary.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Relative Phase

Definition

Fix an ordered orthonormal pair e0,e1 in a finite-dimensional complex inner-product space. If a vector has nonzero coordinates α,β on this pair, its relative phase on these coordinates is

η:=β/α∣β/α∣∈C,∣η∣=1.

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 ψη=(e0+ηe1)/2, distinct values of η give distinct rank-one projectors and distinct rays.

Facts & Assumptions

Given: The ordered orthonormal pair and nonzero coordinates α,β in the Definition.

[F1]

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.

[L1]

Pure state and ray defines a pure state as a ray under nonzero common scalar multiplication. Its current draft definition body was read.

[L2]

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.

[L3]

Dirac Notation Conversion defines ∣x⟩⟨y∣z=⟨z,y⟩rootx and the Dirac pairing. Its current draft definition body was read; the separate coordinate-matrix identity is assigned to its linked QC01 theorem.

[L4]

Dirac Notation Coordinate Identity proves that the coordinate matrix of ∣x⟩⟨y∣ is [x][y]† in the stated orthonormal bases. Its current draft proof was read.

Verification

1.1givenL1algebra

For any nonzero scalar c, the ratio of the two coordinates of cψ is (cβ)/(cα)=β/α. Its unit-modulus part is therefore also unchanged, so the Definition assigns a property of the ray.

1.2givenF1L2L3L4algebra

Since ∣η∣=1 and e0,e1 are orthonormal, ψη has norm one. In the qubit instance [L2] identifies this ordered pair with ∣0⟩,∣1⟩. By [L3] and [L4], its rank-one projector has matrix 12(1η‾η1) in the ordered pair.

2.1step 1.2L1algebra∎

If η≠η′, the lower-left entries of these two projector matrices differ, so the projectors differ. Also, if ψη′=cψη for a nonzero scalar c, comparison of the e0 coordinate forces c=1 and comparison of the e1 coordinate forces η′=η, a contradiction. Hence changing the relative phase can change the ray.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Inverse Unitary Access

Definition

For a finite-dimensional unitary U, inverse access is the explicitly granted operation U†=U−1. 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 k≥0 that applies U1 first and Uk last, the total operator is W=Uk⋯U1 when k>0 and W=IH when k=0. For k>0, the inverse sequence applies Uk† first, then Uk−1†, down to U1†; for k=0 it is the empty sequence.

Facts & Assumptions

Given: Finite-dimensional unitaries U1,…,Uk and an explicit access model for the operations named in the Definition.

[L1]

Controlled Unitary Access fixes the target unitary whose forward and controlled capabilities are explicitly declared. Its carrier is present in this batch.

[F1]

For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent: for a finite-dimensional endomorphism, preserving norms implies U∗U=UU∗=I and U−1=U∗.

[F3]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: the adjoint is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩.

Verification

1.1givenL1F1F3

Each Uj 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.

1.2givenF2algebra

For k>0, repeated application of [F2] gives (Uk⋯U1)∗=U1∗⋯Uk∗. Acting on a vector from right to left, this applies Uk∗ first and U1∗ last, exactly reversing the original chronology.

1.3givenalgebra

For k=0, the specified total map is IH and its inverse is also IH; there are no calls or operations in either sequence. This covers the empty-sequence endpoint without interpreting an undefined product.

2.1L1step 1.2∎

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.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Controlled Phase Rotation

Definition

For a real angle θ, define the one-qubit phase matrix Pθ=diag⁡(1,eiθ). In control-first order define

CP(θ):=C(Pθ)=diag⁡(1,1,1,eiθ)

in the ordered basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩. 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.

[L1]

Controlled Unitary Access defines the control-first block action C(U)=diag⁡(I,U). Its carrier is present in this batch.

[L2]

Exact one-qubit gates and rotations defines the exact Rz(θ) 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.

[L3]

Pauli formula for an axis rotation proves Rz(θ)=diag⁡(e−iθ/2,eiθ/2) 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.

[L4]

The computational basis is orthonormal proves the ordered computational basis of Q2 is orthonormal; this supplier is in the dependency closure through [L3].

Verification

1.1givenL1L2L4F1algebra

The target computational basis is orthonormal by [L4], and [F1] gives modulus one for both diagonal entries of Pθ. Thus Pθ is an invertible isometry and hence unitary, so [L1] applies to its controlled block. The first control block applies the identity, so ∣00⟩ and ∣01⟩ are fixed. In the second block, Pθ fixes ∣10⟩ and sends ∣11⟩ to eiθ∣11⟩. These four actions give the diagonal matrix in the Definition.

2.1step 1.1F1algebra

Every diagonal entry of CP(θ) has modulus one by [F1]; its conjugate transpose is therefore its inverse, so it is unitary.

3.1L1L3F2algebra∎

By [L3], Rz(θ)=diag⁡(e−iθ/2,eiθ/2). By [F2], multiplying it by eiθ/2 gives Pθ=diag⁡(1,eiθ). Therefore CP(θ)=diag⁡(I,eiθ/2Rz(θ)), which is the block phase diag⁡(I,eiθ/2I) applied after C(Rz(θ)). Dropping that control phase would change the defined operation.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

A Controlled Global Phase Becomes a Relative Control Phase

Statement

Let H be a nonzero finite-dimensional complex-inner-product space and U:H→H a unitary. Let θ∈R, and suppose the model separately grants controlled access to both U and eiθU. There is a normalized eigenvector ϕ with Uϕ=μϕ and ∣μ∣=1. Let C=Q2=C2 be the control qubit with ordered computational basis ∣0⟩,∣1⟩; define ∣±⟩=(∣0⟩±∣1⟩)/2 and prepare (∣0⟩+μ‾∣1⟩)/2 with target ϕ. The two joint effects are E±=∣±⟩⟨±∣⊗IH. The E+ outcome has probability 1 after C(U) and cos⁡2(θ/2) after C(eiθU). Thus the two controlled maps give different outcome laws exactly when θ∉2πZ; when θ∈2πZ, 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 H, a unitary U, a real θ, separate controlled access to U and eiθU, and the finite control-state measurement specified in the Statement.

[L1]

Controlled Unitary Access defines C(U) as the control-first block map diag⁡(IH,U) and treats the capability as explicit. Its carrier is present in this batch.

[L2]

Finite POVMs and their outcome law defines a finite POVM and the density-operator weight pa=tr⁡(ρEa). Its current draft definition body was read.

[L3]

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.

[L4]

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.

[L5]

The computational basis is orthonormal proves the control basis ∣0⟩,∣1⟩ is orthonormal. Its current draft proof was read.

[L6]

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.

[L7]

Dirac Notation Conversion defines ∣v⟩⟨w∣z=⟨z,w⟩rootv in the root linear-first convention.

[L8]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[L10]

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.

[L11]

Density operator: a density operator is non-negative and has trace one.

[F1]

Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary is an invertible linear norm-preserving endomorphism.

[F3]

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.

[F4]
[F6]

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.

[F8]

The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is the sum of diagonal entries in an orthonormal basis.

[F9]

Non-negative and positive operators: non-negative means self-adjoint with nonnegative quadratic form.

[F10]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: T∗ is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩.

[F11]
[F12]

Proof

1.1givenF1F2F3F6F7choosealgebra

By [F1] and [F2], U satisfies UU∗=U∗U=I, hence is normal. The complex spectral theorem [F3] gives an orthonormal eigenbasis; since H is nonzero, choose one unit eigenvector ϕ and write Uϕ=μϕ. Norm preservation and [F6], [F7] give 1=∥Uϕ∥=∣μ∣∥ϕ∥=∣μ∣, so ∣μ∣=1. This chooses one vector from a finite nonempty basis and uses no choice axiom.

1.2L2L3L4L5L8F9F10F11choosealgebra

Choose an ordered orthonormal basis of H 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 P±=∣±⟩⟨±∣ on the control and E±=P±⊗IH on the joint register. By the Statement, ∣±⟩=(∣0⟩±∣1⟩)/2. Using [L3] and [L5], direct inner-product calculations give ⟨+,+⟩=⟨−,−⟩=1 and ⟨+,−⟩=0; also ∣0⟩=(∣+⟩+∣−⟩)/2 and ∣1⟩=(∣+⟩−∣−⟩)/2, so these vectors form an orthonormal basis. Every v∈C⊗H is a finite sum of elementary tensors; expanding each control factor in this basis and grouping terms writes v=∣+⟩⊗h++∣−⟩⊗h−. The product pairing [L3] makes these two summands orthogonal, and the tensor-map definition [L4] gives E+v=∣+⟩⊗h+ and E−v=∣−⟩⊗h−. Hence E++E−=I and ⟨E±v,v⟩=∥h±∥2≥0. Applying the same decomposition to v,w gives ⟨E±v,w⟩=⟨v,E±w⟩; 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 E++E−=I, this is a finite POVM by [L2].

2.1givenL1L3L5F6F7step 1.1algebra

Set cμ=(∣0⟩+μ‾∣1⟩)/2. By [L5], [F6], and [F7], its squared norm is 12(⟨0,0⟩+∣μ∣2⟨1,1⟩)=1; the cross terms vanish by orthogonality. Since ϕ is unit, the product pairing [L3] makes cμ⊗ϕ unit. The controlled block rule [L1] gives C(U)(cμ⊗ϕ)=∣0⟩⊗ϕ+μ‾∣1⟩⊗Uϕ2=∣+⟩⊗ϕ.

2.2givenL1L5F1F4F6F7step 1.1algebra

Put α=eiθ. By [F4], ∣α∣=1. For every v∈H, [F6] and [F7] give ∥αUv∥2=∣α∣2∥Uv∥2=∥v∥2; since α≠0 and U is invertible, αU is invertible, so it is unitary by [F1]. For cμ=(∣0⟩+μ‾∣1⟩)/2, [L5], [F6], [F7] and step 1.1 give ∥cμ∥2=1. The separately granted controlled block gives C(eiθU)(cμ⊗ϕ)=∣0⟩+eiθ∣1⟩2⊗ϕ. Its control factor has squared norm 12(1+∣eiθ∣2)=1 by [F4], [F6], and [F7]. No access to this block is inferred from a call to C(U); it is part of the explicit model assumption in the Given.

3.1L2L3L4L6L7L8L9L10L11F8step 1.2step 2.1step 2.2choosealgebra

Let ω=χ⊗ϕ be either output in steps 2.1–2.2. Both factors are unit vectors, so the product norm [L3] makes ∥ω∥=1; [L6] makes ρω=∣ω⟩⟨ω∣ a density operator by [L11]. Choose a finite orthonormal basis (ej) of C⊗H by [L8]. From [L7] and [F8], tr⁡(ρωE+)=∑j⟨E+ej,ω⟩⟨ω,ej⟩=∑j⟨ej,E+ω⟩⟨ω,ej⟩=⟨ω,E+ω⟩, 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], ⟨ω,E+ω⟩=⟨χ,P+χ⟩⟨ϕ,ϕ⟩=∣⟨χ,+⟩root∣2. The finite weights normalize by [L10], so this trace value is the probability of the plus outcome.

4.1step 2.1step 2.2step 3.1F12F4algebra

For the output in step 2.1, χ=∣+⟩, so p+=1. For the output in step 2.2, χ=(∣0⟩+eiθ∣1⟩)/2. Put z=eiθ/2. By [F12], z2=eiθ and z−1=e−iθ/2; [F4] gives ∣z∣=1 and z=cos⁡(θ/2)+isin⁡(θ/2), so z−1=z‾ and z+z−1=2cos⁡(θ/2). Hence 1+eiθ=z(z+z−1)=2zcos⁡(θ/2) and p+=∣1+eiθ∣2/4=cos⁡2(θ/2).

5.1step 4.1F4F5algebra

By [F5], θ∉2πZ means z=eiθ≠1. Since ∣z∣=1, ∣1+z∣2=2+2Re⁡z<4: equality would force Re⁡z=1 and then Im⁡z=0, hence z=1. Thus the probability from step 4.1 is strictly below one, while the other is one; the two outcome laws differ.

6.1givenL1F5algebra∎

If θ∈2πZ, [F5] gives eiθ=1, 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.

DefinitionDefinition: AI-adaptedProof: AI-generatedOpen item page →

CNOT and Control-Target Order

Definition

In the ordered two-qubit basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩, the controlled-NOT with first wire control and second wire target is

CNOT⁡1→2∣a,t⟩=∣a,t⊕a⟩,a,t∈{0,1}.

Equivalently, it is the control block C(X)=diag⁡(I,X) of Controlled Unitary Access, where X 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 a,t∈{0,1}.

[L1]

Controlled Unitary Access defines C(X) to fix the control-zero block and apply X in the control-one block. Its carrier is present in this batch.

[L2]

The Pauli matrices defines the exact Pauli-X 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.

[L3]

The computational basis is orthonormal: each qubit computational basis is orthonormal.

[L4]

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.

[L5]

Exact one-qubit gates and rotations verifies that the Pauli-X matrix is unitary; this result is in the dependency closure of [L1].

Verification

1.1givenL1L2L5

By [L5], X is unitary, so [L1] defines its controlled block. For control bit a=0, the first block of C(X) is the identity, so ∣0,0⟩↦∣0,0⟩ and ∣0,1⟩↦∣0,1⟩.

1.2givenL1L2algebra

For control bit a=1, [L2] flips the target, so ∣1,0⟩↦∣1,1⟩ and ∣1,1⟩↦∣1,0⟩. These are exactly ∣a,t⊕a⟩ for the two remaining basis inputs.

2.1step 1.1step 1.2L3L4algebra∎

The columns in the stated ordered basis are therefore e00,e01,e11,e10, giving CNOT⁡=(1000010000010010). 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.

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Multi-Control Activation Pattern

Definition

Let m≥1, let the ordered control register be Q2⊗m with computational basis ∣x⟩ indexed by x=(x1,…,xm)∈{0,1}m, and let T be a finite-dimensional target register disjoint from the controls. Let U:T→T be unitary, and let s=(s1,…,sm)∈{0,1}m be the activation string. Define the multi-controlled operation by

Cs(U)(∣x⟩⊗v)={∣s⟩⊗Uv,x=s,∣x⟩⊗v,x≠s.

Extend this rule linearly. The all-one control is C1m(U). For negative controls in s, let N={j∈{1,…,m}:sj=0} and let XN be the tensor product of Pauli X on controls in N and identity on the other controls. Then

Cs(U)=(XN⊗IT)C1m(U)(XN⊗IT),

with the rightmost XN applied first and the leftmost XN 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, m≥1, a finite-dimensional target register T, an activation string s∈{0,1}m, and a unitary U:T→T.

[L1]

Controlled Unitary Access fixes the positive-control block convention C(U)=diag⁡(I,U) and treats controlled access as an explicit model capability. Its carrier is present in this batch.

[L2]

The Pauli matrices defines the exact Pauli-X matrix. Its current draft definition body was read; the QC07 page carrier exists but remains draft.

[L3]

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.

[L4]

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.

[F1]

Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a unitary endomorphism is an invertible linear norm-preserving map.

Verification

1.1givenL4construct

By [L4], the vectors ∣x⟩⊗v 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.

2.1givenL1L2L3L4step 1.1algebra

Let n=(n1,…,nm)∈{0,1}m have nj=1 exactly when sj=0. By [L2] and [L4], XN⊗IT sends ∣x⟩⊗v to ∣x⊕n⟩⊗v. The middle positive-control block activates exactly when x⊕n=1m, which coordinatewise is equivalent to x=s. The leftmost XN restores the original control string because n⊕n=0. Thus the conjugated operation has exactly the defining action of Cs(U), including N=∅ and N={1,…,m}.

3.1givenL4F1algebra∎

Write any joint vector uniquely as v=∑x∈{0,1}m∣x⟩⊗vx using the ordered product basis in [L4]. The Definition maps each block to Wxvx, where Ws=U and Wx=IT otherwise. Each Wx is an invertible isometry by [F1], so orthogonality of the control basis and the product pairing give ∥Cs(U)v∥2=∑x∥Wxvx∥2=∑x∥vx∥2=∥v∥2. The block map with Ws=U−1 and other blocks identity is a two-sided inverse. Hence Cs(U) is an invertible isometry, therefore unitary by [F1].

DefinitionDefinition: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Controlled-Z and SWAP

Definition

In the ordered two-qubit basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩, define

CZ:=CP(π)=diag⁡(1,1,1,−1).

Define the SWAP operator on the ordered tensor product by SWAP⁡(∣a⟩⊗∣b⟩)=∣b⟩⊗∣a⟩ for a,b∈{0,1}, 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 CP(θ) and the tensor product register.

[L1]

Controlled Phase Rotation defines CP(θ)=diag⁡(1,1,1,eiθ) in control-first order. Its carrier is present in this batch.

[L2]

Ordered tensor registers, their inner product, and wire permutations defines the ordered factors and product basis. Its current draft proof was read.

[L3]

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.

Verification

1.1givenL1F1algebra

Substituting θ=π into [L1] gives CP(π)=diag⁡(1,1,1,eiπ)=diag⁡(1,1,1,−1) by [F1].

1.2givenL2L3algebra

SWAP fixes ∣00⟩ and ∣11⟩ and interchanges ∣01⟩ with ∣10⟩. 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.

2.1step 1.2∎

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.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Hadamard Followed by CNOT Creates Bell Entanglement from |00>

Statement

On two qubit registers with the first wire as control,

CNOT⁡(∣+⟩⊗∣0⟩)=∣00⟩+∣11⟩2,∣+⟩=∣0⟩+∣1⟩2.

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.

[L1]

CNOT and Control-Target Order gives CNOT⁡∣a,t⟩=∣a,t⊕a⟩ with the first factor controlling. Its carrier is present in this batch.

[L2]

Pure-State Entanglement Across a Tensor Cut defines entanglement as not being a product ray. Its carrier is present in this batch.

[L3]

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.

[L4]

Ordered tensor registers, their inner product, and wire permutations defines the ordered product basis and product pairing. Its current draft proof was read.

[L5]

The computational basis is orthonormal proves the computational basis is orthonormal. Its current draft proof was read.

Proof

1.1givenL3L4L5algebra

The first column of the Hadamard matrix in [L3] gives H∣0⟩=(∣0⟩+∣1⟩)/2=∣+⟩. Thus before CNOT the state is (∣00⟩+∣10⟩)/2 in the product order of [L4] and [L5].

2.1step 1.1L1algebra

By [L1], CNOT fixes ∣00⟩ and sends ∣10⟩ to ∣11⟩. Linearity therefore gives the output (∣00⟩+∣11⟩)/2 in the Statement.

3.1step 2.1L2L4L5algebra∎

In the ordered product basis, the coefficient matrix of the output is 12(1001), whose determinant is 1/2≠0 and whose rank is two. If a nonzero product vector is a⊗b, its coefficient in row i, column j is aibj, so its coefficient matrix is abT. Since a,b≠0, at least one column is nonzero and every column is a scalar multiple of a; 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.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Orthogonal-Projector Reflection and Access Contract

Definition

Let H be a finite-dimensional complex-inner-product space and let Π be an orthogonal projection on H. Fix the two signs

RΠ:=2Π−I,SΠ:=I−2Π=−RΠ.

Thus RΠ acts as +I on ran⁡Π and −I on ker⁡Π; SΠ reverses those signs. They are not interchangeable inside a controlled block. For a unit vector ψ, the rank-one reflection is Rψ=2∣ψ⟩⟨ψ∣−I 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 ∣0⟩ is a specified unit input in the same space H, the state is prepared as ψ=U∣0⟩ for a declared unitary U, and a reflection is implemented by conjugating R0=2∣0⟩⟨0∣−I, the construction is UR0U† and its cost must include the calls to U, R0, and U†. 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.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Projector Reflections Are Hermitian Unitary Involutions

Statement

Let H be a finite-dimensional complex-inner-product space and let Π be an orthogonal projection. The operators RΠ=2Π−I and SΠ=I−2Π are self-adjoint unitary involutions, with RΠ=−SΠ. On ran⁡Π they act as +I and −I, respectively; on ker⁡Π they act as −I and +I. In control-first order,

C(SΠ)=(ZC)C(RΠ),ZC:=diag⁡(IH,−IH)=Z⊗IH.

Facts & Assumptions

Given: The finite-dimensional complex-inner-product space and orthogonal projection in the Statement.

[L1]

Orthogonal-Projector Reflection and Access Contract fixes RΠ=2Π−I and SΠ=I−2Π=−RΠ, and requires explicit control access. Its carrier is present in this batch.

[L2]

Controlled Unitary Access defines the control-first block operator C(U)=diag⁡(IH,U). Its carrier is present in this batch.

[L3]

The Pauli matrices defines the exact control-Z matrix. Its current draft definition body was read; its item is now present in the QC07 manifest and page; the page remains draft.

[F1]

An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint: an orthogonal projection satisfies Π∗=Π and Π2=Π, and its range is orthogonal to its kernel.

[F2]
[F4]

For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T∗T=I are equivalent: for an endomorphism of a finite-dimensional inner-product space, T∗T=I implies that T is an invertible isometry and TT∗=I.

Proof

1.1givenF1F2F3

By [F1], Π∗=Π and Π2=Π. The adjoint rules [F2] and [F3] give RΠ∗=2Π−I=RΠ and SΠ∗=I−2Π=SΠ.

2.1step 1.1F1F4algebra

Expanding with Π2=Π gives RΠ2=4Π2−4Π+I=I and SΠ2=I−4Π+4Π2=I, and the definitions give RΠ=−SΠ. Hence RΠ∗RΠ=SΠ∗SΠ=I, so both are unitary by [F4].

3.1givenF1step 2.1algebra

If x=Πy∈ran⁡Π, then Πx=Π2y=x, so RΠx=x and SΠx=−x. If x∈ker⁡Π, then Πx=0, so RΠx=−x and SΠx=x. Every v splits as Πv+(I−Π)v with the first term in the range and the second in the kernel; [F1] says these subspaces are orthogonal.

4.1L1L2L3step 2.1step 3.1algebra∎

By [L2], C(SΠ)=diag⁡(IH,SΠ)=diag⁡(IH,−RΠ). In the declared control-first order, ZC=diag⁡(IH,−IH), so ZCC(RΠ)=diag⁡(IH,−IH)diag⁡(IH,RΠ)=diag⁡(IH,−RΠ)=C(SΠ).

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control

Statement

Let H be a finite-dimensional complex-inner-product space and let ψ∈H be a unit vector. Then Πψ=∣ψ⟩⟨ψ∣ is a rank-one orthogonal projection, and Πλψ=Πψ for every ∣λ∣=1. Therefore Rψ=2Πψ−I and Sψ=I−2Πψ are well-defined on the ray. Standalone they differ by the global scalar −1; when controlled in control-first order,

C(Sψ)=(ZC)C(Rψ),ZC=diag⁡(I,−I).

Let C=Q2 be the control qubit with ordered basis ∣0⟩,∣1⟩, and set ∣±⟩=(∣0⟩±∣1⟩)/2. For input ∣+⟩⊗ψ, C(Sψ) produces ∣−⟩⊗ψ and C(Rψ) produces ∣+⟩⊗ψ, so the control sign is relative rather than a target-wide global phase. If a∈H is a specified unit input denoted ∣0⟩ in an access model, U:H→H is unitary, and ψ=Ua, define Ra=2∣a⟩⟨a∣−I and Sa=I−2∣a⟩⟨a∣ as in Orthogonal-Projector Reflection and Access Contract. Then URaU†=Rψ and USaU†=Sψ. This conjugation uses the separately supplied inverse call U†; 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.

[L1]

Dirac Notation Conversion defines ∣ψ⟩⟨ψ∣x=⟨x,ψ⟩rootψ. Its current draft definition body was read.

[L2]

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.

[L3]

Orthogonal-Projector Reflection and Access Contract fixes RΠ=2Π−I, SΠ=I−2Π, and the explicit direct, controlled, and UR0U† access conventions. Its carrier is present in this batch.

[L4]

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.

[L5]

Inverse Unitary Access makes availability and charge of the inverse call a separate access-model declaration. Its current draft definition and proof were read.

[L6]

The computational basis is orthonormal proves the control basis ∣0⟩,∣1⟩ is orthonormal.

[L7]

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.

[F1]

Real and complex inner-product spaces and their induced length: ⟨⋅,⋅⟩ is linear in the first argument and conjugate-linear in the second.

[F2]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: T∗ is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩.

[F3]

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.

[F4]

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.

[F7]

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

1.1givenL1F1F2F3algebra

By [L1], Πψx=⟨x,ψ⟩rootψ. Then Πψ2x=⟨x,ψ⟩⟨ψ,ψ⟩ψ=Πψx. Also ⟨Πψx,y⟩=⟨x,ψ⟩⟨ψ,y⟩=⟨x,Πψy⟩ by [F1] and [F2]; uniqueness [F3] gives Πψ∗=Πψ. Its image is contained in Cψ and Πψψ=ψ, hence its range is exactly one-dimensional.

2.1step 1.1L1F1F4algebra

The self-adjoint idempotent result [F4] makes Πψ an orthogonal projection. For ∣λ∣=1, [L1] and [F1] give Πλψx=⟨x,λψ⟩λψ=λ‾λ⟨x,ψ⟩ψ=Πψx for every x.

3.1L2F1F5step 2.1algebra

If v is any other unit representative of the ray of ψ, [L2] gives v=cψ for some nonzero scalar c. By [F1] and [F5], 1=∥v∥2=⟨cψ,cψ⟩=∣c∣2⟨ψ,ψ⟩=∣c∣2, so ∣c∣=1. Step 2.1 then gives Πv=Πψ, and both reflection signs depend only on the ray.

4.1L3L4step 3.1algebra

Applying [L4] to Πψ gives both standalone reflections as unitary involutions and C(Sψ)=(ZC)C(Rψ). Since Sψ=−Rψ, their standalone outputs differ only by the scalar −1 and represent the same ray.

5.1givenL2L4L6L7F7step 1.1step 4.1choosealgebra

Choose an ordered orthonormal basis of H 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 ψ∈ran⁡Πψ, [L4] gives Rψψ=ψ and Sψψ=−ψ. The controlled input ∣+⟩⊗ψ therefore becomes ∣+⟩⊗ψ under C(Rψ) and ∣−⟩⊗ψ under C(Sψ). Since ∣±⟩=(∣0⟩±∣1⟩)/2, [L6] gives ⟨+,−⟩=12(⟨0,0⟩−⟨0,1⟩+⟨1,0⟩−⟨1,1⟩)=0 and ⟨+,+⟩=⟨−,−⟩=1. 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.

6.1givenL1L3L5F1F2F6algebra∎

Let U be unitary and let ψ=Ua for the specified unit input a∈H. For any z∈H, [L1] gives U∣a⟩⟨a∣U†z=U(⟨U†z,a⟩roota)=⟨U†z,a⟩rootψ. The adjoint identity [F2] with v=a,w=z, followed by conjugate symmetry [F1], gives ⟨U†z,a⟩root=⟨z,Ua⟩root=⟨z,ψ⟩root. Thus U∣a⟩⟨a∣U†=Πψ as operators. By [F6], UU†=U†U=I, so conjugating Ra=2∣a⟩⟨a∣−I and Sa=I−2∣a⟩⟨a∣ gives Rψ and Sψ, 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.

Sources