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.
Hamiltonian simulation error and resources
Definition
Let be a finite-dimensional complex inner-product space and let be a specified endomorphism. Its exact time- evolution is as defined by Finite Hermitian matrix dynamics. The notation denotes the operator norm of The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||. The target register's Hilbert space is identified with as part of the input. A Hamiltonian simulator at encoded time and tolerance is a declared procedure whose output is a unitary on the stated target register satisfying . If its circuit uses auxiliary registers, the exact clean or dirty contract of Clean and dirty ancillas must make the induced target unitary well-defined; the error is measured on that target unitary. The scalar time and tolerance have exact finite descriptions under the declared input convention; their description lengths are recorded.
The resource record lists, separately, the number of calls to each named oracle, controlled calls, inverse calls, elementary gate occurrences, clean and dirty ancillary wires, coefficient bits, full circuit-description bits, and classical generation time. A coordinate not supplied by the access contract is unavailable, not zero. No matrix description supplies a circuit, oracle, controlled call, inverse call, or term exponential for free; uniform-family and cost conventions are those of Full-list uniform quantum circuit family, Circuit-family and computation cost model, Controlled Unitary Access, and Inverse Unitary Access. No polynomial resource bound is asserted by this definition.
Depends on
Used by
- Adiabatic path access and resource model Definition
- Eigenvalue-estimation access and aliasing convention Definition
- HHL state-preparation and simulation access model Definition
- LCU decomposition and access model Definition
- Sparse Hamiltonian row and value oracles Definition
- Term-list Hamiltonian access Definition
- HHL cost under direct controlled-simulation access Theorem
- HHL sparse-query and state-preparation cost Theorem
- Segmented Taylor error and resources Theorem
Dependency tree · two levels
29 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)