Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Optimal Cloning Worst Case Upper Bound

Statement

Assume the choice branch in Symmetric Subspace Dimension And Haar Moment. Let d≥1 and 1≤n≤m. Every channel Φ:L((Cd)⊗n)→L((Cd)⊗m) has inf⁡∥u∥=1F ⁣(Φ(∣u⟩⟨u∣⊗n),∣u⟩⟨u∣⊗m)2≤NnNm,Nr=(r+d−1d−1).

Facts & Assumptions

Given: d≥1, 1≤n≤m, a channel Φ, and the normalized unitary-invariant measure in the stated choice branch.

[L1]

The Haar moment is ∫∣u⟩⟨u∣⊗rdμ=Πsym,r/Nr (Symmetric Subspace Dimension And Haar Moment, The Axiom of Choice).

[L2]

For a state η and a pure projector Pu, the squared root fidelity is F(η,Pu)2=tr⁡(ηPu); this follows from the definition and the one-nonzero-singular-value formula (Fidelity, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[L3]

A channel is completely positive and trace-preserving on the full operator space; it has a finite Kraus representation Φ(X)=∑aAaXAa∗ with ∑aAa∗Aa=I (Finite-dimensional quantum channel, Kraus and Choi characterizations of complete positivity, Trace preservation is Kraus normalization).

[F1]

For r∈{n,m}, Πsym,r is the orthogonal projector onto the symmetric subspace; it and I−Πsym,r are nonnegative (Symmetric Subspace Projector, The permutation average is the symmetric-subspace projector).

[F2]

If A,B are nonnegative, then tr⁡(AB)=tr⁡(B1/2AB1/2)≥0 by cyclicity and positivity (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA), A non-negative operator has a unique non-negative square root).

[F3]

Cauchy–Schwarz gives ∣⟨x,y⟩∣2≤∥x∥2∥y∥2 (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs). Rank-one operators act by ∣x⟩⟨y∣z=⟨z,y⟩x (Dirac Notation Conversion).

Proof

1.1givenL2L3F1F3algebrachoose

Choose a finite Kraus family (Aa) from [L3], and write Πn=Πsym,n and Πm=Πsym,m. For each unit u, put v=u⊗n, w=u⊗m, and f(u)=tr⁡(Φ(∣v⟩⟨v∣)∣w⟩⟨w∣). By [L2], this is the squared root fidelity in the Statement. Since v is a unit symmetric tensor, Πnv=v by [F1]. The Kraus formula, the rank-one convention, and Cauchy–Schwarz [F3] give f(u)=∑a∣⟨Aav,w⟩∣2=∑a∣⟨v,ΠnAa∗w⟩∣2≤∑a∥ΠnAa∗w∥2=⟨Cw,w⟩, where C=∑aAaΠnAa∗ is self-adjoint and nonnegative: each quadratic form is ∥ΠnAa∗w∥2.

2.1givenL1L3F1F2step 1.1algebra∎

Integrating this pointwise bound and applying the m-th Haar moment [L1] yields ∫f(u)dμ(u)≤tr⁡(CΠm)/Nm. Since C and I−Πm are nonnegative by step 1.1 and [F1], [F2] gives tr⁡(C(I−Πm))≥0, hence tr⁡(CΠm)≤tr⁡C. Trace cyclicity [F2], normalization [L3], and [L1] give tr⁡C=∑atr⁡(ΠnAa∗Aa)=tr⁡Πn=Nn. Therefore ∫f(u)dμ(u)≤Nn/Nm. The function f is continuous in the finite coordinates of u, hence measurable; because μ is a probability measure, its infimum is no larger than its average. Thus inf⁡∥u∥=1f(u)≤Nn/Nm, including d=1 and n=m.

Depends on

Used by

Dependency tree · two levels

58 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