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

Kraus rank and Choi representation

PDF p. 3: Second paragraph

Definition

Let H and K be finite-dimensional complex inner-product spaces, with d=dim⁡H>0, and fix an ordered orthonormal basis (ei)i=1d of H. Write L(H) for the linear endomorphisms of H. A quantum channel N:L(H)→L(K) is a complex-linear, completely positive, trace-preserving map: complete positivity means that id⁡L(E)⊗N takes positive operators to positive operators for every finite-dimensional complex inner-product space E, and trace preservation means Tr⁡N(X)=Tr⁡X for every X.

A finite Kraus representation of N is a finite family of linear maps Aa:H→K such that N(X)=∑aAaXAa† for every X∈L(H), where Aa† is the adjoint. The Kraus rank is the minimum number of operators in such a representation; zero operators are allowed but cannot reduce this minimum.

The input-first, unnormalized Choi matrix relative to the chosen basis is J=∑i,j=1d∣ei⟩⟨ej∣⊗N(∣ei⟩⟨ej∣). Given an orthonormal family of eigenvectors vk for all positive eigenvalues λk of J, repeated according to multiplicity, define the associated canonical Kraus operators Kk:H→K by ∑iei⊗Kkei=λkvk. For a linear map T:H→K, its finite-dimensional Hilbert–Schmidt norm is ∥T∥HS=(∑i=1d∥Tei∥2)1/2; this value is independent of the orthonormal input basis. Their weights are wk=Tr⁡(Kk†Kk), the squares of their Hilbert–Schmidt norms.

Justification

Given: The finite-dimensional spaces, ordered orthonormal input basis, channel and canonical operators in the Definition.

1.1 For every linear map T:H→K, the finite-basis specialization of the Hilbert–Schmidt definition is ∥T∥HS2=∑i∥Tei∥2. The trace of T†T is the sum of its diagonal coefficients in this orthonormal basis, and the adjoint identity gives each coefficient as ∥Tei∥2. Hence Tr⁡(T†T)=∑i∥Tei∥2=∥T∥HS2. Computing in any other orthonormal input basis gives the same basis-independent trace, so the sum and its nonnegative square root are independent of that basis. Hilbert–Schmidt operator and Hilbert–Schmidt norm The basis-independent trace of an endomorphism of a finite-dimensional vector space Finite Kraus representation [given, algebra]

2.1 The canonical Choi lemma applies to precisely the spaces, channel and Choi convention in the Definition. It supplies the constructed finite Kraus representation and states directly that its size r=rank⁡J is the minimum among all finite Kraus representation sizes. Thus the minimum used to define Kraus rank exists. The lemma also gives Tr⁡(Kk†Kl)=λkδkl, so step 1.1 yields wk=λk=∥Kk∥HS2. The construction and weights are well defined after choosing the eigenvectors. As the lemma explains, a repeated eigenvalue permits an orthonormal eigenbasis change, so individual canonical operators need not be unique; the positive eigenvalues with multiplicities, and hence the weights, remain unchanged. Canonical Choi eigenvectors, Kraus rank and branch weights [given, step 1.1] ∎

Depends on

Used by · 4

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