A Hybrid Quantum-Classical Coordination Architecture for Portfolio Optimization via Global Context Injection

• URL: http://arxiv.org/abs/2609.15708v1
• Date: Mon, 14 Sep 2026 15:12:22 GMT
• Title: A Hybrid Quantum-Classical Coordination Architecture for Portfolio Optimization via Global Context Injection
• Abstract summary: Near-term quantum and quantum-inspired solvers for portfolio optimization rely on local subproblem execution under severe size constraints.<n>We propose Context-Aware Folding (CAF), a lightweight hybrid quantum-classical coordination layer between one-shot static decomposition and full-matrix optimization.<n>CAF injects a compressed global risk state into each local subproblem via a state-dependent linear bias, decouples local candidate generation from global commitment, and retains a sequential acceptance rule.
• Score: 2.4660652494309936
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Near-term quantum and quantum-inspired solvers for portfolio optimization rely on local subproblem execution under severe size constraints, but this locality can omit cross-cluster covariance essential for global risk coordination. We propose Context-Aware Folding (CAF), a lightweight hybrid quantum-classical coordination layer between one-shot static decomposition and full-matrix optimization. CAF injects a compressed global risk state into each local subproblem via a state-dependent linear bias, decouples local candidate generation from global commitment, and retains a sequential acceptance rule with a monotonic non-divergence guarantee. On a 2016 Russell 3000 subset (N=484) with Simulated Annealing (SA), CAF improves the scalarized mean-variance objective by 6.59\% over a static baseline (20/20 wins), and by 0.2579\% on an additional 2018 panel (N=1397, 17/20 wins). We further report matched folded N=40 compatibility studies with the Quantum Approximate Optimization Algorithm (QAOA) and simulated quantum annealing (SQA) as local solvers, together with a frozen hardware-in-the-loop run on Origin Quantum's Wukong 180 (\texttt{WK\_C180}) for one warm-started QAOA subproblem at n=5. These results support CAF as a coordination architecture with strong classical large-scale evidence, cross-backend compatibility, and local executability on real quantum hardware in the noisy intermediate-scale quantum (NISQ) era.

Related papers

• Quantum Interference as a Proposal Mechanism for Combinatorial Optimization [0.0]
  Quantum Proposal Interference Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns.<n>QIPS is used to update an elite frontier of low-energy solutions.<n>Performance is assessed using top-$K$ coverage, hit rate, multiplicity, Hilbert-space coverage and dyadic-rank metrics.
  arXiv  Detail & Related papers  (2026-07-29T22:54:13Z)
• Hybrid Quantum Neighborhood Selection: NISQ-Compatible Combinatorial Optimization via Stochastic Frontier Decomposition [0.0]
  This work introduces Hybrid Quantum Neighborhood Selection (HQNS)<n>HQNS selects a compact frontier of F N active variables per stage, freezing the rest into reduced QUBO coefficients.<n>We evaluate HQNS on the Maximum Diversity Subset Selection Problem (MDSSP) across six scales, N up to 1000.
  arXiv  Detail & Related papers  (2026-06-28T23:35:46Z)
• Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets [40.76168869865134]
  We prove the conjecture for regular and uniform networks of arbitrary size.<n>By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries transforms the source state into an (N)-party GHZ state with fidelity (dm-M)<n>These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.
  arXiv  Detail & Related papers  (2026-06-19T14:53:28Z)
• QnRL: Quantum-Native Reinforcement Learning [82.36163324220894]
  Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with environments.<n>Existing QRL architectures indirectly approximate environment behavior by estimating expected outcomes, which limits their expressive power and adaptive potential.<n>Overcoming such challenges requires a novel QRL approach that exploits the distributional nature of quantum computers to directly model environment random variables as quantum state distributions.
  arXiv  Detail & Related papers  (2026-06-06T17:54:58Z)
• Where the Quantum Lives in D-Wave Hybrid Portfolio Optimization [0.0]
  We audit how much of D-Wave's hybrid quantum-classical portfolio-optimization service is actually quantum.<n>The constraint-native LeapHybridCQM service matches Gurobi's proven optimum on all 54 instances where Gurobi proves optimality.
  arXiv  Detail & Related papers  (2026-05-17T19:41:17Z)
• Multi-Objective Evolutionary Optimization of Chance-Constrained Multiple-Choice Knapsack Problems with Implicit Probability Distributions [40.96538452098451]
  This paper investigates a significant yet underexplored extension of the multiple-choice knapsack problem (MCKP)<n>The goal of the problem is to simultaneously minimize the total cost and maximize the confidence level of satisfying the capacity constraint.<n> Experiments on synthetic benchmarks and real-world 5G network configuration benchmarks demonstrate that NHILS consistently outperforms several state-of-the-art multi-objectives.
  arXiv  Detail & Related papers  (2026-03-09T10:39:58Z)
• Large-scale portfolio optimization on a trapped-ion quantum computer [32.24411362086563]
  We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints.<n>We experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition.
  arXiv  Detail & Related papers  (2026-02-27T12:36:14Z)
• SKANet: A Cognitive Dual-Stream Framework with Adaptive Modality Fusion for Robust Compound GNSS Interference Classification [47.20483076887704]
  Global Navigation Satellite Systems (GNSS) face growing threats from sophisticated jamming interference.<n>We propose a cognitive deep learning framework built upon a dual-stream architecture that integrates Time-Frequency Images (TFIs) and Power Spectral Density (PSD)<n>We show that SKANet achieves an overall accuracy of 96.99%, exhibiting superior robustness for compound jamming classification.
  arXiv  Detail & Related papers  (2026-01-19T07:42:45Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem [0.0]
  We propose a hybrid quantum-classical framework integrating variational quantum eigensolver (VQE) optimisation with classical machine learning.<n>We evaluate the framework on 80 European cities via Qiskit's AerSimulator and ibm_kyiv 127-qubit backend.
  arXiv  Detail & Related papers  (2025-09-30T13:26:12Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Towards fully-fledged quantum and classical communication over deployed fiber with up-conversion module [47.187609203210705]
  We propose and demonstrate a new method, based on up-conversion assisted receiver, for co-propagating classical light and QKD signals. Our proposal exhibits higher tolerance for noise in comparison to the standard receiver, thus enabling the distribution of secret keys in the condition of 4 dB-higher classical power.
  arXiv  Detail & Related papers  (2021-06-09T13:52:27Z)

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.