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.
Input and output penalties on history states
Statement
Let and let be the history of an arbitrary normalized initial computation state for Feynman–Kitaev history Hamiltonian. Let be the number of initially clean ancilla bits equal to one, let be the probability that the ancilla register is not all zero, and let be the verifier rejection probability at time . Then Moreover, the squared norm removed by orthogonally projecting onto is exactly : the input constraint removes the entire dirty-ancilla component at clock time zero, and the output constraint removes the reject component at clock time . In particular, a clean-ancilla history with acceptance at least has zero input energy and output energy at most .
Facts & Assumptions
Given: The normalized history, the clean-ancilla input subspace, and the one-bit accept output convention.
Feynman–Kitaev history Hamiltonian: the history has equal squared clock amplitude , checks dirty ancillas only at time zero, and has coefficient at time .
QMA promise class with a verifier effect on witnesses: verifier acceptance and rejection are complementary terminal measurement probabilities.
Proof
Expand the history in the orthogonal legal clock basis. In the projector is one exactly on and zero on for . At , the sum of ancilla projectors has expectation in ; since on the dirty subspace, this expectation is at least . The history clock weight is , proving the input identity and inequality.
The output projector is one only on legal clock word . The history weight there is ; multiplying by the explicit coefficient cancels it. The remaining computation state is , whose reject-bit probability is by [F2]. Thus the output identity holds. The kernel of imposes a zero-ancilla projector only at clock and the accept projector only at clock ; these clock sectors are orthogonal, so the removed squared norm is . For a clean ancilla and every input penalty vanishes; acceptance at least gives .
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
- Dorit Aharonov and Tomer Naveh, Quantum NP: A Survey (standard reference, not scraped)
- Julia Kempe, Alexei Kitaev, and Oded Regev, The Complexity of the Local Hamiltonian Problem (standard reference, not scraped)