Author
Abstract
Collateral allocation for uncleared derivatives is a legally constrained and operationally discrete optimization problem. Institutions must satisfy margin requirements while respecting CSA eligibility rules, valuation percentages, rounding, transfer thresholds, concentration limits, custody conditions, inventory, and VM, IM, or IA side constraints. This manuscript develops CR-HO-QAOA, a certified higher-order quantum candidate-generation framework for margin- and CSA-aware collateral allocation. The framework is adapter-first: official SIMM, proxy SIMM, legacy IA, VM-only, RQV, or hybrid margin sources are normalized into a common MarginRequirement, so the optimizer does not calculate or replace official SIMM. Given the requirement, CSA terms, and inventory, the optimizer builds a bounded active neighborhood of pledge, recall, substitution, batch, and slack actions. These actions define a higher-order binary model whose hyperedges capture concentration pressure, custody batches, substitution tickets, chunky lots, liquidity effects, overshoot, and side-specific requirements. The quantum layer maps hyperedges into a Pauli-Z cost Hamiltonian and uses collateral-specific feasible-subspace mixers to preserve one-hot choices, movement budgets, side assignments, and substitution structure. Candidates are decoded, repaired if needed, evaluated under an eight-term production objective, and certified by a deterministic CP-SAT master solver before any recommendation is reported. Synthetic benchmarks show that higher-order, constraint-preserving candidate generation can improve certified sample quality relative to QUBO-style and generic-mixer baselines, while CP-SAT remains the feasibility and governance arbiter. These results are synthetic workflow-validation evidence only, not evidence of hardware quantum advantage or production bank savings.
Suggested Citation
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2606.04235. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.