Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Loan Portfolio Optimization with Variational Quantum Algorithms — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 13, 2026• 0 citations
Publisher

Abstract

Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24186706

Related papers

Loan Portfolio Optimization with Variational Quantum Algorithms

Balaganchi A. Bhargava, Kamlesh Kumar, Gouranga Dinda +4 more

Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. For problem instances with up to 1000 portfolio-selection variables, we benchmark classical simulations of a variational quantum algorithm (VQA) against Google OR-Tools under matched time budgets, obtaining feasible portfolios with an objective-value gap of about 40% across all sizes. We further implement the framework on superconducting quantum hardware for instances containing up to 1500 variables. Across these instances, the experimentally obtained objective values are within 10% of the corresponding simulation results. These findings demonstrate the feasibility of applying PCE-based variational quantum optimization to large-scale loan portfolio optimization under current quantum hardware limitations.

quant-pharXiv:2609.30195•Sep 25, 2026•1 citation

Qubit-Efficient Variational Quantum Optimization via Pauli Correlation Encoding: Application to Large-Scale Power Demand Portfolio Optimization

Takuya Yoshioka, Keita Sasada, Riku Usuki +2 more

Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m=18$ to $10{,}296$, with normalized cost gaps on the order of $10^{-4}$ relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.

quant-pharXiv:2607.24722•Physical Review Applied•Jul 28, 2026•2 citations

Multi-Objective Portfolio Optimization Using a Quantum Annealer

Esteban Aguilera, Jins de Jong, Frank Phillipson +2 more

In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to the quadratic nature of, for example, risk measures. Quantum computing is a promising solution for quadratic optimization problems, as it can leverage quantum annealing and quantum approximate optimization algorithms, which are expected to tackle these problems more efficiently. Quantum computing takes advantage of quantum phenomena like superposition and entanglement. In this paper, a specific problem is introduced, where a portfolio of loans need to be optimized for 2030, considering ‘Return on Capital’ and ‘Concentration Risk’ objectives, as well as a carbon footprint constraint. This paper introduces the formulation of the problem and how it can be optimized using quantum computing, using a reformulation of the problem as a quadratic unconstrained binary optimization (QUBO) problem. Two QUBO formulations are presented, each addressing different aspects of the problem. The QUBO formulation succeeded in finding solutions that met the emission constraint, although classical simulated annealing still outperformed quantum annealing in solving this QUBO, in terms of solutions close to the Pareto frontier. Overall, this paper provides insights into how quantum computing can address complex optimization problems in the financial sector. It also highlights the potential of quantum computing for providing more efficient and robust solutions for portfolio management.

Mathematics•Apr 24, 2024•32 citations

Large-scale portfolio optimization using Pauli Correlation Encoding

Vicente P. Soloviev, Michal Krompiec

Portfolio optimization is a cornerstone of financial decision-making, traditionally relying on classical algorithms to balance risk and return. Recent advances in quantum computing offer a promising alternative, leveraging quantum algorithms to efficiently explore complex solution spaces and potentially outperform classical methods in high-dimensional settings. However, conventional quantum approaches typically assume a one-to-one correspondence between qubits and variables (e.g. financial assets), which severely limits the applicability of gate-based quantum systems due to current hardware constraints. As a result, only quantum annealing-like methods have been used in realistic scenarios. In this work, we show how a gate-based variational quantum algorithm can be applied to a real-world portfolio optimization problem by assigning multiple variables per qubit. 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. This approach enables improved scalability compared to traditional variational methods and opens new possibilities for quantum-enhanced financial applications.

quant-pharXiv:2511.21305•Scientific Reports•Nov 27, 2025•13 citations

Hybrid Quantum-Classical Algorithms for Loan-Collection Optimization with Loan-Loss Provisions

Jirawat Tangpanitanon, Jirawat Saiphet, Pantita Palittapongarnpim +7 more

