Metraipolis › archive › dc_17b63d6095ce
Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations — arXiv:2609.39295
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39295
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:21:17.708Z
- SHA-256 of the archived text
5aa4e1b7058700532f7bd02cbcaed6fa8e1738173ceceda89659af4aa36c8a4e- Stable URL of this page
https://metraipolis.com/documento/dc_17b63d6095ce
How to cite
Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations — arXiv:2609.39295 — arXiv (en), https://arxiv.org/abs/2609.39295 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17b63d6095ce (Metraipolis archive dc_17b63d6095ce, sha256 5aa4e1b7058700532f7bd02cbcaed6fa8e1738173ceceda89659af4aa36c8a4e)
BibTeX
@misc{dc17b63d6095ce,
title = {Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations — arXiv:2609.39295},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39295},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17b63d6095ce; sha256 5aa4e1b7058700532f7bd02cbcaed6fa8e1738173ceceda89659af4aa36c8a4e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39295. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Nonlinear transformations are important in quantum machine learning and other quantum numerical applications, which can be reduced to the implementation of element-wise polynomials through polynomial approximation. Existing works establish the feasibility of transformations and improve query or auxiliary-space efficiency, but circuit depth remains linear in scale with degree. In this work, we develop a resource-tunable quantum framework that decomposes a $(2^d-1)$-degree polynomial into $m$ lower-degree factors, with $m$ controlling the degree of parallelism. By varying $m$ from $1$ to $2^d-1$, the framework provides a trade-off among query complexity, additional gate complexity, ancilla count, and normalization, ranging from a binary-tree implementation to a $\mathcal{O}(n+d)$-depth construction with highly parallel oracle queries that match the query lower bound. The effects of polynomial approximation and implementation errors are further analyzed. We demonstrate the framework for nonlinear activation functions such as sigmoid and tanh, as well as pixel-wise image transformations.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39295 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.674Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).