Paper: arXiv 2410.11997
Authors: Queenie Sun, Nicholas Grablevsky, Huaizhang Deng, Pooya Azadi
Abstract
Portfolio construction has been a long-standing topic of research in finance. The computational complexity and the time taken both increase rapidly with the number of investments in the portfolio. It becomes difficult, even impossible for classic computers to solve. Quantum computing is a new way of computing which takes advantage of quantum superposition and entanglement. It changes how such problems are approached and is not constrained by some of the classic computational complexity. Studies have shown that quantum computing can offer significant advantages over classical computing in many fields. The application of quantum computing has been constrained by the unavailability of actual quantum computers. In the past decade, there has been the rapid development of the large-scale quantum computer. However, software development for quantum computing is slow in many fields. In our study, we apply quantum computing to a multi-asset portfolio simulation. The simulation is based on historic data, covariance, and expected returns, all calculated using quantum computing. Although technically a solvable problem for classical computing, we believe the software development is important to the future application of quantum computing in finance. We conducted this study through simulation of a quantum computer and the use of Rensselaer Polytechnic Institute’s IBM quantum computer.
Complexity vs Empirical Score
- Math Complexity: 4.5/10
- Empirical Rigor: 5.0/10
- Quadrant: Street Traders — empirical and applied, lower math complexity
Why this score: The paper applies quantum computing algorithms to portfolio simulation using historical data and covariance matrices, but the mathematical exposition is largely conceptual and lacks deep derivations, while the empirical work involves actual quantum hardware runs and backtest-like simulations, albeit with limited statistical validation.
Research Flowchart
flowchart TD
A["Research Goal<br>Apply Quantum Computing<br>to Multi-Period Asset Allocation"] --> B["Data Preparation<br>Historic Market Data"]
B --> C["Key Methodology<br>Quantum Simulation<br>& RPI IBM Q Computer"]
C --> D{"Computational Process<br>Calculate Covariance &<br>Expected Returns"}
D --> E["Quantum Portfolio Optimization<br>Efficient Frontier Generation"]
E --> F["Key Findings/Outcomes<br>Feasibility of Quantum Finance<br>Software Development Pathway"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper applies quantum computing to simulate a multi‑asset, multi‑period portfolio allocation, calculating historic data, covariance and expected returns using quantum methods.
Source sentence
In our study, we apply quantum computing to a multi-asset portfolio simulation. The simulation is based on historic data, covariance, and expected returns, all calculated using quantum computing.
Assumes 5
- Asset returns follow a multivariate log‑normal distribution. model
Source sentence
The simulations assume multi-variate log-normal distribution and are done monthly.
- Three asset classes are represented with three qubits each (qubit array [3,3,3]). execution
Source sentence
In our study, we allocate 3 qubits to each of the three asset classes, re-sulting in a qubit array of [3, 3, 3].
- Simulations are performed on a monthly time step. model
Source sentence
The simulations assume multi-variate log-normal distribution and are done monthly.
- Expected returns are fixed at 10%, 10% and 6% for the three asset classes. data
Source sentence
The expected returns are chosen to be 10%, 10%, and 6% respectively for the three asset classes.
Show 1 more
- Covariance matrix is estimated from the past 20 years of historical index data. data
Source sentence
We used the past 20 years’ historical data of S&P 500, MSCI All Country World Index ex US, and Bloomberg Global Aggregate indices as the proxy to cal-culate the volatilities and covariance matrix.
Data
- S&P 500 index data market-prices public
Source sentence
We used the past 20 years’ historical data of S&P 500, MSCI All Country World Index ex US, and Bloomberg Global Aggregate indices as the proxy to cal-culate the volatilities and covariance matrix.
- MSCI All Country World Index ex US market-prices public
Source sentence
We used the past 20 years’ historical data of S&P 500, MSCI All Country World Index ex US, and Bloomberg Global Aggregate indices as the proxy to cal-culate the volatilities and covariance matrix.
- Bloomberg Global Aggregate index market-prices commercial
Source sentence
We used the past 20 years’ historical data of S&P 500, MSCI All Country World Index ex US, and Bloomberg Global Aggregate indices as the proxy to cal-culate the volatilities and covariance matrix.
Costs
Unclear
Finds 4
- On the quantum emulator, building a circuit for the [3,3,3] qubit array takes a few seconds. performance
Source sentence
On the quantum emulator, running a qubit array of [3, 3, 3] allows the circuit to be built within a few seconds. Figure 3.
- Increasing the array to [4,4,4] raises build time to approximately one minute on the emulator. performance
Source sentence
However, increasing the array to [4, 4, 4] results in a cir-cuit that takes approximately one minute to construct.
- A [5,5,5] qubit array requires about 20 minutes to construct on the emulator. performance
Source sentence
The most extensive test we performed used a qubit array of [5, 5, 5], which required about 20 minutes to build.
- On a physical quantum computer, the [3,3,3] array completes in a few seconds, while [4,4,4] takes about 30 seconds, and [5,5,5] fails after roughly 6 minutes. performance
Source sentence
When running the circuit on a physical quantum com-puter, the [3, 3, 3] qubit array completed in just a few sec-onds. With the [4, 4, 4] qubit array, the build time in-creased to 30 seconds, and with the [5, 5, 5] qubit array, the quantum computer failed after around 6 minutes.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 9 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (7)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1997) — link
- Large-Scale Simulation of Shor’s Quantum Factoring Algorithm (2023) — link
- A fast quantum mechanical algorithm for database search (1996) — link
- Quantum Optimization: Potential, Challenges, and the Path Forward (2023) — link
- An Introductory Course on Quantum Mechanics (2010) — link
- Superposition and Entanglement: Pillars of Quantum Information Processing (2007) — link
- Quantum computing with Q iskit (2024) — link
0 of 7 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.