Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

Effective Kraus rank and branch weight

PDF p. 4: First paragraph, Fig. 2

Definition

Let H and K be finite-dimensional complex inner-product spaces with d=dim⁡H>0, and let N:L(H)→L(K) be a quantum channel, meaning a completely positive, trace-preserving linear map. Here L(H) is the space of linear endomorphisms of H. Fix an ordered orthonormal basis (ei) of H and form the input-first, unnormalized Choi matrix J=∑i,j∣ei⟩⟨ej∣⊗N(∣ei⟩⟨ej∣).

Choose an orthonormal eigenvector vk for each positive eigenvalue λk of J, repeated with multiplicity. The associated canonical Kraus operator Ek:H→K is defined by ∑iei⊗Ekei=λkvk. Its weight is wk=Tr⁡(Ek†Ek). The article's effective Kraus rank is reff=#{k:wk>10−8}, with a strict inequality. The exact Kraus rank is the minimum number of operators in any finite Kraus representation of the channel; equivalently, it counts all positive weights, including those at or below the threshold.

The branch associated with Ek is the map X↦EkXEk†. For the maximally mixed input IH/d, its probability in this canonical instrument is wk/d. This is a property of the specified mathematical instrument; a canonical decomposition alone does not identify a unique physical measurement record.

Facts & Assumptions

[F1]

In the stated finite-dimensional channel setting, the canonical operators form a Kraus representation, wk=λk, and the exact Kraus rank is the number of positive eigenvalues of J, counted with multiplicity. Canonical Choi eigenvectors, Kraus rank and branch weights

[F2]

The canonical branch maps form an instrument, and the probability of branch k on IH/d is wk/d. Canonical Choi eigenvectors, Kraus rank and branch weights

[F3]

A threshold count depends on the chosen Choi normalization and excludes weights equal to the threshold when the comparison is strict. Exact versus thresholded Kraus rank protocol

Justification

By [F1], the canonical weights are precisely the positive eigenvalues of the unnormalized Choi matrix, counted with multiplicity. Consequently the count is finite and independent of the choice of orthonormal basis within a repeated-eigenvalue eigenspace, although the individual operators may change. The threshold count cannot exceed exact rank; it is smaller precisely when a positive weight is at most 10−8. By [F2], the stated branch probability follows for the specified instrument. By [F3], using J/d instead would divide the weights and the equivalent threshold by d; the numerical threshold in this definition applies to J itself. Canonical Choi eigenvectors, Kraus rank and branch weights Exact versus thresholded Kraus rank protocol

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources