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.
Finite operator and ket conventions
Definition
A finite operator space in these conventions is a specified nonzero complex coordinate space , , equipped with its standard inner product and a specified ordered orthonormal basis. An ordered basis is a finite ordered list of linearly independent vectors spanning the space. An orthonormal basis is a basis whose vectors have inner products with themselves and with each other. Coordinates and matrices below are taken in the specified bases. The root inner product is linear in its first argument; on standard coordinates it is .
Below, and , with , are any two finite operator spaces with their specified ordered orthonormal bases and . For in a specified ordered basis , its coordinate column is ; the same symbol also denotes this column. For a linear map , its matrix, also denoted , is determined by . Products denote rectangular matrix products, , for compatible shapes. Transposition means , and denotes entrywise complex conjugation.
For vectors and , the ket denotes , the bra denotes the linear functional on , and the outer product maps to . For a linear map , denotes the adjoint, represented by the conjugate transpose . The bracket means , equivalently .
An ordered tensor register consists of a finite ordered list of finite-dimensional complex inner-product spaces, each with a specified ordered orthonormal basis: its factors remain in the displayed order and its product basis is ordered lexicographically. The empty tensor product is . No infinite tensor product or unspecified basis is implicit.
Definition references
Real and complex inner product spaces, with the inner product linear in the first argument
The standard formulas ⟨ x,y⟩=∑_k<nxₖ yₖ on ℝⁿ and ∑_k<nxₖyₖ on ℂⁿ are inner products
The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V
Ordered tensor registers, their inner product, and wire permutations
Linear map between vector spaces over the same field
Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases
Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes
Justification
In an orthonormal basis, expanding the vectors in their coordinate columns and using linearity in the first argument and conjugate symmetry gives in those coordinates, consistent with the standard-coordinate inner product. These are the coordinate columns of Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases, in the ordered bases of Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, using Real and complex inner product spaces, with the inner product linear in the first argument and The standard formulas ⟨ x,y⟩=∑_k<nxₖ yₖ on ℝⁿ and ∑_k<nxₖyₖ on ℂⁿ are inner products.
Hence is linear in , so the stated outer product preserves linear combinations and is a well-defined linear map in the sense of Linear map between vector spaces over the same field. The scalar product of the row and column uses Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes.
Expanding and applying linearity to the defining matrix columns gives , the matrix action supplied by the coordinate-column convention and rectangular multiplication. This uses Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases, Linear map between vector spaces over the same field and Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes.
For and , the finite coordinate sums give , where by The transpose A^T of a matrix. Thus the conjugate transpose satisfies the defining adjoint identity of The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V, with the inner product of Real and complex inner product spaces, with the inner product linear in the first argument and the matrix products of Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes. In particular .
The ordered tensor construction and its product basis are supplied by Ordered tensor registers, their inner product, and wire permutations.
Depends on
- Real and complex inner product spaces, with the inner product linear in the first argument
- The standard formulas ⟨ x,y⟩=∑_k<nxₖ yₖ on ℝⁿ and ∑_k<nxₖyₖ on ℂⁿ are inner products
- The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V
- Ordered tensor registers, their inner product, and wire permutations
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear map between vector spaces over the same field
- Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases
- Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes
- The transpose A^T of a matrix
Used by · 48
- Monolithic encoding and degenerate error processes
- Knill–Laflamme criterion
- Environment-state independence under KL
- Resolved rank-one transition obstructs exact correction
- QEC matrix and logical partial trace
- Transpose (Petz) recovery on a code
- Haar-average fidelity versus entanglement fidelity
- Four-level spontaneous-decay model
- Four-level syndrome recovery
- Exact state evolution from a four-level codeword
- Conditional decoded state and decay coherence
- Branch-averaged decoded state fidelity
- Cubic short-time loss and recoverable limits
- Exact four-level Kraus operators
- Degenerate four-level amplitude-damping form
- Onset of the third four-level Kraus operator
- Decay Kraus weights and photon overlap
- Exact four-level transpose fidelity
- Long-time four-level transpose plateau
- Explicit four-level transpose decoder
- Optimal phase-corrected four-level recovery
- Angular-momentum basis and tensor labels
- Angular-momentum emitter, photon bath, and dipole approximation
- Spherical vector components and transition-frequency convention
- Minimal single-manifold encoding
- Detection-code errors retain partial logical information
- Matrix elements of the fast detected-decay state
- Pauli-complementary qubit recovery fidelity inequality
- QEC matrix as an error-vector Gram operator
- Independent transpose Gram fidelity formula
- Haar-average versus entanglement fidelity
- Qubit coherence channels and fidelity functionals
- Two orthogonal Pauli alternatives bound recovery fidelity
- Conditional jump-time phases form a positive Gram matrix
- Two-path coherence Gram spectrum and Kraus weights
- Transpose recovery for a flagged coherence channel
- Calibrated diagonal lifts and transition phase differences
- Downward dipole coefficient normalization contract
- Real coefficient arrays for the signed spin-four isometry
- Nonvanishing downward coefficients for spin one and two
- Support of an integrated finite trajectory family
- Distinct complex exponentials have full interval Gram rank
- One-jump span in the nine-dimensional lowering model
- Coefficient variation controls a weighted-shift operator
- An affine family of lifts and couplings
- Spin-two downward coefficients and detection-code output populations
- A uniform transpose-fidelity bound for the one-decay channel
- Orthogonal decay sectors yield a strict fidelity margin
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.