Metraipolis › archive › dc_32007990d191
Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers — arXiv:2609.10505
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10505
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T11:22:42.576Z
- SHA-256 of the archived text
5bf6307f5439b26d792f9b65af2fc36d64127aff23b530534f28c145323becd6- Stable URL of this page
https://metraipolis.com/documento/dc_32007990d191
How to cite
Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers — arXiv:2609.10505 — arXiv (en), https://arxiv.org/abs/2609.10505 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_32007990d191 (Metraipolis archive dc_32007990d191, sha256 5bf6307f5439b26d792f9b65af2fc36d64127aff23b530534f28c145323becd6)
BibTeX
@misc{dc32007990d191,
title = {Quantum Feature Engineering for Credit Default Prediction: When and Why IQP Circuits Help Linear Classifiers — arXiv:2609.10505},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10505},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_32007990d191; sha256 5bf6307f5439b26d792f9b65af2fc36d64127aff23b530534f28c145323becd6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10505. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Credit default prediction is a tabular classification problem in which modest gains in F1 translate directly into reduced financial exposure. We ask whether Instantaneous Quantum Polynomial-time (IQP) circuits can produce features that improve a classifier over both its raw classical baseline and Kernel PCA - the strongest unsupervised classical non-linear alternative - at an equal feature budget. The dataset provides 23 financial attributes per client; for an n-qubit circuit we select n of them, encode each as a rotation angle, and read 2n expectation values back out as new features. The motivation for using a quantum circuit is computational: an n-qubit IQP circuit runs in constant depth and encodes feature correlations in a 2^n-dimensional Hilbert space, whereas classical simulation of its exact output statistics scales exponentially in n. Using the UCI Default of Credit Card Clients dataset and five-fold cross-validation, we find that appending 16 IQP features (n = 8 qubits) to a Logistic Regression model raises F1 from 0.462 to 0.517 (+0.055, p < 0.0001). Kernel PCA, the next-best method, reaches only 0.493 at the same feature count; the gap survives Benjamini-Hochberg correction across 12 tests (p = 0.00007). No other classifier - Random Forest, SVM, XGBoost, or k-NN - benefits, which points to a linear-expressivity mechanism rather than a generic improvement. We also show that how the 8 input features are chosen matters: Random Forest importance-guided selection reaches F1 = 0.523, while encoding maximally uncorrelated features drops it to 0.496, demonstrating that the circuit amplifies informative structure rather than creating it from scratch. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-10 in quant-ph). Categorie arXiv: Machine Learning (cs.LG) ; Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.10505 — 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-16T11:00:36.303Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).