Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research introduces a novel quantum regression algorithm that resolves the "black box" nature of variational methods by directly mapping quantum parameters to interpretable real-valued coefficients. By encoding classical data structures into the quantum state, the approach significantly reduces gate complexity and qubit resources while maintaining performance comparable to standard mean squared error metrics. This advancement is critical for deploying hybrid quantum-classical models in high-stakes domains requiring model transparency on noisy intermediate-scale quantum (NISQ) devices.
Surse care acoperăarXiv, LessWrong
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Explainable quantum regression algorithm with encoded data structure

arXiv3 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2604.15666v2 Announce Type: replace Abstract: Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers. However, variational quantum algorithms (derived from randomized hardware-efficient ansatz or adaptive ansatz) become a black box, not trustworthy for model interpretation, and not to mention for application deployment in informing critical decisions. In this paper, we construct the first interpretable quantum regression algorithm, in which the quantum state exactly encodes the classical data table and the variational parameters correspond directly to the regression coefficients, which are real numbers by construction, providing a high degree of model interpretability and minimal cost to optimize due to the right expressiveness. We also exploit the encoded data structure to reduce the gate complexity of computing the regression map. To reduce circuit depth in nonlinear regression, our algorithm can be extended by directly constructing nonlinear features via classical preprocessing, such as independent encoded column vectors. By design, the model performance is determined by the cost function measurement results $\mathcal{C}$ synchronous to the mean squared errors (MSE) for the regression models. We derived the read-out errors induced by one-hot encoding and compact encoding; the required physical qubit resources are exponentially compressed for the compact encoding to be favorable for noisy quantum devices. We also derive the cost function dependent sample complexity $ \in \mathcal{O}\left(\sigma^{2}(\mathcal{C}) \ln (1/\alpha)/\epsilon^{2}\right)$ under the error budget $\epsilon$ and confidence tolerance $\alpha$.

Abstract:Hybrid variational quantum algorithms are promising for solving practical problems, such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers. However, variational quantum algorithms (derived from randomized hardware-efficient ansatz or adaptive ansatz) become a black box, not trustworthy for model interpretation, and not to mention for application deployment in informing critical decisions. In this paper, we construct the first interpretable quantum regression algorithm, in which the quantum state exactly encodes the classical data table and the variational parameters correspond directly to the regression coefficients, which are real numbers by construction, providing a high degree of model interpretability and minimal cost to optimize due to the right expressiveness. We also exploit the encoded data structure to reduce the gate complexity of computing the regression map. To reduce circuit depth in nonlinear regression, our algorithm can be extended by directly constructing nonlinear features via classical preprocessing, such as independent encoded column vectors. By design, the model performance is determined by the cost function measurement results $\mathcal{C}$ synchronous to the mean squared errors (MSE) for the regression models. We derived the read-out errors induced by one-hot encoding and compact encoding; the required physical qubit resources are exponentially compressed for the compact encoding to be favorable for noisy quantum devices. We also derive the cost function dependent sample complexity $ \in \mathcal{O}\left(\sigma^{2}(\mathcal{C}) \ln (1/\alpha)/\epsilon^{2}\right)$ under the error budget $\epsilon$ and confidence tolerance $\alpha$.

arXiv admin note: substantial text overlap with arXiv:2307.03334

arXiv:2604.15666 [quant-ph]

(or arXiv:2604.15666v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.15666 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 334 cuvinte

Subiecte conexe