arXiv (All)
open access
Conditioning-Free Non-Uniform Quantum Fourier and Chebyshev Transforms
We present an efficient quantum algorithm for the non-uniform Chebyshev transform. It is defined as the projection of a function onto Chebyshev polynomials sampled at given nodes that are uniform in $x\in[-1,1]$, and hence non-uniform in the angle $θ=\arccos x$, a setting that QFT-based quantum Cheb
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Random Quantum Circuits Beyond Moment Matching#1157483
- Quantum Quasi-Monte Carlo: a window for pre-asymptotic quantum advantage#926527
- Learning Random Quantum Circuits and the Emergence of Pseudorandomness#1144988
- Non-Kolmogorovian Probabilities and Quantum Technologies#723037
- A discussion on the origin of quantum probabilities#72579
Record · ID 1154538
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive