Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Statistics

Quantum geometric-entropic optimization for customer lifetime value prediction: convergence theory and an empirical study on transactional retail data

Массимилиано Феррара, Laura Sáez‐Ortuño, Santiago Forgas‐Coll, Jorge Fabila, Carlos Martín-Isla, Karim Lekadir

Published May 11, 2026• 1 citation
Publisher

Abstract

Predicting customer churn from transactional data is a central problem in management science, with direct implications for retention strategy, revenue forecasting, and resource allocation. This paper introduces Quantum Geometric-Entropic Optimization (Q-GEO), a framework that integrates Geometric-Entropic Optimization – combining Riemannian gradient methods with entropy-regularized optimal transport – into the training of variational quantum kernels for classification. The algorithm operates on a parameter manifold equipped with a Fisher-Wasserstein metric and incorporates Sinkhorn-type projections to enforce distributional coherence on the quantum feature space. We establish three theoretical contributions: (i) a convergence theorem for Q-GEO-trained variational quantum kernels under a combined Polyak–Łojasiewicz and Sinkhorn contraction framework, yielding linear convergence in the Riemannian condition number plus geometric contraction of the Sinkhorn residual; (ii) a margin amplification result showing that GEO-trained quantum embeddings achieve improved separation bounds over Euclidean-trained counterparts due to the spectral regularization provided by the Wasserstein component of the Fisher-Wasserstein metric; and (iii) a distributional stability result proving that Sinkhorn-projected quantum kernel matrices preserve a doubly stochastic spectral structure that mitigates kernel collapse in imbalanced settings. We validate the framework on the UCI Online Retail II dataset (N=5,942 customers, d=11 RFM-extended features, churn rate ≈37%), a publicly available transactional benchmark. Under nested cross-validation, Q-GEO achieves 0.8614 accuracy, 0.8103 precision, 0.7891 recall, 0.7996 F1, and 0.9047 ROC AUC, outperforming both classical baselines (including logistic regression, random forest, XGBoost, and CatBoost) and standard variational quantum kernel methods. We complement the accuracy analysis with SHAP-based explainability, computation time comparisons, and a detailed feature engineering appendix to support interpretability and reproducibility. We interpret these results as evidence that geometric optimization principles can materially enhance quantum machine learning for management science applications.

DOI
10.1080/02331888.2026.2667471

Related papers

Quantum kernel methods for marketing analytics with convergence theory and separation bounds

Laura Sáez‐Ortuño, Santiago Forgas‐Coll, Массимилиано Феррара

This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime. We present a hybrid pipeline that combines a quantum-kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE), and benchmark it against classical and quantum baselines in simulation (hardware validation remains future work). Hyperparameters were selected via nested cross-validation on the training partition and then fixed for test evaluation; under these settings, the proposed Q-SVM attains 0.7790 accuracy, 0.7647 precision, 0.8609 recall, 0.8100 F1, and 0.83 ROC AUC, exhibiting higher sensitivity while maintaining competitive precision relative to classical SVM. All headline metrics are obtained via high-fidelity simulation. We interpret these results as an initial indicator and a concrete starting point for NISQ-era workflows and hardware integration, rather than a definitive benchmark. Methodologically, our design aligns with recent work that formalizes quantum–classical separations and verifies resources via XEB-style (Cross-Entropy Benchmarking) approaches, motivating shallow yet expressive quantum embeddings to achieve robust separability despite hardware noise constraints.

arXiv:2510.11744•Scientific Reports•Jan 25, 2026•6 citations

A Geometric Analysis of Quantum-Inspired LocalTensor Regression: Formal Proofs of Convergence and Tractability

Nihal Shetty, Ashil Shetty, B Karthik Udupa

Abstract We present a rigorous mathematical analysis of the Quantum-Inspired Local Tensor Regression (QILTR) framework for modeling non-stationary, multi-linear systems. QILTR's central hypothesis is that weighting local regression problems by the Bures distance—a metric derived from the Quantum Fisher Information (QFI)—improves optimization properties. We formalize this by recasting QILTR as a Riemannian optimization problem on the manifold of quantum states, establishing that the QILTR update approximates a natural gradient descent step measured by the QFI metric. Under local geodesic convexity, we derive a formal convergence rate and demonstrate that QFI-based weighting produces a better-conditioned local Hessian matrix compared to standard Euclidean kernels. We analyze low-rank tensor estimation via weighted Alternating Least Squares (ALS), establishing the regularizing properties of quantum-geometric weights in this non-convex setting, and prove computational tractability with polynomial-time complexity per centroid under dual constraints of low-dimensional quantum encoding and low-rank coefficient tensors. Comprehensive empirical validation on synthetic datasets (150 trials, five scenarios) and real-world quantum chemistry data (QM9, ten trials) confirms that the bounded hyperbolic tangent scaling function prevents outlier amplification, yielding a 4.9× improvement. We transparently report that theoretical convergence rate advantages are not empirically observable, as both QILTR and Euclidean-LTR converge rapidly. Practical benefits manifest as improved solution quality (+1.22% on QM9). By grounding QILTR in information geometry with empirical rigor, we position it as a geometrically optimized and computationally viable scientific machine learning tool with validated design principles and realistic expectations.

