Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz
arXiv:2508.13954 · doi:10.1038/s41598-026-36333-4
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.
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Ising formulations of many NP problems
- Quantum machine learning in feature Hilbert spaces
- Quantum computational chemistry
- Quantum Convolutional Neural Networks
- Quantum algorithms for quantum chemistry and quantum materials science
- Challenges and Opportunities in Quantum Machine Learning
- Quantum Computing for Finance: State of the Art and Future Prospects
- Experimental realization of Dicke states of up to six qubits for multiparty quantum networking
- Quantum computing for finance
- Warm-starting quantum optimization
- Quantum computing enhanced computational catalysis
- Quantum machine learning beyond kernel methods
- Challenges and Opportunities in Quantum Optimization
- Quantum machine learning for quantum anomaly detection
- Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks
- Deterministic Preparation of Dicke States
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Benchmarking the performance of portfolio optimization with QAOA
- Applying quantum algorithms to constraint satisfaction problems
- Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
- Feedback-based quantum optimization
- A necessary and sufficient condition to play games in quantum mechanical settings
- The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
- Quantum speedup of branch-and-bound algorithms
- Quantum unary approach to option pricing
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Evaluating Quantum Approximate Optimization Algorithm: A Case Study
- Short-Depth Circuits for Dicke State Preparation
- Challenges of variational quantum optimization with measurement shot noise
- Quantum-Informed Recursive Optimization Algorithms
- Quantum storage in quantum ferromagnets
- Variational quantum eigensolver with linear depth problem-inspired ansatz for solving portfolio optimization in finance
- Improved quantum backtracking algorithms using effective resistance estimates
- Quantum computing for genomics: conceptual challenges and practical perspectives