Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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.

One Simon Fourier-sampling sample

Definition

Input: Integers n≥1, m≥n−1, and ordinary access through the Standard bit-flip query convention to a total function satisfying Simon hidden-XOR-period promise. Prepare an ordered n-qubit address register and m-qubit target register, both in their zero computational-basis states.

Instructions:

  1. Apply the exact one-qubit Hadamard gate to every address wire, producing H⊗n∣0n⟩, and leave the target at ∣0m⟩.
  2. Apply the standard bit-flip oracle Uf∣x⟩∣z⟩=∣x⟩∣z⊕f(x)⟩ once. Measure the target with the computational-basis projective measurement Finite projective measurements, viewed as the finite POVM Finite POVMs and their outcome law. Use the Lüders branch maps Iv(X)=PvXPv, where Pv=Iaddress⊗∣v⟩⟨v∣, under the instrument and conditional-state interface Finite instruments and conditional states. Theorem The square-root Lüders maps form an instrument supplies a valid instrument; its outcome weights and positive-branch states are covered by Instrument outcome weights normalize and Positive-probability instrument branches are density operators. Discard the reported value and target register. The POVM effects are these same Pv.
  3. Apply H⊗n to the address register and measure it in the computational basis. Return the observed n-bit string y as one sample row.

Every branch uses exactly one oracle query and 2n Hadamard gates. It makes one finite instrument measurement on the target and one terminal projective measurement on the address. The intermediate target outcome is not used by classical postprocessing. There is no failure branch, controlled-oracle call, or inverse-oracle call. This procedure's sample law is proved separately in Simon samples uniformly from s-perp.

Depends on

Used by

Dependency tree · two levels

41 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