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.
Random Simon-oracle distribution for a classical lower bound
Definition
Fix and , and put and . Choose uniformly from the nonzero binary masks. Let be the set of address pairs . Conditional on , choose uniformly an injection and define the total oracle .
The sample space consists of all pairs with equal weight. There are cosets and labels, so each admits exactly injections; this number does not depend on . Thus the marginal on is uniform and the conditional label assignment is uniform without replacement.
Facts & Assumptions
Given: Integers , , and the hidden-XOR-period promise.
Simon hidden-XOR-period promise: a valid Simon function is total and satisfies exactly when or for its unique nonzero mask.
Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space is a finite outcome set with nonnegative weights summing to one.
Verification
For every nonzero , the map is a fixed-point-free involution, so its addresses split into two-element cosets. Since , , and the number of injections from a -element set into an -element set is , the sample space is finite and nonempty.
Give every pair weight . There are exactly the denominator's many pairs, so the weights are nonnegative and sum to one by [F2]. Because the number of injections is constant for each , the induced hidden mask is uniform and, conditional on it, every injection is equally likely.
If , the two addresses lie in the same coset and receive the same label. Conversely, if , injectivity of gives equal cosets, hence or . Since , this is exactly the Simon promise with unique hidden mask .
Depends on
Used by
Dependency tree · two levels
8 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
- Ronald de Wolf, Quantum Computing: Lecture Notes (arXiv:1907.09415v6, 2026) (standard reference, not scraped)
- John Preskill, Quantum Information, Chapter 6: Quantum Algorithms (updated November 2020) (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (17 April 2025) (standard reference, not scraped)