Skip to content
DraconiticResearch
Search Sources API
197,688 studies31 sourcesUpdated 8 min ago
PreprintarXiv licencearXiv

Representation Learning with Quantum Signal Processing

Abstract

Representation learning begins when training changes the features that define similarity between data. A frozen-kernel model only reweights a fixed geometry. We establish quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime. At arbitrary depth, we compute the exact mean and variance of its quantum neural tangent kernel, revealing an input-dependent angular geometry whose diagonal remains non-self-averaging even when the underlying unitary approaches Haar randomness. We also prove a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel: the realized dynamics converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. A finite-depth speed limit holds for every data set and trajectory. At higher data density, numerical results show coupled evolution beyond both the scalar and frozen-kernel descriptions. These results give a controlled theory of learned quantum data geometry with provable training dynamics beyond the frozen limit.

Related

  1. Particle-Number-Preserving Quantum Signal Processing for Thermal Properties: Canonical-Ensemble Estimation and Grand-Canonical Reconstruction
    Taehee Ko, Sungbin Lim, Sangkook Choi
  2. Constrained minimax approximation for quantum signal processing
    Yulong Dong, James B. Larsen, Lin Lin +1
  3. Directional Statistics in Signal Processing: A Geometry Driven Overview of Models, Learning, and Applications
    Anders S. Olsen, Kanti V. Mardia, Dimitri Van De Ville +1
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  4. From Common Information to Canonical Correlation Analysis and Beyond: Bridging Information Theory, Signal Processing, and Machine Learning
    Paris A. Karakasis, Walid Saad
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Signal Processing over Product DAGs: Causal Shifts and Filters
    Sundeep Prabhakar Chepuri, Antonio G. Marques, Maulik Devmurari +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{wang2026representation,
  title = {{Representation Learning with Quantum Signal Processing}},
  author = {Junqi Wang and Junyu Liu},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.28828},
  eprint = {2608.28828},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.28828},
}
RIS
TY  - UNPB
TI  - Representation Learning with Quantum Signal Processing
AU  - Junqi Wang
AU  - Junyu Liu
PY  - 2026
DA  - 2026/08/28
PB  - arXiv
DO  - 10.48550/arxiv.2608.28828
UR  - https://arxiv.org/abs/2608.28828
AB  - Representation learning begins when training changes the features that define similarity between data. A frozen-kernel model only reweights a fixed geometry. We establish quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime. At arbitrary depth, we compute the exact mean and variance of its quantum neural tangent kernel, revealing an input-dependent angular geometry whose diagonal remains non-self-averaging even when the underlying unitary approaches Haar randomness. We also prove a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel: the realized dynamics converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. A finite-depth speed limit holds for every data set and trajectory. At higher data density, numerical results show coupled evolution beyond both the scalar and frozen-kernel descriptions. These results give a controlled theory of learned quantum data geometry with provable training dynamics beyond the frozen limit.
ER  -