HQFS: Hybrid Quantum Classical Financial Security with VQC Forecasting, QUBO Annealing, and Audit-Ready Post-Quantum Signing

• URL: http://arxiv.org/abs/2602.16976v1
• Date: Thu, 19 Feb 2026 00:32:15 GMT
• Title: HQFS: Hybrid Quantum Classical Financial Security with VQC Forecasting, QUBO Annealing, and Audit-Ready Post-Quantum Signing
• Abstract summary: HQFS is a practical hybrid pipeline that connects forecasting, discrete risk optimization, and auditability in one flow.<n>On our market dataset study, HQFS reduces return prediction error by 7.8% and volatility prediction error by 6.1%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Here's the corrected paragraph with all punctuation and formatting issues fixed: Financial risk systems usually follow a two-step routine: a model predicts return or risk, and then an optimizer makes a decision such as a portfolio rebalance. In practice, this split can break under real constraints. The prediction model may look good, but the final decision can be unstable when the market shifts, when discrete constraints are added (lot sizes, caps), or when the optimization becomes slow for larger asset sets. Also, regulated settings need a clear audit trail that links each decision to the exact model state and inputs. We present HQFS, a practical hybrid pipeline that connects forecasting, discrete risk optimization, and auditability in one flow. First, HQFS learns next-step return and a volatility proxy using a variational quantum circuit (VQC) with a small classical head. Second, HQFS converts the risk-return objective and constraints into a QUBO and solves it with quantum annealing when available, while keeping a compatible classical QUBO solver as a fallback for deployment. Third, HQFS signs each rebalance output using a post-quantum signature so the allocation can be verified later without trusting the runtime environment. On our market dataset study, HQFS reduces return prediction error by 7.8% and volatility prediction error by 6.1% versus a tuned classical baseline. For the decision layer, HQFS improves out-of-sample Sharpe by 9.4% and lowers maximum drawdown by 11.7%. The QUBO solve stage also cuts average solve time by 28% compared to a mixed-integer baseline under the same constraints, while producing fully traceable, signed allocation records.

Related papers

• Adapt Only When It Pays: Budgeted Decision-Loss Priority for Delayed Online Time-Series Adaptation [0.0]
  We introduce ADOWIP: a residual-adapter framework with sealed delay queues, exact budget accounting, and auditable update telemetry.<n>Its main scheduler is an observed decision-loss priority gate that updates only after feedback is revealed.<n>We prove hard-budget feasibility, projected-OGD regret for a convex linear accepted-update subproblem, and stability plus conditional finite-sample gate-selection statements.
  arXiv  Detail & Related papers  (2026-06-23T18:22:22Z)
• Mitigating Bias in Low-SNR Financial Reinforcement Learning via Quantum Representations [32.164152251693565]
  Financial market is a typical low signal-to-noise ratio (SNR) setting, which often destabilizes maximum-entropy methods like Soft Actor-Critic (SAC)<n>In this paper, we propose FPQC-SAC, an efficient and bounded riticized Quantum Circuit (PQC) before the actor and critic networks to constrain feature propagation at the representation level.<n> Empirical evaluations on real-world portfolio management tasks demonstrate that FPQC-SAC substantially enhances out-of-sample stability and cumulative returns.
  arXiv  Detail & Related papers  (2026-06-09T05:55:06Z)
• Trust Region Q Adjoint Matching [54.05514246126841]
  We introduce Trust Region Q-Adjoint Matching (TRQAM), a stable off-policy fine-tuning algorithm that adaptively controls the path-space KL with pretrained flow policies.<n> TRQAM consistently outperforms prior arts in both offline RL and offline-to-online RL.
  arXiv  Detail & Related papers  (2026-05-26T14:28:43Z)
• Q-GARS: Quantum-inspired Robust Microservice Chaining Scheduling [0.42970700836450487]
  We propose Q-GARS, a hybrid framework that integrates the QUBO model with Simulated Quantum Annealing (SQA) based search and online rescheduling mechanisms.<n> Simulation results show that Q-GARS achieves an average weighted completion time improvement of 2.1% relative to a greedy baseline of the remaining shortest processing-time.<n>In addition, Q-GARS achieves a mean node resource utilization rate of 0.817, which is 1.1 percentage points above the robust baseline.
  arXiv  Detail & Related papers  (2026-03-24T12:24:51Z)
• SCOPE: Selective Conformal Optimized Pairwise LLM Judging [16.73004625486562]
  Large language models (LLMs) are increasingly used as judges to replace costly human preference labels in pairwise evaluation.<n>Despite their practicality, LLM judges remain prone to miscalibration and systematic biases.<n>This paper proposes SCOPE, a framework for selective pairwise judging with finite-sample statistical guarantees.
  arXiv  Detail & Related papers  (2026-02-13T17:10:43Z)