•Nov 4, 2025•0 citations

Quantum-Inspired Geometric Classification with Correlation Group Structures and VQC Decision Modeling

Nishikanta Mohanty, Arya Ansuman Priyadarshi, Bikash K. Behera +1 more

We propose a geometry-driven quantum-inspired classification framework that integrates Correlation Group Structures (CGR), compact SWAP-test-based overlap estimation, and selective variational quantum decision modelling. Rather than directly approximating class posteriors, the method adopts a geometry-first paradigm in which samples are evaluated relative to class medoids using overlap-derived Euclidean-like and angular similarity channels. CGR organizes features into anchor-centered correlation neighbourhoods, generating nonlinear, correlation-weighted representations that enhance robustness in heterogeneous tabular spaces. These geometric signals are fused through a non-probabilistic margin-based fusion score, serving as a lightweight and data-efficient primary classifier for small-to-moderate datasets. On Heart Disease, Breast Cancer, and Wine Quality datasets, the fusion-score classifier achieves 0.8478, 0.8881, and 0.9556 test accuracy respectively, with macro-F1 scores of 0.8463, 0.8703, and 0.9522, demonstrating competitive and stable performance relative to classical baselines. For large-scale and highly imbalanced regimes, we construct compact Delta-distance contrastive features and train a variational quantum classifier (VQC) as a nonlinear refinement layer. On the Credit Card Fraud dataset (0.17% prevalence), the Delta + VQC pipeline achieves approximately 0.85 minority recall at an alert rate of approximately 1.31%, with ROC-AUC 0.9249 and PR-AUC 0.3251 under full-dataset evaluation. These results highlight the importance of operating-point-aware assessment in rare-event detection and demonstrate that the proposed hybrid geometric-variational framework provides interpretable, scalable, and regime-adaptive classification across heterogeneous data settings.

quant-pharXiv:2604.01930•Apr 3, 2026•0 citations

Quantum-Inspired Variational Inference for Non-Convex Stochastic Optimization: A Unified Mathematical Framework with Convergence Guarantees and Applications to Machine Learning in Communication Networks

Abrar S. Alhazmi

Non-convex stochastic optimization presents fundamental mathematical challenges across machine learning, wireless networks, data center resource allocation, and optical wireless communication systems, where complex loss landscapes with multiple local minima and saddle points impede classical variational inference methods. This paper introduces the Quantum-Inspired Variational Inference (QIVI) framework, which systematically integrates quantum mechanical principles (superposition, entanglement, and measurement operators) into classical variational inference through rigorous mathematical formulations grounded in Hilbert space theory and operator algebras. We develop a unified optimization framework that encodes classical parameters as quantum-inspired states within finite-dimensional complex Hilbert spaces, employing unitary evolution operators and adaptive basis selection governed by gradient covariance eigendecomposition. The core mathematical contribution establishes that QIVI achieves a convergence rate of O(log2T/T1/2) for σ-strongly non-convex functions, provably improving upon the classical O(T−1/4) rate, yielding a theoretical speedup factor of 1.85–1.96×. Comprehensive experiments across synthetic benchmarks, Bayesian neural networks, and real-world applications in network optimization and financial portfolio management demonstrate 23–47% faster convergence, 15–35% superior objective values, and 28–46% improved uncertainty calibration. The principal contributions include: (i) a rigorous Hilbert space-based mathematical framework for quantum-inspired variational inference grounded in operator algebras, (ii) a novel hybrid quantum–classical algorithm (QIVI) with adaptive basis selection via gradient covariance eigendecomposition, (iii) formal convergence proofs establishing provable improvement over classical methods, (iv) comprehensive empirical validation across diverse problem domains relevant to machine learning and network optimization, and (v) demonstration of the framework’s applicability to optimization problems arising in wireless networks, data center resource allocation, and network system design. Statistical validation using the Friedman test (χ2=847.3, p<0.001) and post hoc Wilcoxon signed-rank tests with Holm–Bonferroni correction confirm that QIVI’s improvements over all baseline methods are statistically significant at the α=0.05 level across all benchmark categories. The framework discovers 18.1 out of 20 true modes in multimodal distributions versus 9.1 for classical methods, demonstrating the potential of quantum-inspired optimization approaches for challenging stochastic problems arising in machine learning, wireless communication, and network optimization.

