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 , define the maximally entangled reference vector on two ordered -dimensional registers. The access contract supplies a finite preparation unitary , its inverse, width/ancillas, input encoding, and costs , satisfying exactly in the declared encoding. Its action on other inputs is any supplied unitary completion; the inverse is that of the complete unitary. When , a concrete preparation applies to each of the first-register qubits and then CNOT from each first-register qubit to its matching second-register qubit, using exactly Hadamards and CNOTs on wires. For other , 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.
Finite registers and their ordered computational bases: basis labels determine the ordered register states.
The computational basis is orthonormal: the computational basis is orthonormal.
Denotational semantics of a finite layered circuit: Hadamard and CNOT layers denote their finite unitary products.
Verification
Applying to gives by the one-qubit formula and tensor expansion. The subsequent CNOT layer maps each basis vector to , so the output is exactly when .
The construction in step 1.1 has one Hadamard and one CNOT for each of bit positions and acts on the two declared -qubit registers. For non-power-of-two , the separately supplied contract is the entire preparation claim, and its cost is retained as .
Depends on
Used by
- Sparse-oracle Gibbs-state purification Algorithm
- Sparse-oracle quantum SDP algorithm Algorithm
- Coherent spectral minimum and a frozen Gibbs energy shift Lemma
- Flagged trace ratio returns a Gibbs-state observable mean Lemma
- Quantum SDP query bound and QRAM cost boundary Theorem
- Sparse evolution substitution gives the quantum SDP and diagonal LP query bounds Theorem
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
- https://arxiv.org/pdf/1705.01843v4 (standard reference, not scraped)