pith. sign in

arxiv: 2306.17026 · v1 · pith:IJHXTV2Cnew · submitted 2023-06-29 · 🪐 quant-ph · cond-mat.stat-mech

Quantum Chebyshev Transform: Mapping, Embedding, Learning and Sampling Distributions

classification 🪐 quant-ph cond-mat.stat-mech
keywords quantumchebyshevbasiscomputationaldistributionstransformcircuitembedding
0
0 comments X
read the original abstract

We develop a paradigm for building quantum models in the orthonormal space of Chebyshev polynomials. We show how to encode data into quantum states with amplitudes being Chebyshev polynomials with degree growing exponentially in the system size. Similar to the quantum Fourier transform which maps computational basis space into the phase (Fourier) basis, we describe the quantum circuit for the mapping between computational and Chebyshev spaces. We propose an embedding circuit for generating the orthonormal Chebyshev basis of exponential capacity, represented by a continuously-parameterized shallow isometry. This enables automatic quantum model differentiation, and opens a route to solving stochastic differential equations. We apply the developed paradigm to generative modeling from physically- and financially-motivated distributions, and use the quantum Chebyshev transform for efficient sampling of these distributions in extended computational basis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Fourier Generative Models Trainable at Large Scale

    quant-ph 2026-06 unverdicted novelty 7.0

    Quantum Fourier generative models are trained classically at over 1000-qubit scale using log-likelihood loss from Parseval's identity and deployed on superconducting hardware for fast sampling that preserves multi-mod...

  2. Theory and practice of Trotter product formulas for quantum chemistry

    quant-ph 2026-06 conditional novelty 6.0

    SPRINT and GRADE cut Toffoli cost 4.5x versus prior Trotter methods for Li4Mn2O X-ray spectrum simulation while using 5.5x fewer qubits than qubitization alternatives.

  3. Distributed Quantum Gaussian Processes for Multi-Agent Systems

    cs.MA 2026-02 unverdicted novelty 6.0

    A distributed quantum Gaussian process framework is introduced for multi-agent systems with a consensus Riemannian ADMM algorithm, evaluated on elevation datasets via quantum simulator.

  4. Problem-Specific Basis Quantum State Readout via Proper Orthogonal Decomposition

    quant-ph 2026-05 unverdicted novelty 5.0

    PODR precomputes a proper orthogonal decomposition basis from classical solutions to project quantum states onto a minimal set of coefficients for reconstruction, reducing measurements in online quantum simulations.

  5. Spectral methods: crucial for machine learning, natural for quantum computers?

    quant-ph 2026-03 unverdicted novelty 5.0

    Quantum computers may enable more natural manipulation of Fourier spectra in ML models via the Quantum Fourier Transform, potentially leading to resource-efficient spectral methods.