Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz

• URL: http://arxiv.org/abs/2508.13954v3
• Date: Thu, 06 Nov 2025 21:10:57 GMT
• Title: Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz
• Authors: J. V. S. Scursulim, Gabriel Mattos Langeloh, Victor Leme Beltran, Samuraí Brito,
• Abstract summary: We introduce a novel quantum framework for portfolio optimization that explicitly incorporates diversification.<n>A key strength of this ansatz is that it initializes the quantum system in a superposition of only feasible states.<n>Our findings demonstrate that, when combined with the CMA-ES, the Dicke state ansatz achieves superior performance in terms of convergence rate, approximation ratio, and measurement probability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Combinatorial optimization is a fundamental challenge in various domains, with portfolio optimization standing out as a key application in finance. Despite numerous quantum algorithmic approaches proposed for this problem, most overlook a critical feature of realistic portfolios: diversification. In this work, we introduce a novel quantum framework for multiclass portfolio optimization that explicitly incorporates diversification by leveraging multiple parametrized Dicke states, simultaneously initialized to encode the diversification constraints , as an ansatz of the Variational Quantum Eigensolver. A key strength of this ansatz is that it initializes the quantum system in a superposition of only feasible states, inherently satisfying the constraints. This significantly reduces the search space and eliminates the need for penalty terms. In addition, we also analyze the impact of different classical optimizers in this hybrid quantum-classical approach. Our findings demonstrate that, when combined with the CMA-ES optimizer, the Dicke state ansatz achieves superior performance in terms of convergence rate, approximation ratio, and measurement probability. These results underscore the potential of this method to solve practical, diversification-aware portfolio optimization problems relevant to the financial sector.

Related papers

• Large-scale portfolio optimization using Pauli Correlation Encoding [0.0]
  We show how a gate-based variational quantum algorithm can be applied to a real-world portfolio optimization problem.<n>Specifically, we address a problem involving over 250 variables, where the market graph representing a real stock market is iteratively partitioned into sub-portfolios of highly correlated assets.
  arXiv  Detail & Related papers  (2025-11-26T11:51:07Z)
• 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 Portfolio Optimization with Expert Analysis Evaluation [4.2435928520499635]
  This study systematically benchmarks two prominent variational quantum approaches, Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA)<n>Although both methods demonstrate effective cost function minimization, the resulting portfolios often violate essential financial criteria.<n>We introduce an Expert Analysis Evaluation framework in which financial professionals assess the economic soundness and the market feasibility of quantum-optimized portfolios.
  arXiv  Detail & Related papers  (2025-07-28T05:30:13Z)
• A Comparative Study of Quantum Optimization Techniques for Solving Combinatorial Optimization Benchmark Problems [4.266376725904727]
  We introduce a comprehensive benchmarking framework designed to evaluate quantum optimization techniques against well-established NP-hard problems.<n>Our framework focuses on key problem classes, including the Multi-Dimensional Knapsack Problem (MDKP), Maximum Independent Set (MIS), Quadratic Assignment Problem (QAP), and Market Share Problem (MSP)
  arXiv  Detail & Related papers  (2025-03-15T13:02:22Z)
• Comparative analysis of diverse methodologies for portfolio optimization leveraging quantum annealing techniques [3.296670045513668]
  As the number of involved assets and constraints increases, the portfolio optimization problem can become increasingly difficult to solve. Quantum annealing algorithm holds promise for solving complex portfolio optimization problems in the NISQ era.
  arXiv  Detail & Related papers  (2024-03-05T02:21:54Z)
• 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)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.