Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Computational-basis instruments and conditional states on two registers

Statement

Let A,B be nonzero finite-dimensional registers with ordered orthonormal bases (ea)a∈Λ and (gb)b∈Γ. Define Paea′=δa,a′ea and Qbgb′=δb,b′gb; tensor products of these maps use Tensor products of finitely many linear maps. The maps

Ia(R)=(Pa⊗IB)R(Pa⊗IB),Jb(R)=(IA⊗Qb)R(IA⊗Qb)

form finite instruments on A⊗B. If ψ=∑a,bca,bea⊗gb is a unit vector, then their outcome probabilities are

pA(a)=∑b∣ca,b∣2,pB(b)=∑a∣ca,b∣2.

For a positive-probability outcome, the conditional state is the rank-one density operator on the normalized projected vector. This applies to measuring either register of the Simon state after its coherent XOR query.

Facts & Assumptions

Given: Two nonzero finite registers, their ordered orthonormal bases, and a unit vector on their tensor product. Verify both measurement instruments and their branch laws.

[F1]

Finite instruments and conditional states: a finite instrument has complex-linear completely positive branch maps and satisfies ∑atr⁡(Ia(R))=tr⁡(R) for every input operator; positive-probability conditional states are Ia(ρ)/tr⁡(Ia(ρ)).

[F2]

Completely positive maps: complete positivity requires every finite ancilla amplification of each branch map to preserve nonnegative operators.

[F3]

Non-negative and positive operators: a nonnegative operator is self-adjoint and has nonnegative quadratic form on every vector.

[F6]

Density operator: a density operator is nonnegative and has trace one.

[F7]

Dirac Notation Conversion: ∣u⟩⟨v∣ denotes the rank-one map w↦⟨w,v⟩rootu; in orthonormal coordinates its matrix is uv†.

[F8]

Tensor products of finitely many linear maps: a tensor map acts factorwise on elementary tensors and extends linearly; an identity factor leaves its coordinate unchanged.

Proof

1.1givenF4F8construct

Each basis projection Pa and Qb is diagonal with entries 0 or 1, hence self-adjoint and idempotent; distinct projections in each family are orthogonal and each family sums to the identity. By [F8], their lifted maps Pa⊗IB and IA⊗Qb are self-adjoint idempotents, and each lifted family sums to IA⊗B.

1.2givenF4F6F7algebra

The product basis (ea⊗gb)a,b is orthonormal by [F4]. Therefore the coordinates of ψ satisfy ∑a,b∣ca,b∣2=1. By [F7], ρ=∣ψ⟩⟨ψ∣ has matrix vv†, so for every coordinate vector u its quadratic form is u†vv†u=∣v†u∣2≥0 and its trace is ∑a,b∣ca,b∣2=1. Hence ρ is a density operator by [F6].

2.1givenF2F3F8step 1.1algebra

Each branch map is complex-linear. For any finite reference register R, write an operator Q on (A⊗B)⊗R in the ancilla blocks of [F2]. Its amplified branch sends each block Qij to CQijC, so [F8] identifies the full block matrix as Q′=(C⊗IR)Q(C⊗IR), where C is the lifted projector from step 1.1. If Q is nonnegative, then Q′ is self-adjoint and ⟨Q′u,u⟩=⟨Q(C⊗IR)u,(C⊗IR)u⟩≥0 for every u by [F3], so every amplification preserves nonnegative operators. Thus each branch is completely positive by [F2].

2.2F1F4F5F7step 1.1step 1.2algebra

Write v for the coordinate column of ψ and C for either lifted projector. By [F7], the corresponding branch is Cvv†C=(Cv)(Cv)†. For outcome a, (Pa⊗IB)ψ=∑bca,bea⊗gb, so the diagonal entry at each coordinate (a,b) is ∣ca,b∣2 and every other diagonal entry is zero; off-diagonal entries within the selected a-subspace can be nonzero. Its trace is ∑b∣ca,b∣2. For outcome b, (IA⊗Qb)ψ=∑aca,bea⊗gb, so the diagonal entry at each coordinate (a,b) is ∣ca,b∣2 and every other diagonal entry is zero; off-diagonal entries within the selected b-subspace can be nonzero. Its trace is ∑a∣ca,b∣2. These traces are the asserted probabilities by [F1].

3.1F1F5step 1.1step 2.1algebra

For every operator R, cyclicity of trace and idempotence give ∑atr⁡((Pa⊗IB)R(Pa⊗IB))=tr⁡ ⁣(R∑a(Pa⊗IB))=tr⁡(R). The same calculation gives ∑btr⁡((IA⊗Qb)R(IA⊗Qb))=tr⁡(R). Together with step 2.1 these are the finite-instrument conditions of [F1].

4.1F1F6F7step 2.2algebra∎

If a branch vector w=Cψ has positive probability p=∑i∣wi∣2 from step 2.2, its conditional operator in [F1] is ∣(w/p)⟩⟨(w/p)∣. Its coordinate quadratic form is nonnegative and its trace is ∑i∣wi∣2/p=1, so it is a density operator by [F6]–[F7]; a zero-probability branch has no conditional state by [F1].

Depends on

Used by

Dependency tree · two levels

42 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