Hybrid LLM and Higher-Order Quantum Approximate Optimization for CSA Collateral Management
We address finance-native collateral optimization under ISDA Credit Support Annexes (CSAs), where integer lots, Schedule A haircuts, RA/MTA gating, and issuer/currency/class caps create rugged, legally bounded search spaces. We introduce a certifiable hybrid pipeline purpose-built for this domain: (i) an evidence-gated LLM that extracts CSA terms to a normalized JSON (abstain-by-default, span-cited); (ii) a quantum-inspired explorer that interleaves simulated annealing with micro higher order QAOA (HO-QAOA) on binding sub-QUBOs (subset size n <= 16, order k <= 4) to coordinate multi-asset moves across caps and RA-induced discreteness; (iii) a weighted risk-aware objective (Movement, CVaR, funding-priced overshoot) with an explicit coverage window U <= Reff+B; and (iv) CP-SAT as single arbiter to certify feasibility and gaps, including a U-cap pre-check that reports the minimal feasible buffer B*. Encoding caps/rounding as higher-order terms lets HO-QAOA target the domain couplings that defeat local swaps. On government bond datasets and multi-CSA inputs, the hybrid improves a strong classical baseline (BL-3) by 9.1%, 9.6%, and 10.7% across representative harnesses, delivering better cost-movement-tail frontiers under governance settings. We release governance grade artifacts-span citations, valuation matrix audit, weight provenance, QUBO manifests, and CP-SAT traces-to make results auditable and reproducible.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Quantum Observables for continuous control of the Quantum Approximate Optimization Algorithm via Reinforcement Learning
We present a classical control mechanism for Quantum devices using Reinforcement Learning. Our strategy is applied to the Quantum Approximate Optimization Algorithm (QAOA) in order to optimize an objective function that …
continuous-controlContinuous ControlQ-LearningReinforcement LearningAn Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm
Quantum approximate optimization algorithm (QAOA) is a promising quantum-classical hybrid algorithm to solve hard combinatorial optimization problems. The two-qubits gates used in quantum circuit for QAOA are commutative…
Combinatorial OptimizationAccelerating Quantum Approximate Optimization Algorithm using Machine Learning
We propose a machine learning based approach to accelerate quantum approximate optimization algorithm (QAOA) implementation which is a promising quantum-classical hybrid algorithm to prove the so-called quantum supremacy…
BIG-bench Machine LearningCombinatorial OptimizationQuantum Approximation for Multi-Scale Scheduling
This paper proposes a quantum approximate optimization algorithm (QAOA) method for multi-scale wireless scheduling problems. The QAOA is one of the promising hybrid quantum-classical algorithms for many applications and …
SchedulingQuantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability
The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, traditional algorithms often struggle to …