Banks are required to set aside funds in their income statement, known as a loan-loss provision (LLP), to account for potential loan defaults and expenses. By treating the LLP as a global constraint, we propose a hybrid quantum-classical algorithm to solve a specific case of quadratic constrained binary optimization (QCBO) models for loan-collection optimization. The objective is to find a set of optimal loan-collection actions that maximizes the expected net profit presented to the bank as well as the financial welfare in the financial network of loanees, while keeping the LLP at its minimum. Our algorithm consists of three parts: a classical divide-and-conquer algorithm to enable a large-scale optimization, a quantum alternating operator ansatz (QAOA) algorithm to maximize the objective function, and a classical sampling algorithm to handle the LLP. We apply the algorithm to a real-world data set with 600 loanees and five possible collection actions. The QAOA is performed using up to 35 qubits on a classical computer. We show that incorporating the QAOA can enhance the expected net profit by approximately $70\mathrm{%}$ in comparison to scenarios where the QAOA is absent from the hybrid algorithm. Although this improvement does not constitute definitive evidence of quantum advantage, our work illustrates the use of near-term quantum devices to tackle real-world optimization problems.

arXiv:2110.15870•Physical Review Applied•Jun 1, 2023•9 citations

A Quantum Approximate Optimization Algorithm (QAOA) Approach to Portfolio Optimization

Yifei Huang

Portfolio optimization, a core combinatorial optimization problem in quantitative finance, requires balancing return maximization and risk minimization within discrete asset sets. Classical algorithms often struggle with scalability and local optima traps when handling large-scale asset pools, limiting their practicality in dynamic markets. This study proposes a complete Quantum Approximate Optimization Algorithm (QAOA) workflow for portfolio optimization, from problem formalization to experimental validation. We first transform the portfolio optimization problem into a Quadratic Unconstrained Binary Optimization (QUBO) framework, then design a parameterized QAOA circuit with adjustable layers to balance expressiveness and noise resilience. We propose a methodology using Qiskit for quantum simulation and classical optimizers for parameter tuning, we propose implementing the algorithm on real-world S&P 500 stock data. We could also analyze the impact of quantum hardware noise and propose mitigation strategies, providing actionable insights for Noisy intermediate-scale quantum computing (NISQ)-era implementations. This work bridges quantum algorithm design with real-world financial applications, offering a theoretical framework for quantum-driven portfolio optimization.

