Variational Quantum Eigensolver for Real-World Finance: Scalable Solutions for Dynamic Portfolio Optimization Problems

• URL: http://arxiv.org/abs/2512.22001v1
• Date: Fri, 26 Dec 2025 11:59:30 GMT
• Title: Variational Quantum Eigensolver for Real-World Finance: Scalable Solutions for Dynamic Portfolio Optimization Problems
• Authors: Irene De León, Danel Arias, Manuel Martín-Cordero, María Esperanza Molina, Pablo Serrano, Senaida Hernández-Santana, Miguel Ángel Jiménez Herrera, Joana Fraxanet, Ginés Carrascal, Escolástico Sánchez, Inmaculada Posadillo, Álvaro Nodar,
• Abstract summary: We present a scalable, hardware-aware methodology for extending the Variational Quantum Eigensolver (VQE) to large, realistic Dynamic Portfolio Optimization (DPO) problems.<n>The first is the implementation of the Ising Sample-based Quantum Configuration Recovery (ISQR) routine, which improves solution quality in Quadratic Unconstrained Binary Optimization problems.<n>The second is the use of the VQE Constrained method to decompose the optimization task, enabling us to handle DPO instances with more variables than the available qubits on current hardware.
• Score: 0.2937420753606784
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a scalable, hardware-aware methodology for extending the Variational Quantum Eigensolver (VQE) to large, realistic Dynamic Portfolio Optimization (DPO) problems. Building on the scaling strategy from our previous work, where we tailored a VQE workflow to both the DPO formulation and the target QPU, we now put forward two significant advances. The first is the implementation of the Ising Sample-based Quantum Configuration Recovery (ISQR) routine, which improves solution quality in Quadratic Unconstrained Binary Optimization problems. The second is the use of the VQE Constrained method to decompose the optimization task, enabling us to handle DPO instances with more variables than the available qubits on current hardware. These advances, which are broadly applicable to other optimization problems, allow us to address a portfolio with a size relevant to the financial industry, consisting of up to 38 assets and covering the full Spanish stock index (IBEX 35). Our results, obtained on a real Quantum Processing Unit (IBM Fez), show that this tailored workflow achieves financial performance on par with classical methods while delivering a broader set of high-quality investment strategies, demonstrating a viable path towards obtaining practical advantage from quantum optimization in real financial applications.

Related papers

• Achieving High-Quality Portfolio Optimization with the Variational Quantum Eigensolver [3.361857599742077]
  Portfolio optimization is a fundamental problem in finance that aims to determine the optimal allocation of assets within a portfolio to maximize returns while minimizing risk.<n>Quantum computing offers the potential to solve such problems more efficiently than classical methods.<n>We employ the Variational Quantum Eigensolver (VQE) to address the portfolio optimization problem.
  arXiv  Detail & Related papers  (2025-08-26T03:03:36Z)
• Quantum Annealing Hyperparameter Analysis for Optimal Sensor Placement in Production Environments [39.58317527488534]
  We show how quantum computing could contribute to cost-efficient, large-scale optimization problems once the hardware matures.<n>We transform the problem into a quadratic unconstrained binary optimization formulation with one-hot and binary encoding.<n>Our results demonstrate that quantum annealing is capable of solving instances derived from real-world scenarios.
  arXiv  Detail & Related papers  (2025-07-22T13:35:51Z)
• NeUQI: Near-Optimal Uniform Quantization Parameter Initialization [41.08779476737888]
  Post-training quantization of large language models (LLMs) offers a promising solution that reduces their memory footprint and decoding latency.<n>Recent studies on $geq 2$-bit uniform quantization have led to noticeable improvements in post-quantization model performance.<n>We propose NeUQI, a method devoted to efficiently determining near-optimal initial parameters for uniform quantization.
  arXiv  Detail & Related papers  (2025-05-23T07:59:46Z)
• Continual Optimization with Symmetry Teleportation for Multi-Task Learning [73.28772872740744]
  Multi-task learning (MTL) enables the simultaneous learning of multiple tasks using a single model.<n>We propose a novel approach based on Continual Optimization with Symmetry Teleportation (COST)<n>COST seeks an alternative loss-equivalent point on the loss landscape to reduce conflict gradients.
  arXiv  Detail & Related papers  (2025-03-06T02:58:09Z)
• PO-QA: A Framework for Portfolio Optimization using Quantum Algorithms [4.2435928520499635]
  Portfolio Optimization (PO) is a financial problem aiming to maximize the net gains while minimizing the risks in a given investment portfolio. We propose a novel scalable framework, denoted PO-QA, to investigate the variation of quantum parameters. Our results provide effective insights into comprehending PO from the lens of Quantum Machine Learning.
  arXiv  Detail & Related papers  (2024-07-29T10:26:28Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• A Quantum Computing-based System for Portfolio Optimization using Future Asset Values and Automatic Reduction of the Investment Universe [0.40498500266986387]
  We present a system called Quantum Computing-based System for Portfolio Optimization with Future Asset Values and Automatic Universe Reduction (Q4FuturePOP) Q4FuturePOP includes an automatic universe reduction module, which is conceived to intelligently reduce the complexity of the problem.
  arXiv  Detail & Related papers  (2023-09-22T05:27:23Z)
• Optimizing Credit Limit Adjustments Under Adversarial Goals Using Reinforcement Learning [42.303733194571905]
  We seek to find and automatize an optimal credit card limit adjustment policy by employing reinforcement learning techniques. Our research establishes a conceptual structure for applying reinforcement learning framework to credit limit adjustment.
  arXiv  Detail & Related papers  (2023-06-27T16:10:36Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Comparing Classical-Quantum Portfolio Optimization with Enhanced Constraints [0.0]
  We show how to add fundamental analysis to the portfolio optimization problem, adding in asset-specific and global constraints based on chosen balance sheet metrics. We analyze the current state-of-the-art algorithms for solving such a problem using D-Wave's Quantum Processor and compare the quality of the solutions obtained to commercially-available optimization software.
  arXiv  Detail & Related papers  (2022-03-09T17:46:32Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing [0.0]
  We propose a hybrid quantum-classical algorithm to solve a dynamic asset allocation problem. We compare the results from D-Wave's 2000Q and Advantage quantum annealers using real-world financial data. Experiments on assets with higher correlations tend to perform better, which may help to design practical quantum applications in the near term.
  arXiv  Detail & Related papers  (2021-12-06T17:39:43Z)
• Quantum Portfolio Optimization with Investment Bands and Target Volatility [0.0]
  We show how to implement in a simple way some complex real-life constraints on the portfolio optimization problem. We show how to implement individual investment bands, i.e., minimum and maximum possible investments for each asset. Our results show how practical daily constraints found in quantitative finance can be implemented in a simple way in current NISQ quantum processors.
  arXiv  Detail & Related papers  (2021-06-12T10:17:17Z)

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.