Mathematics•Apr 7, 2026•1 citation

Fidelity-Based Quantum Kernels for Hybrid Financial Fraud Detection Pipelines

Fathima Nihla Latheef, Jismina T A, Rubell Marion Lincy G

Financial fraud detection remains difficult due to extreme class imbalance and subtle, nonlinear patterns in transactional data. We investigate a hybrid quantum–classical approach that couples a fidelity-based quantum kernel with a logistic regression classifier (QEKLR). A custom ZZ-inspired feature map comprising Hadamards, mixed-axis Ry/Rzencodings, tunable Ising-ZZ cross terms, and data re-uploading, embeds PCA-reduced, Min–Max scaled features into quantum states. The resulting fidelity kernel is evaluated and used within kernel logistic regression. Experiments on two benchmarks: BankSim (synthetic) and the European Credit Card Fraud dataset, use balanced subsets created via Random Under-Sampling. The proposed model attains the best performance on BankSim (AUC = 0.96; strongest F1), and is competitive on the credit-card dataset (AUC = 0.94), closely tracking XGBoost (AUC = 0.96) while outperforming logistic regression and a variational quantum classifier baseline. These results indicate that quantum kernel methods can provide practical gains on tabular fraud tasks while remaining aligned with current NISQ constraints. We also discuss the quadratic cost of exact kernel evaluation and outline scalable approximations for future deployment on larger, highly imbalanced datasets.

IEEE International Conference on Emerging Computing and Intelligent Technologies (ICoECIT)•Jan 28, 2026•0 citations

Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

Qingyu Meng, Yangshuai Wang

Quantum neural networks (QNNs) have attracted growing interest for scientific machine learning, yet in regression settings they often suffer from limited trainability under noisy gradients and ill-conditioned optimization. We propose a hybrid quantum--classical regression framework designed to mitigate these bottlenecks. Our model prepends a lightweight classical embedding that acts as a learnable geometric preconditioner, reshaping the input representation to better condition a downstream variational quantum circuit. Building on this architecture, we introduce a curriculum optimization protocol that progressively increases circuit depth and transitions from SPSA-based stochastic exploration to Adam-based gradient fine-tuning. We evaluate the approach on PDE-informed regression benchmarks and standard regression datasets under a fixed training budget in a simulator setting. Empirically, the proposed framework consistently improves over pure QNN baselines and yields more stable convergence in data-limited regimes. We further observe reduced structured errors that are visually correlated with oscillatory components on several scientific benchmarks, suggesting that geometric preconditioning combined with curriculum training is a practical approach for stabilizing quantum regression.

