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

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

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

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

Optimal Cloner Attains Bound

Statement

Assume the choice branch in Symmetric Subspace Dimension And Haar Moment. Let d≥1 and 1≤n≤m. Write Nr=(r+d−1d−1) and let Πsym,r project onto Sym⁡r(Cd). For any fixed output density operator ω on (Cd)⊗m, the map Φ(X)=NnNmΠsym,m(X⊗I⊗(m−n))Πsym,m+tr⁡((I−Πsym,n)X) ω is a channel and satisfies tr⁡(Φ(∣u⟩⟨u∣⊗n)∣u⟩⟨u∣⊗m)=Nn/Nm for every unit u∈Cd.

Facts & Assumptions

Given: d≥1, 1≤n≤m, projectors Πsym,r, a fixed output density ω, and the choice-dependent Haar-moment theorem.

[L1]

Πsym,r is the orthogonal projector on the permutation-invariant subspace (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector). The QC02 permutation definition and the local projector proof are draft carriers.

[L2]

dim⁡Sym⁡r=Nr and ∫∣u⟩⟨u∣⊗rdμ=Πsym,r/Nr (Symmetric Subspace Dimension And Haar Moment, The Axiom of Choice). The Haar supplier is a current draft; its choice assumption is explicit.

[L3]

Finite Kraus sums are completely positive (A finite Kraus sum is completely positive), and the partial trace satisfies tr⁡(A(X⊗I))=tr⁡(XTr⁡m−nA) (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent, For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)). The QC02 carriers are present as drafts; the trace identity follows from the stated trace-pairing characterization.

[F1]

A quantum channel is completely positive and trace-preserving on the full operator space (Finite-dimensional quantum channel).

[F2]

A density operator has trace one (Density operator).

[F4]

Finite-dimensional complex inner-product spaces have orthonormal bases (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[F5]

A nonnegative operator has a unique nonnegative square root (A non-negative operator has a unique non-negative square root).

[F6]

Dirac outer products act by z↦⟨z,y⟩x, and tensor maps are the factorwise linear extensions on ordered tensor registers (Dirac Notation Conversion, Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations).

Proof

1.1givenL1L3F3F4F5F6algebrachoose

Put E=I−Πsym,n≥0 by [L1], so E1/2 exists by [F5]. The first summand of Φ is completely positive: by [F4], choose an orthonormal product basis (gj) of the added registers and set Aj=Nn/Nm Πsym,m(I⊗∣gj⟩). Then ∑jAjXAj∗=NnNmΠsym,m(X⊗I⊗(m−n))Πsym,m. When m=n, the added tensor unit has its single basis vector and this map is the identity before compression. By [F3], write ω=∑ℓsℓ∣fℓ⟩⟨fℓ∣ in an orthonormal eigenbasis and choose an input orthonormal basis (ej) by [F4]. The second summand has Kraus operators Kℓj=sℓ∣fℓ⟩⟨ej∣E1/2, using [F6] and the outer-product convention, since ∑ℓ,jKℓjXKℓj∗=tr⁡(EX)ω. Thus both summands and their sum are completely positive by the finite Kraus theorem [L3].

2.1givenL1L2L3F1F2F6step 1.1algebra

The Haar moment [L2], followed by the coordinate partial trace over the last m−n factors, gives Tr⁡m−n(Πsym,m)=(Nm/Nn)Πsym,n, because each product-basis partial trace sends ∣u⟩⟨u∣⊗m to ∣u⟩⟨u∣⊗n. Finite-dimensionality allows the partial trace to pass through the coordinatewise integral. Therefore tr⁡ ⁣(NnNmΠsym,m(X⊗I)Πsym,m)=tr⁡(XΠsym,n), where cyclicity, Πsym,m2=Πsym,m, and [L3] were used. The second summand has trace tr⁡(EX)tr⁡(ω)=tr⁡(EX) by [F2]. Their sum is tr⁡X, so [F1] and step 1.1 make Φ a channel.

3.1givenL1step 2.1algebra∎

For unit u, ∣u⟩⊗n lies in the symmetric subspace, so the second summand vanishes. Also ∣u⟩⊗m is fixed by Πsym,m. Its expectation in the first summand is therefore (Nn/Nm)⟨u⊗m∣(∣u⟩⟨u∣⊗n⊗I)∣u⊗m⟩=Nn/Nm. This value is independent of u, proving the claim.

Depends on

Used by

Dependency tree · two levels

61 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