Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations
Abstract
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 (2dβ1)-degree polynomial into m lower-degree factors, with m controlling the degree of parallelism. By varying m from $1$ to 2dβ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 πͺ(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.
Related
- Equivalence of Correlated Catalytic and Marginal Asymptotic Transformations in Quantum Resource Theories
- Nonlinear Canonical Transformations for Studying Spin-1/2 Hamiltonians
- Bicircular light tunable topological phases and nonlinear Hall responses in odd-parity magnets
- Magnetically and electrically tunable nonlinear Hall effect in Tt-symmetric antiferromagnets
- Nonlinear Photocurrent Spectroscopy and Polarization-Tunable Shift Current in the Layered Semiconductor CuScP2S6
BibTeX
@misc{yang2026resourcetunable,
title = {{Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations}},
author = {Chunlin Yang and Yuqi Li and Hongmei Yao and Zhaobing Fan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39295},
eprint = {2609.39295},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39295},
}
RIS
TY - UNPB
TI - Resource-Tunable Quantum Circuit Implementation of Nonlinear Element-Wise Transformations
AU - Chunlin Yang
AU - Yuqi Li
AU - Hongmei Yao
AU - Zhaobing Fan
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39295
UR - https://arxiv.org/abs/2609.39295
AB - 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 πͺ(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.
ER -