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.
Preserving the logical marginal forces a gauge-only channel
Statement
Let be nonzero finite-dimensional complex inner-product spaces in the fixed order . Let be a channel with a finite Kraus family . If for every positive semidefinite trace-one operator on , then there are operators such that for every and . Consequently for the channel , and the same marginal identity holds after tensoring with the identity on any finite reference space. Conversely, any finite family with defines a channel with this marginal-preserving property.
Also let be an isometric encoding and let be a channel. For every unit , the gauge-reset map where , is a channel into the encoded subspace .
Facts & Assumptions
Given: The finite-dimensional spaces and channel in the first part of the Statement; and, for its final assertion, the isometry and decoded channel there specified.
Partial trace over the first tensor factor: in the order , the matrix entries are , and the same formula applies with .
Real and complex inner product spaces, with the inner product linear in the first argument and The adjoint is characterised by : the pairing is linear in its first argument and .
Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional inner-product spaces have orthonormal bases. For a subspace of a finite-dimensional inner product space, : a vector can be extended to an orthonormal basis by adjoining an orthonormal basis of its orthogonal complement.
Finite Kraus representation and Finite-dimensional quantum channel: a finite Kraus family represents its channel on the full operator space, and a channel is completely positive and trace-preserving.
Trace preservation is Kraus normalization: a finite Kraus family is trace-preserving exactly when its adjoint-square sum is the identity.
An isometric quantum encoding gives an orthogonal code projector: for an isometric encoding.
Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act on elementary tensors and .
The product basis is orthonormal and tensor dimensions multiply: elementary product tensors form a basis and span the finite tensor product.
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
Kraus and Choi characterizations of complete positivity: every finite-dimensional completely positive map has a finite Kraus representation.
Product operator matrix units form a basis: for finite-dimensional factors with ordered bases, tensor products of operator matrix units form a basis of the endomorphisms of their product space. Finite iterated tensor products represent multilinear maps independently of parenthesization supplies the canonical reassociation for the ordered three-factor register.
Proof
Fix unit vectors and , and write . Extend to an orthonormal basis of with , using [F3]. For each , expand . Apply the marginal hypothesis to the rank-one density operator . By [F4] the output is . In each diagonal entry , the partial-trace formula [F1] sums the squared coordinates of over an orthonormal basis of , so that entry is . The required marginal is , whose th diagonal entry is zero for every . Since each squared norm is nonnegative, for all and . Hence for some .
Fix a unit . If unit vectors are linearly independent, then ; normalize their sum and apply step 1.1 to and . Linearity of gives . Extend to a basis and apply its two corresponding coordinate functionals to the second tensor factor; this gives . If for a unit scalar , linearity and give the same equality directly. Thus is independent of the unit vector .
Fix a unit . For unit , step 1.1 shows lies in . Scaling gives the same for every . Define by ; it is unique because is injective. The linearity of makes linear. By step 2.1, for all simple tensors. Since simple tensors span by [F8], .
Trace preservation [F5] and step 3.1 give , using the tensor-adjoint rule [F7]. Apply both sides to for arbitrary and a fixed unit . Injectivity of yields .
Define . Its finite Kraus form makes it completely positive by [F9], and the normalization from step 4.1 makes it trace-preserving by [F5]. Thus it is a channel. On a simple operator tensor , step 3.1 gives . By [F11], tensor products of operator matrix units form a basis of the full operator space, so linearity gives .
For a finite reference space , choose orthonormal bases of by [F3]; [F8] gives the product basis of . Use the canonical reassociation in [F11] and the operator matrix-unit basis there to write any operator on as , with . Write . By the first-factor partial-trace formula [F1], the coefficient of after applying and tracing out is . Therefore the output marginal is . The calculation applies to every operator, hence to every density operator and every finite reference.
For the gauge-reset assertion, choose an orthonormal basis of and define by . Its adjoint is , so ; simple tensors span, hence . On the product basis, the matrix entries of are exactly the first-factor contraction entries in [F1], hence . Let be . It is an isometry by [F6]. Choose finite Kraus operators for using [F10]. Since , the gauge-reset map equals , so it has Kraus operators , and . Thus the map is completely positive by [F9] and trace-preserving by [F5], so it is a channel. Its range is contained in by construction.
Depends on
- Finite iterated tensor products represent multilinear maps independently of parenthesization
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Real and complex inner product spaces, with the inner product linear in the first argument
- Partial trace over the first tensor factor
- Finite Kraus representation
- Finite-dimensional quantum channel
- Finite registers and their ordered computational bases
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- The product basis is orthonormal and tensor dimensions multiply
- Product operator matrix units form a basis
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- An isometric quantum encoding gives an orthogonal code projector
- Kraus and Choi characterizations of complete positivity
- A finite Kraus sum is completely positive
- Tensor maps preserve composition, identities, and adjoints
- Trace preservation is Kraus normalization
- The elementary tensors of two bases form the product basis of the tensor product
Used by
Dependency tree · two levels
66 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
- John Preskill, Quantum Information, Chapter 7: Quantum Error Correction (working draft, March 2026) (standard reference, not scraped)
- David W. Kribs, Raymond Laflamme, David Poulin, and Maia Lesosky, Operator Quantum Error Correction (standard reference, not scraped)