cs.LGCross-listedarXiv:2601.11942•Jan 20, 2026•2 citations
Predicting customer churn from transactional data is a central problem in management science, with direct implications for retention strategy, revenue forecasting, and resource allocation. This paper introduces Quantum Geometric-Entropic Optimization (Q-GEO), a framework that integrates Geometric-Entropic Optimization – combining Riemannian gradient methods with entropy-regularized optimal transport – into the training of variational quantum kernels for classification. The algorithm operates on a parameter manifold equipped with a Fisher-Wasserstein metric and incorporates Sinkhorn-type projections to enforce distributional coherence on the quantum feature space. We establish three theoretical contributions: (i) a convergence theorem for Q-GEO-trained variational quantum kernels under a combined Polyak–Łojasiewicz and Sinkhorn contraction framework, yielding linear convergence in the Riemannian condition number plus geometric contraction of the Sinkhorn residual; (ii) a margin amplification result showing that GEO-trained quantum embeddings achieve improved separation bounds over Euclidean-trained counterparts due to the spectral regularization provided by the Wasserstein component of the Fisher-Wasserstein metric; and (iii) a distributional stability result proving that Sinkhorn-projected quantum kernel matrices preserve a doubly stochastic spectral structure that mitigates kernel collapse in imbalanced settings. We validate the framework on the UCI Online Retail II dataset (N=5,942 customers, d=11 RFM-extended features, churn rate ≈37%), a publicly available transactional benchmark. Under nested cross-validation, Q-GEO achieves 0.8614 accuracy, 0.8103 precision, 0.7891 recall, 0.7996 F1, and 0.9047 ROC AUC, outperforming both classical baselines (including logistic regression, random forest, XGBoost, and CatBoost) and standard variational quantum kernel methods. We complement the accuracy analysis with SHAP-based explainability, computation time comparisons, and a detailed feature engineering appendix to support interpretability and reproducibility. We interpret these results as evidence that geometric optimization principles can materially enhance quantum machine learning for management science applications.
This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime. We present a hybrid pipeline that combines a quantum-kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE), and benchmark it against classical and quantum baselines in simulation (hardware validation remains future work). Hyperparameters were selected via nested cross-validation on the training partition and then fixed for test evaluation; under these settings, the proposed Q-SVM attains 0.7790 accuracy, 0.7647 precision, 0.8609 recall, 0.8100 F1, and 0.83 ROC AUC, exhibiting higher sensitivity while maintaining competitive precision relative to classical SVM. All headline metrics are obtained via high-fidelity simulation. We interpret these results as an initial indicator and a concrete starting point for NISQ-era workflows and hardware integration, rather than a definitive benchmark. Methodologically, our design aligns with recent work that formalizes quantum–classical separations and verifies resources via XEB-style (Cross-Entropy Benchmarking) approaches, motivating shallow yet expressive quantum embeddings to achieve robust separability despite hardware noise constraints.
Abstract We present a rigorous mathematical analysis of the Quantum-Inspired Local Tensor Regression (QILTR) framework for modeling non-stationary, multi-linear systems. QILTR's central hypothesis is that weighting local regression problems by the Bures distance—a metric derived from the Quantum Fisher Information (QFI)—improves optimization properties. We formalize this by recasting QILTR as a Riemannian optimization problem on the manifold of quantum states, establishing that the QILTR update approximates a natural gradient descent step measured by the QFI metric. Under local geodesic convexity, we derive a formal convergence rate and demonstrate that QFI-based weighting produces a better-conditioned local Hessian matrix compared to standard Euclidean kernels. We analyze low-rank tensor estimation via weighted Alternating Least Squares (ALS), establishing the regularizing properties of quantum-geometric weights in this non-convex setting, and prove computational tractability with polynomial-time complexity per centroid under dual constraints of low-dimensional quantum encoding and low-rank coefficient tensors. Comprehensive empirical validation on synthetic datasets (150 trials, five scenarios) and real-world quantum chemistry data (QM9, ten trials) confirms that the bounded hyperbolic tangent scaling function prevents outlier amplification, yielding a 4.9× improvement. We transparently report that theoretical convergence rate advantages are not empirically observable, as both QILTR and Euclidean-LTR converge rapidly. Practical benefits manifest as improved solution quality (+1.22% on QM9). By grounding QILTR in information geometry with empirical rigor, we position it as a geometrically optimized and computationally viable scientific machine learning tool with validated design principles and realistic expectations.
We propose a geometry-driven quantum-inspired classification framework that integrates Correlation Group Structures (CGR), compact SWAP-test-based overlap estimation, and selective variational quantum decision modelling. Rather than directly approximating class posteriors, the method adopts a geometry-first paradigm in which samples are evaluated relative to class medoids using overlap-derived Euclidean-like and angular similarity channels. CGR organizes features into anchor-centered correlation neighbourhoods, generating nonlinear, correlation-weighted representations that enhance robustness in heterogeneous tabular spaces. These geometric signals are fused through a non-probabilistic margin-based fusion score, serving as a lightweight and data-efficient primary classifier for small-to-moderate datasets. On Heart Disease, Breast Cancer, and Wine Quality datasets, the fusion-score classifier achieves 0.8478, 0.8881, and 0.9556 test accuracy respectively, with macro-F1 scores of 0.8463, 0.8703, and 0.9522, demonstrating competitive and stable performance relative to classical baselines. For large-scale and highly imbalanced regimes, we construct compact Delta-distance contrastive features and train a variational quantum classifier (VQC) as a nonlinear refinement layer. On the Credit Card Fraud dataset (0.17% prevalence), the Delta + VQC pipeline achieves approximately 0.85 minority recall at an alert rate of approximately 1.31%, with ROC-AUC 0.9249 and PR-AUC 0.3251 under full-dataset evaluation. These results highlight the importance of operating-point-aware assessment in rare-event detection and demonstrate that the proposed hybrid geometric-variational framework provides interpretable, scalable, and regime-adaptive classification across heterogeneous data settings.
Non-convex stochastic optimization presents fundamental mathematical challenges across machine learning, wireless networks, data center resource allocation, and optical wireless communication systems, where complex loss landscapes with multiple local minima and saddle points impede classical variational inference methods. This paper introduces the Quantum-Inspired Variational Inference (QIVI) framework, which systematically integrates quantum mechanical principles (superposition, entanglement, and measurement operators) into classical variational inference through rigorous mathematical formulations grounded in Hilbert space theory and operator algebras. We develop a unified optimization framework that encodes classical parameters as quantum-inspired states within finite-dimensional complex Hilbert spaces, employing unitary evolution operators and adaptive basis selection governed by gradient covariance eigendecomposition. The core mathematical contribution establishes that QIVI achieves a convergence rate of O(log2T/T1/2) for σ-strongly non-convex functions, provably improving upon the classical O(T−1/4) rate, yielding a theoretical speedup factor of 1.85–1.96×. Comprehensive experiments across synthetic benchmarks, Bayesian neural networks, and real-world applications in network optimization and financial portfolio management demonstrate 23–47% faster convergence, 15–35% superior objective values, and 28–46% improved uncertainty calibration. The principal contributions include: (i) a rigorous Hilbert space-based mathematical framework for quantum-inspired variational inference grounded in operator algebras, (ii) a novel hybrid quantum–classical algorithm (QIVI) with adaptive basis selection via gradient covariance eigendecomposition, (iii) formal convergence proofs establishing provable improvement over classical methods, (iv) comprehensive empirical validation across diverse problem domains relevant to machine learning and network optimization, and (v) demonstration of the framework’s applicability to optimization problems arising in wireless networks, data center resource allocation, and network system design. Statistical validation using the Friedman test (χ2=847.3, p<0.001) and post hoc Wilcoxon signed-rank tests with Holm–Bonferroni correction confirm that QIVI’s improvements over all baseline methods are statistically significant at the α=0.05 level across all benchmark categories. The framework discovers 18.1 out of 20 true modes in multimodal distributions versus 9.1 for classical methods, demonstrating the potential of quantum-inspired optimization approaches for challenging stochastic problems arising in machine learning, wireless communication, and network optimization.
Financial fraud detection remains difficult due to extreme class imbalance and subtle, nonlinear patterns in transactional data. We investigate a hybrid quantum–classical approach that couples a fidelity-based quantum kernel with a logistic regression classifier (QEKLR). A custom ZZ-inspired feature map comprising Hadamards, mixed-axis Ry/Rzencodings, tunable Ising-ZZ cross terms, and data re-uploading, embeds PCA-reduced, Min–Max scaled features into quantum states. The resulting fidelity kernel is evaluated and used within kernel logistic regression. Experiments on two benchmarks: BankSim (synthetic) and the European Credit Card Fraud dataset, use balanced subsets created via Random Under-Sampling. The proposed model attains the best performance on BankSim (AUC = 0.96; strongest F1), and is competitive on the credit-card dataset (AUC = 0.94), closely tracking XGBoost (AUC = 0.96) while outperforming logistic regression and a variational quantum classifier baseline. These results indicate that quantum kernel methods can provide practical gains on tabular fraud tasks while remaining aligned with current NISQ constraints. We also discuss the quadratic cost of exact kernel evaluation and outline scalable approximations for future deployment on larger, highly imbalanced datasets.
Quantum neural networks (QNNs) have attracted growing interest for scientific machine learning, yet in regression settings they often suffer from limited trainability under noisy gradients and ill-conditioned optimization. We propose a hybrid quantum--classical regression framework designed to mitigate these bottlenecks. Our model prepends a lightweight classical embedding that acts as a learnable geometric preconditioner, reshaping the input representation to better condition a downstream variational quantum circuit. Building on this architecture, we introduce a curriculum optimization protocol that progressively increases circuit depth and transitions from SPSA-based stochastic exploration to Adam-based gradient fine-tuning. We evaluate the approach on PDE-informed regression benchmarks and standard regression datasets under a fixed training budget in a simulator setting. Empirically, the proposed framework consistently improves over pure QNN baselines and yields more stable convergence in data-limited regimes. We further observe reduced structured errors that are visually correlated with oscillatory components on several scientific benchmarks, suggesting that geometric preconditioning combined with curriculum training is a practical approach for stabilizing quantum regression.