We analyze 3,171 US common stocks to create an efficient portfolio based on the Chicago Quantum Net Score (CQNS) and portfolio optimization. We begin with classical solvers and incorporate quantum annealing. We add a simulated bifurcator as a new classical solver and the new D-Wave Advantage(TM) quantum annealing computer as our new quantum solver.
We analyze 3,171 US common stocks to create an efficient portfolio based on the Chicago Quantum Net Score (CQNS) and portfolio optimization. We begin with classical solvers and incorporate quantum annealing. We add a simulated bifurcator as a new classical solver and the new D-Wave Advantage(TM) quantum annealing computer as our new quantum solver.
We investigate the use of quantum computers for building a portfolio out of a universe of U.S. listed, liquid equities that contains an optimal set of stocks. Starting from historical market data, we look at various problem formulations on the D-Wave Systems Inc. D-Wave 2000Q(TM) System (hereafter called DWave) to find the optimal risk vs return portfolio; an optimized portfolio based on the Markowitz formulation and the Sharpe ratio, a simplified Chicago Quantum Ratio (CQR), then a new Chicago Quantum Net Score (CQNS). We approach this first classically, then by our new method on DWave. Our results show that practitioners can use a DWave to select attractive portfolios out of 40 U.S. liquid equities.
We continue to investigate the use of quantum computers for building an optimal portfolio out of a universe of 60 U.S. listed, liquid equities. Starting from historical market data, we apply our unique problem formulation on the D-Wave Systems Inc. D-Wave 2000Q (TM) quantum annealing system (hereafter called D-Wave) to find the optimal risk vs return portfolio. We approach this first classically, then using the D-Wave, to select efficient buy and hold portfolios. Our results show that practitioners can use either classical or quantum annealing methods to select attractive portfolios. This builds upon our prior work on optimization of 40 stocks.
In this work, we introduce a new workflow to solve portfolio optimization problems on annealing platforms. We combine a classical preprocessing step with a modified unconstrained binary optimization (QUBO) model and evaluate it using simulated annealing (classical computer), digital annealing (Fujitsu’s Digital Annealing Unit), and quantum annealing (D-Wave Advantage). Starting from Markowitz’s theory on portfolio optimization, our classical preprocessing step finds the most promising assets within a set of possible assets to choose from. We then modify existing QUBO models for portfolio optimization, such that there are no limitations on the number of assets that can be invested in. Furthermore, our QUBO model enables an investor to also place an arbitrary amount of money into each asset. We apply this modified QUBO to the set of promising asset candidates we generated previously via classical preprocessing. A solution to our QUBO model contains information about what percentage of the whole available capital should be invested into which asset. For the evaluation, we have used publicly available real-world data sets of stocks of the New York Stock Exchange as well as common ETFs. Finally, we have compared the respective annealing results with randomly generated portfolios by using the return, variance, and diversification of the created portfolios as measures. The results show that our QUBO formulation is capable of creating well-diversified portfolios that respect certain criteria given by an investor, such as maximizing return, minimizing risk, or sticking to a certain budget.
Classical computers have a limitation in solving NP-hard (nondeterministic polynomial) problems, which cannot be solved in polynomial time. However, the Quantum Computing paradigm is inherently capable of solving such types of problems. One of the major milestones inclined to a quantum -ready era is a relative comparison of execution speed and overall efficiency of current classical versus quantum models. In our approach, we are initiating the foremost step towards addressing the above milestone by performing a comparative study between quantum optimization techniques (available on both gate-model as well as quantum annealers) versus classical by solving a finance domain problem, that is, portfolio optimization using Markowitz mean-variance optimization. Historical market data from Jan’2011 till Dec’2016 of 48 NSE stocks were considered to build the portfolio by optimizing the mean-variance based on Harry Markowitz’s Modern Portfolio Theory. We approach this first classically and then on gate-model based quantum computer using Qiskit SDK, followed by D-wave solvers to build efficient portfolio and compare which among these frameworks are mature enough in this NISQ era to solve portfolio optimization problem related to the finance domain. Our results are comparable and from our experimentation performed on D-wave annealers and gate-model simulators, we observed that implementations using quantum methods were faster than the corresponding implementation of classical methods.
Quantum annealing (QA) represents a promising optimization technique to achieve both quantum and classical advantages and address real-world applications such as quantum finance, enabled by the rapid advancements in quantum computing (QC) in recent years. This study represents the first attempt to explore a novel weighted portfolio optimization model based on a new assessment strategy, trend ratio (TR), and extends its application to international stock markets, including DJIA, TSX, CAC, and FTSE. It utilizes the D-Wave Advantage quantum system and a hybrid solver to demonstrate its effectiveness and efficiency in solving enterprise-scale financial problems. Experimental findings demonstrate that QA outperforms both classical and state-of-the-art quantum-inspired optimization techniques in evaluating returns and risks, including metrics such as daily profit factor (DPF), maximum drawdown (MDD), and TR. Furthermore, QA exhibits outstanding search capabilities, facilitating rapid identification of high-performance portfolios within a remarkably short timeframe. Statistical tests are adopted to prove that QA significantly improves solution quality while requiring less computational cost.
Recently, several researchers proposed portfolio optimization as a potential use case for quantum optimization. However, the literature is lacking an extensive benchmark quantifying the potential of quantum computers for portfolio optimization. In this work, we contribute to closing this gap. We provide a computational study, comparing quantum approaches against state-of-the-art classical methods on a meaningful, real-world instance set. In particular, we compare quantum annealing and the quantum approximate optimization algorithm against classical mixed-integer programming, simulated annealing, steepest descent local search, tabu search and a problem-tailored heuristic. We consider a variance-minimizing variant of portfolio optimization which we show to be more difficult to solve for classical optimizers than return-maximizing or multi-objective formulations. Our benchmark data set comprises 270 instances with up to 1,000 assets from actual stock data. Due to hardware limitation, quantum methods could only be tested for instances with at most 30 assets. The results show that all instances can be solved to proven optimality by mixed-integer programming in the order of seconds. Moreover, the problem-tailored heuristic consistently outperforms quantum approaches in terms of solution quality for fixed runtime. Thus, we conclude that there is only very limited room for a potential quantum advantage for the considered variant of portfolio optimization.