Exploring Science Academic Conference Series•Jul 30, 2026•0 citations
Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization problem whose complexity grows rapidly with portfolio size. In this work, we formulate LPO as a Quadratic Constrained Binary Optimization (QCBO) problem that jointly captures expected and unexpected losses and transform the resulting formulation into a Quadratic Unconstrained Binary Optimization (QUBO) model suitable for variational quantum optimization. To address the limited qubit resources of current quantum hardware, we employ Pauli Correlation Encoding (PCE), which enables a large number of portfolio-selection variables to be represented using comparatively few qubits. The proposed framework is evaluated on a real-world microfinance dataset comprising 2012 borrowers. For problem instances with up to 1000 portfolio-selection variables, we benchmark classical simulations of a variational quantum algorithm (VQA) against Google OR-Tools under matched time budgets, obtaining feasible portfolios with an objective-value gap of about 40% across all sizes. We further implement the framework on superconducting quantum hardware for instances containing up to 1500 variables. Across these instances, the experimentally obtained objective values are within 10% of the corresponding simulation results. These findings demonstrate the feasibility of applying PCE-based variational quantum optimization to large-scale loan portfolio optimization under current quantum hardware limitations.
Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from m=18m=18m=18 to 10,29610{,}29610,296, with normalized cost gaps on the order of 10−410^{-4}10−4 relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.
In this study, the portfolio optimization problem is explored, using a combination of classical and quantum computing techniques. The portfolio optimization problem with specific objectives or constraints is often a quadratic optimization problem, due to the quadratic nature of, for example, risk measures. Quantum computing is a promising solution for quadratic optimization problems, as it can leverage quantum annealing and quantum approximate optimization algorithms, which are expected to tackle these problems more efficiently. Quantum computing takes advantage of quantum phenomena like superposition and entanglement. In this paper, a specific problem is introduced, where a portfolio of loans need to be optimized for 2030, considering ‘Return on Capital’ and ‘Concentration Risk’ objectives, as well as a carbon footprint constraint. This paper introduces the formulation of the problem and how it can be optimized using quantum computing, using a reformulation of the problem as a quadratic unconstrained binary optimization (QUBO) problem. Two QUBO formulations are presented, each addressing different aspects of the problem. The QUBO formulation succeeded in finding solutions that met the emission constraint, although classical simulated annealing still outperformed quantum annealing in solving this QUBO, in terms of solutions close to the Pareto frontier. Overall, this paper provides insights into how quantum computing can address complex optimization problems in the financial sector. It also highlights the potential of quantum computing for providing more efficient and robust solutions for portfolio management.
Portfolio optimization is a cornerstone of financial decision-making, traditionally relying on classical algorithms to balance risk and return. Recent advances in quantum computing offer a promising alternative, leveraging quantum algorithms to efficiently explore complex solution spaces and potentially outperform classical methods in high-dimensional settings. However, conventional quantum approaches typically assume a one-to-one correspondence between qubits and variables (e.g. financial assets), which severely limits the applicability of gate-based quantum systems due to current hardware constraints. As a result, only quantum annealing-like methods have been used in realistic scenarios. In this work, we show how a gate-based variational quantum algorithm can be applied to a real-world portfolio optimization problem by assigning multiple variables per qubit. 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. This approach enables improved scalability compared to traditional variational methods and opens new possibilities for quantum-enhanced financial applications.
Banks are required to set aside funds in their income statement, known as a loan-loss provision (LLP), to account for potential loan defaults and expenses. By treating the LLP as a global constraint, we propose a hybrid quantum-classical algorithm to solve a specific case of quadratic constrained binary optimization (QCBO) models for loan-collection optimization. The objective is to find a set of optimal loan-collection actions that maximizes the expected net profit presented to the bank as well as the financial welfare in the financial network of loanees, while keeping the LLP at its minimum. Our algorithm consists of three parts: a classical divide-and-conquer algorithm to enable a large-scale optimization, a quantum alternating operator ansatz (QAOA) algorithm to maximize the objective function, and a classical sampling algorithm to handle the LLP. We apply the algorithm to a real-world data set with 600 loanees and five possible collection actions. The QAOA is performed using up to 35 qubits on a classical computer. We show that incorporating the QAOA can enhance the expected net profit by approximately $70\mathrm{%}$ in comparison to scenarios where the QAOA is absent from the hybrid algorithm. Although this improvement does not constitute definitive evidence of quantum advantage, our work illustrates the use of near-term quantum devices to tackle real-world optimization problems.
Portfolio optimization, a core combinatorial optimization problem in quantitative finance, requires balancing return maximization and risk minimization within discrete asset sets. Classical algorithms often struggle with scalability and local optima traps when handling large-scale asset pools, limiting their practicality in dynamic markets. This study proposes a complete Quantum Approximate Optimization Algorithm (QAOA) workflow for portfolio optimization, from problem formalization to experimental validation. We first transform the portfolio optimization problem into a Quadratic Unconstrained Binary Optimization (QUBO) framework, then design a parameterized QAOA circuit with adjustable layers to balance expressiveness and noise resilience. We propose a methodology using Qiskit for quantum simulation and classical optimizers for parameter tuning, we propose implementing the algorithm on real-world S&P 500 stock data. We could also analyze the impact of quantum hardware noise and propose mitigation strategies, providing actionable insights for Noisy intermediate-scale quantum computing (NISQ)-era implementations. This work bridges quantum algorithm design with real-world financial applications, offering a theoretical framework for quantum-driven portfolio optimization.