• LEC: Linear Expectation Constraints for False-Discovery Control in Selective Prediction and Routing Systems [95.35293543918762]
  Large language models (LLMs) often generate unreliable answers, while uncertainty methods fail to fully distinguish correct from incorrect predictions.<n>We address this issue through the lens of false discovery rate (FDR) control, ensuring that among all accepted predictions, the proportion of errors does not exceed a target risk level.<n>We propose LEC, which reinterprets selective prediction as a constrained decision problem by enforcing a Linear Expectation Constraint.
  arXiv  Detail & Related papers  (2025-12-01T11:27:09Z)
• ZIP-RC: Optimizing Test-Time Compute via Zero-Overhead Joint Reward-Cost Prediction [57.799425838564]
  We present ZIP-RC, an adaptive inference method that equips models with zero-overhead inference-time predictions of reward and cost.<n> ZIP-RC improves accuracy by up to 12% over majority voting at equal or lower average cost.
  arXiv  Detail & Related papers  (2025-12-01T09:44:31Z)
• BayesQ: Uncertainty-Guided Bayesian Quantization [1.565870461096057]
  BayesQ is an uncertainty-guided post-training quantization framework.<n>It is the first to optimize quantization under the posterior expected loss.<n>BayesQ reframes low-bit quantization as uncertainty-aware risk minimization.
  arXiv  Detail & Related papers  (2025-11-11T22:36:19Z)
• Reinforcement Learning from Probabilistic Forecasts for Safe Decision-Making via Conditional Value-at-Risk Planning [41.52380204321823]
  This paper presents the Uncertainty-Aware Markov Decision Process (UAMDP), a unified framework that couples Bayesian forecasting, posterior-sampling reinforcement learning, and planning.<n>We evaluate UAMDP in two domains-high-frequency equity trading and retail inventory control-both marked by structural uncertainty and economic volatility.
  arXiv  Detail & Related papers  (2025-10-09T13:46:32Z)
• Beyond Greedy Exits: Improved Early Exit Decisions for Risk Control and Reliability [14.00844847268286]
  Early-Exit Deep Neural Networks enable adaptive inference by allowing prediction at intermediary layers.<n>Our framework demonstrates consistent improvements in speedup (1.70-2.10x) with a minimal performance drop (2%) as compared to full model performance.
  arXiv  Detail & Related papers  (2025-09-28T06:05:24Z)
• Quantum Adaptive Self-Attention for Financial Rebalancing: An Empirical Study on Automated Market Makers in Decentralized Finance [2.2917707112773593]
  We study a hybrid quantum--classical self-attention block, textbfQuantum Adaptive Self-Attention (QASA).<n>QASA constructs quantum queries/keys/values via variational quantum circuits (VQCs) and applies standard softmax attention over Pauli-$Z$ expectation vectors.<n>The textbfQASA-Sequence variant attains the emphbest single-model risk-adjusted performance (textbf13.99% return; textbfe 1.76)
  arXiv  Detail & Related papers  (2025-09-21T07:27:14Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Decision from Suboptimal Classifiers: Excess Risk Pre- and Post-Calibration [52.70324949884702]
  We quantify the excess risk incurred using approximate posterior probabilities in batch binary decision-making.<n>We identify regimes where recalibration alone addresses most of the regret, and regimes where the regret is dominated by the grouping loss.<n>On NLP experiments, we show that these quantities identify when the expected gain of more advanced post-training is worth the operational cost.
  arXiv  Detail & Related papers  (2025-03-23T10:52:36Z)
• When Does Confidence-Based Cascade Deferral Suffice? [69.28314307469381]
  Cascades are a classical strategy to enable inference cost to vary adaptively across samples. A deferral rule determines whether to invoke the next classifier in the sequence, or to terminate prediction. Despite being oblivious to the structure of the cascade, confidence-based deferral often works remarkably well in practice.
  arXiv  Detail & Related papers  (2023-07-06T04:13:57Z)
• Markov Decision Process modeled with Bandits for Sequential Decision Making in Linear-flow [73.1896399783641]
  In membership/subscriber acquisition and retention, we sometimes need to recommend marketing content for multiple pages in sequence. We propose to formulate the problem as an MDP with Bandits where Bandits are employed to model the transition probability matrix. We observe the proposed MDP with Bandits algorithm outperforms Q-learning with $epsilon$-greedy and decreasing $epsilon$, independent Bandits, and interaction Bandits.
  arXiv  Detail & Related papers  (2021-07-01T03:54:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.