Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

SDP maximally entangled reference-state access

Definition

For an integer matrix dimension d≥1, define the maximally entangled reference vector ∣Φd⟩=d−1/2∑i=0d−1∣i⟩∣i⟩ on two ordered d-dimensional registers. The access contract supplies a finite preparation unitary VΦ, its inverse, width/ancillas, input encoding, and costs CΦ, satisfying VΦ(∣0⟩∣0⟩∣0a⟩)=∣Φd⟩∣0a⟩ exactly in the declared encoding. Its action on other inputs is any supplied unitary completion; the inverse is that of the complete unitary. When d=2q, a concrete preparation applies H to each of the q first-register qubits and then CNOT from each first-register qubit to its matching second-register qubit, using exactly q Hadamards and q CNOTs on 2q wires. For other d, VΦ and its cost are supplied inputs satisfying the same preparation equation; unused encoded labels have zero output amplitude, and no padding is allowed unless its effect on traces is accounted for.

Facts & Assumptions

Given: Ordered computational-basis registers and the finite tensor-product basis convention.

[F1]

Finite registers and their ordered computational bases: basis labels determine the ordered register states.

[F2]

The computational basis is orthonormal: the computational basis is orthonormal.

[F3]

Denotational semantics of a finite layered circuit: Hadamard and CNOT layers denote their finite unitary products.

Verification

technique · direct
1.1givenF1F2F3algebra

Applying H⊗q to ∣0q⟩ gives 2−q/2∑i=02q−1∣i⟩ by the one-qubit formula and tensor expansion. The subsequent CNOT layer maps each basis vector ∣i⟩∣0q⟩ to ∣i⟩∣i⟩, so the output is exactly 2−q/2∑i∣i,i⟩=∣Φd⟩ when d=2q.

2.1givenstep 1.1algebra∎

The construction in step 1.1 has one Hadamard and one CNOT for each of q bit positions and acts on the two declared q-qubit registers. For non-power-of-two d, the separately supplied VΦ contract is the entire preparation claim, and its cost is retained as CΦ.

Depends on

Used by

Dependency tree · two levels

30 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