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.
Qubitization access model
Definition
Let be a finite-dimensional complex inner-product space, let on , and let satisfy . Put . Let be a unitary on an ancilla-system space , let be the isometry , and let . An exact Hermitian block encoding is the data with . The matrix is Hermitian; itself need not be Hermitian.
The signal-register reflection is . The access record lists, separately, each supplied call to , , controlled-, controlled-, and , together with their circuit, query, gate, width, ancilla, precision, and classical-generation costs from Block-encoding oracle and implementation cost model and Circuit-family and computation cost model. A state description or block matrix alone supplies none of these calls. A controlled reflection is also separate. Any PREPARE, SELECT, sparse-location, value, or coefficient operation used by a construction is a separately supplied, reversible interface with its inverse and cost recorded.
Here is the standard-form qubiterate for this access instance. Add a flag qubit and define , , , , and . Implementing requires the separately declared controlled- and controlled- calls; , the preparation of , and the reflection about also have declared costs. Qubitization lifts scalar QSP ↗ proves its compressed block and spectral relation.
For the QSVT simulation sequence, the signal operations are the alternating calls interleaved with the projector phases from QSP signal matrix and ordered phase sequence. Their exact phase list, parity, real-polynomial extraction, controls, inverse calls, and phase-synthesis precision are part of the supplied circuit description. The scalar polynomial pairs must satisfy Admissible polynomial pair for Hermitian-reflection QSP; singular-value transformations use the convention of Odd and even singular-value transforms.
Depends on
- Finite block encoding
- Block-encoding oracle and implementation cost model
- QSP signal matrix and ordered phase sequence
- Admissible polynomial pair for Hermitian-reflection QSP
- Odd and even singular-value transforms
- Controlled Unitary Access
- Inverse Unitary Access
- Orthogonal-Projector Reflection and Access Contract
- Circuit-family and computation cost model
- Full-list uniform quantum circuit family
Used by
- Finite CKS sparse QLSP with variable-time inverse estimation Algorithm
- Qubitized Hamiltonian simulator Algorithm
- Small-time-aware qubitized simulator Algorithm
- Sparse Hermitian block encoding Algorithm
- Hamiltonian-simulation polynomial target Definition
- Hermitian block-encoding signal subspaces Lemma
- Correctness and access cost of sparse block encoding Theorem
- Correctness of the small-time-aware simulator Theorem
- Qubitization lifts scalar QSP Theorem
- Qubitization query and gate resources Theorem
- Qubitized simulation correctness Theorem
Dependency tree · two levels
42 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, Chapter 29 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 9 (standard reference, not scraped)
- Guang Hao Low and Isaac L. Chuang, Hamiltonian Simulation by Qubitization (standard reference, not scraped)
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond (standard reference, not scraped)