Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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 H be a finite-dimensional complex inner-product space, let K=K∗ on H, and let α>0 satisfy ∥K∥op≤α. Put A=K/α. Let U be a unitary on an ancilla-system space HA⊗H, let J:H→HA⊗H be the isometry Jv=∣0a⟩⊗v, and let Π=JJ∗. An exact Hermitian block encoding is the data (U,J,α) with J∗UJ=A. The matrix K is Hermitian; U itself need not be Hermitian.

The signal-register reflection is RΠ=2Π−I. The access record lists, separately, each supplied call to U, U∗, controlled-U, controlled-U∗, and RΠ, 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 U~=∣0⟩⟨0∣⊗U+∣1⟩⟨1∣⊗U∗, J′v=∣+⟩⊗Jv, S=X⊗I, F=SU~, and Wq=(2J′J′∗−I)F. Implementing U~ requires the separately declared controlled-U and controlled-U∗ calls; S, the preparation of ∣+⟩, and the reflection about ran⁡(J′) 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 U,U∗ calls interleaved with the projector phases eiϕ(2Π−I) 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

Used by

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