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 supplied by the QC02 register interface. Set the logical space to with the standard pairing , and let be its standard basis. Define , . The code projector is diagonal in this basis, with diagonal entry at and elsewhere. Define and . Then is detectable but is not; the code has distance , and the boundary operator has weight exactly .
Facts & Assumptions
Given: The ordered three-qubit tensor basis and its orthonormality as specified by the QC02 interface, together with the maps defined above.
Finite registers and their ordered computational bases: A qubit is with ordered standard basis ; for qubits, bit positions are ordered lexicographically with the first wire most significant.
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.
The product basis is orthonormal and tensor dimensions multiply: The elementary product vectors form an orthonormal basis of the finite tensor register.
Tensor products of finitely many linear maps: A tensor map is the unique linear extension of its factorwise action on elementary tensors.
The adjoint is characterised by : The adjoint satisfies .
Quantum code as an isometric encoding and its code projector: The code projector is and the code subspace is .
An isometric quantum encoding gives an orthogonal code projector: is the orthogonal projection onto the code subspace.
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.
Detectable operators and distance of a finite-register quantum code: An operator is detectable iff ; distance is the minimum weight of an undetectable operator when .
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.
Every operator below the quantum code distance is detectable: Every operator of weight strictly below the quantum distance is detectable.
Verification
From the standard pairing in [F1], , so are orthonormal. Each physical factor is also with this pairing; [F2] gives , and [F3] gives the ordered product basis. Thus are orthonormal, and is isometric. For each basis vector , [F5] gives , which is for or and otherwise. Since , this computes , , and for the other six basis strings. Thus has exactly the stated diagonal entries and is the code projector in [L1] and [L2].
The map sends to and to , both orthogonal to the code subspace by [F3]. Thus , so is detectable with scalar . By [F1] and [F4], its action on elementary tensors is ; hence it is supported on the first wire and has weight at most .
The map fixes and negates . Thus acts by eigenvalues and on the two-dimensional code subspace and is not a scalar multiple of . By [F1] and [F4], it is , so it has weight at most . It is non-detectable; every weight-zero operator is detectable by [L5]. Therefore the minimum non-detectable weight is , and .
By [L6], every operator of weight is detectable; step 1.3 exhibits a non-detectable operator of weight exactly . 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
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Support and weight of an operator on a finite register
- Detectable operators and distance of a finite-register quantum code
- Quantum code as an isometric encoding and its code projector
- Finite registers and their ordered computational bases
- Tensor products of finitely many linear maps
- Ordered tensor registers, their inner product, and wire permutations
- Detectable operators form a subspace and quantum distance is well defined
- The product basis is orthonormal and tensor dimensions multiply
- An isometric quantum encoding gives an orthogonal code projector
- Every operator below the quantum code distance is detectable
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
- Richard Cleve, Quantum Information Processing course notes, §§36.3 and 37.3 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 7, §§7.1 and 7.4.1 (standard reference, not scraped)