Alphabeta MathHow 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.
QMA completeness under promise-preserving reductions
Definition
A promise problem is QMA-hard if every problem in QMA reduces to it by a deterministic polynomial-time many-one promise-preserving reduction. It is QMA-complete if it is QMA-hard and itself belongs to QMA. “Promise-preserving reduction” has the meaning of Promise preserving reduction; no behavior is required off the source promise.
Depends on
Used by
Dependency tree · two levels
5 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
- John Watrous, Quantum Computational Complexity (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)