Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Quantum repetition subspace projector and a distance-one boundary error

Example

Use the ordered three-qubit tensor basis ux0x1x2 supplied by the QC02 register interface. Set the logical space to Q2=C2 with the standard pairing ⟨z,w⟩=∑r<2zrwr‾, and let e0,e1 be its standard basis. Define Ve0=u000, Ve1=u111. The code projector is diagonal in this basis, with diagonal entry 1 at 000,111 and 0 elsewhere. Define EXux0x1x2=u(1−x0)x1x2 and EZux0x1x2=(−1)x0ux0x1x2. Then EX is detectable but EZ is not; the code has distance 1, and the boundary operator has weight exactly d.

Facts & Assumptions

Given: The ordered three-qubit tensor basis and its orthonormality as specified by the QC02 interface, together with the maps V,EX,EZ defined above.

[F1]

Finite registers and their ordered computational bases: A qubit is Q2=C2 with ordered standard basis (e0,e1); for n qubits, bit positions are ordered lexicographically with the first wire most significant.

[F2]

Ordered tensor registers, their inner product, and wire permutations: The tensor inner product is the product of the factor pairings, linear in the first argument, and product basis vectors are ordered lexicographically.

[F3]

The product basis is orthonormal and tensor dimensions multiply: The elementary product vectors form an orthonormal basis of the finite tensor register.

[F4]

Tensor products of finitely many linear maps: A tensor map is the unique linear extension of its factorwise action on elementary tensors.

[F5]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: The adjoint satisfies ⟨Vx,z⟩P=⟨x,V∗z⟩L.

[L1]

Quantum code as an isometric encoding and its code projector: The code projector is P=VV∗ and the code subspace is im⁡V.

[L2]

An isometric quantum encoding gives an orthogonal code projector: P is the orthogonal projection onto the code subspace.

[L3]

Support and weight of an operator on a finite register: Support on a set of wires defines operator weight, and scalar identity operators have weight zero.

[L4]

Detectable operators and distance of a finite-register quantum code: An operator is detectable iff PEP=λP; distance is the minimum weight of an undetectable operator when K≥2.

[L5]

Detectable operators form a subspace and quantum distance is well defined: For logical dimension at least two, the undetectable set is nonempty and its minimum weight exists; weight-zero operators are detectable.

[L6]

Every operator below the quantum code distance is detectable: Every operator of weight strictly below the quantum distance is detectable.

Verification

1.1F1F2F3F5L1L2given

From the standard pairing in [F1], ⟨ei,ej⟩L=∑r<2δriδrj‾=δij, so e0,e1 are orthonormal. Each physical factor is also Q2 with this pairing; [F2] gives ⟨ux,uy⟩P=∏k<3δxkyk, and [F3] gives the ordered product basis. Thus u000,u111 are orthonormal, and V is isometric. For each basis vector ux, [F5] gives ⟨ei,V∗ux⟩L=⟨Vei,ux⟩P, which is 1 for (i,x)=(0,000) or (1,111) and 0 otherwise. Since ⟨ei,y⟩L=yi‾, this computes V∗u000=e0, V∗u111=e1, and V∗ux=0 for the other six basis strings. Thus P=VV∗ has exactly the stated diagonal entries and is the code projector in [L1] and [L2].

1.2F1F3F4L2L3L4given

The map EX sends u000 to u100 and u111 to u011, both orthogonal to the code subspace by [F3]. Thus PEXP=0, so EX is detectable with scalar 0. By [F1] and [F4], its action on elementary tensors is X⊗I⊗I; hence it is supported on the first wire and has weight at most 1.

1.3F1F4L3L4L5givenalgebra

The map EZ fixes u000 and negates u111. Thus PEZP acts by eigenvalues +1 and −1 on the two-dimensional code subspace and is not a scalar multiple of P. By [F1] and [F4], it is Z⊗I⊗I, so it has weight at most 1. It is non-detectable; every weight-zero operator is detectable by [L5]. Therefore the minimum non-detectable weight is d=1, and wt⁡(EZ)=d.

2.1L6step 1.3∎

By [L6], every operator of weight <d=1 is detectable; step 1.3 exhibits a non-detectable operator of weight exactly d. Thus the detection boundary is sharp, and no correction-map claim follows.

Remarks

The calculation follows the current QC02 basis and tensor-map definitions; the relevant supplier bodies were inspected before this example was recorded.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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