Explainable quantum regression algorithm with encoded data structure
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908973537427456 |
|---|---|
| author | Wang, C. -C. Joseph Perkkola, F. Salmenperä, I. de Griend, A. Meijer-van Nurminen, J. K. |
| author_facet | Wang, C. -C. Joseph Perkkola, F. Salmenperä, I. de Griend, A. Meijer-van Nurminen, J. K. |
| contents | 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(σ^{2}(\mathcal{C}) \ln (1/α)/ε^{2}\right)$ under the error budget $ε$ and confidence tolerance $α$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_15666 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Explainable quantum regression algorithm with encoded data structure Wang, C. -C. Joseph Perkkola, F. Salmenperä, I. de Griend, A. Meijer-van Nurminen, J. K. Quantum Physics 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(σ^{2}(\mathcal{C}) \ln (1/α)/ε^{2}\right)$ under the error budget $ε$ and confidence tolerance $α$. |
| title | Explainable quantum regression algorithm with encoded data structure |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.15666 |