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.

Passive subspace and subsystem protection interface

Definition

Let HP, HL and HG be nonzero finite-dimensional complex inner-product spaces, and let V:HL⊗HG→HP be an isometry. Write L(H) for the linear operators on H, and Ad⁡V(X)=VXV∗. Let N be a specified family of channels from L(HP) to itself. The image of V is the specified block; its first and second tensor factors are called the logical and gauge subsystems, respectively.

The logical subsystem is noiseless for N in this interface if, for every N∈N, there is a channel ΦN:L(HG)→L(HG) such that N∘Ad⁡V=Ad⁡V∘(id⁡L(HL)⊗ΦN) on all of L(HL⊗HG). Thus the block is invariant in the sense that every encoded operator has output supported on the block, while the logical factor has identity action and the gauge factor may evolve.

When dim⁡HG=1, this condition defines a decoherence-free subspace for the family: the induced action on operators of the encoded subspace is the identity. A separate, explicitly tracked-unitary convention permits a specified unitary UN on HL for each N and replaces the identity factor by Ad⁡UN; it is not the identity-action condition unless that induced conjugation is the identity. A change in a noise map, including one described as a symmetry perturbation, must satisfy the relevant displayed factorization to retain the corresponding property. Energy-level degeneracy alone is not part of this definition.

Facts & Assumptions

[F1]

The finite tensor product and its inner product are the ordered tensor construction of Ordered tensor registers, their inner product, and wire permutations.

[F2]

A channel is a complex-linear, completely positive, trace-preserving map on the full finite-dimensional operator space, as in Finite-dimensional quantum channel.

[F3]

Linear isometries preserve the induced norm, and a unitary operator is an invertible complex-linear isometry of a finite-dimensional inner-product space, as in Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces.

[F4]

The adjoint is characterized by ⟨Tx,y⟩=⟨x,T∗y⟩ with the inner product linear in the first argument, as in The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V; every linear map between finite-dimensional inner-product spaces has a unique such adjoint by Every linear map between finite-dimensional inner product spaces has a unique adjoint.

[F5]

Tensor products of linear maps are the unique linear extensions of their prescribed action on elementary tensors, as in Tensor products of finitely many linear maps. This applies both to operators on the factors and to linear maps on their finite-dimensional operator spaces.

[F6]

For specified ordered orthonormal bases of finite-dimensional complex inner-product spaces, the tensors of the associated operator matrix units form a basis of the full operator space on the tensor product, by Tensor products of operator matrix units form a basis.

Justification

The tensor construction in [F1] gives the domain of the isometry in [F3] and a product basis. The finite-dimensional adjoint existence in [F4] makes V∗:HP→HL⊗HG well-defined, so X↦VXV∗ has the stated operator-space domain and codomain. On elementary operator tensors the expression (id⁡⊗ΦN)(A⊗B)=A⊗ΦN(B) extends linearly and uniquely: [F5] constructs the tensor map on L(HL)⊗L(HG), and [F6] identifies that space with L(HL⊗HG) by its product matrix-unit basis. Both sides of the defining equality are therefore linear maps with the same domain and codomain. For a one-dimensional gauge space every operator is a scalar multiple of its identity, and trace preservation in [F2] forces its channel to be the identity; the stated subspace specialization follows. The tracked-unitary version is a separately specified convention, with Ad⁡U(A)=UAU∗ using the unitary in [F3] and its adjoint from [F4].

Source notes

The source describes a noiseless factor through interaction operators that act on its cofactor. The definition above states the channel-level interface used here and does not assert that an arbitrary energy degeneracy supplies its factorization.

Depends on

Used by · 1

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.

External dependencies

Theory of Quantum Error Correction for General Noise · PDF p. 3, Noiseless Subsystems

In the interaction-algebra decomposition, a factor on which the interaction operators act trivially is a noiseless subsystem; noiseless subspaces are special cases.

Hypotheses: The source's finite-dimensional interaction-algebra setting and its stated decomposition.

Reading limits: Read the Noiseless Subsystems passage on PDF p. 3. The channel-level contract and tracked-unitary convention below are local formulations; the source passage is not asserted to state those formulas or to prove their equivalence with every other convention.

Sources