Paper: arXiv 2308.13063
Authors: A. Ege Yilmaz, Stefan Stettler, Thomas Ankenbrand, Urs Rhyner
Abstract
We present explicit oracles designed to be used in Grover’s algorithm to match investor preferences. Specifically, the oracles select portfolios with returns and standard deviations exceeding and falling below certain thresholds, respectively. One potential use case for the oracles is selecting portfolios with the best Sharpe ratios. We have implemented these algorithms using quantum simulators.
Complexity vs Empirical Score
- Math Complexity: 7.5/10
- Empirical Rigor: 2.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper leverages advanced quantum algorithms like Grover search and phase estimation, involving substantial mathematical formalism and complexity, but implementation is limited to quantum simulators without real-world data, backtests, or performance metrics.
Research Flowchart
flowchart TD A["Research Goal<br>Quantum Portfolio Selection"] --> B["Data Input<br>Asset Returns & Volatility"] B --> C["Methodology<br>Design Grover Oracles"] C --> D["Oracles for Thresholds<br>High Returns & Low Std Dev"] D --> E["Computational Process<br>Grover's Algorithm Execution"] E --> F["Outcome<br>Optimized Portfolio via Sharpe Ratio"] F --> G["Implementation<br>Quantum Simulators"]
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 proposes explicit quantum oracles for Grover's algorithm that select portfolios based on investor preference thresholds for returns and standard deviations, enabling portfolio selection such as maximizing Sharpe ratios.
Source sentence
We present explicit oracles designed to be used in Grover's algorithm to match investor preferences. Specifically, the oracles select portfolios with returns and standard deviations exceeding and falling below certain thresholds, respectively.
Assumes 3
- Investor preferences are maximized by selecting portfolios with returns higher and standard deviations lower than desired threshold values. other
Source sentence
In the following, we assume that the investor preferences are maximized by selecting portfolios with returns and standard deviations higher and lower than the desired threshold values, respectively.
- The risk‑return pairs of the optimal (efficient) portfolios are available as input to the quantum algorithms. data
Source sentence
In this context, the hypothesis posits that by utilizing Grover-based algorithms with suitable oracles, it is possible to identify portfolios that maximize investor prefer-ences, assuming the risk-return pairs of the optimal portfolios are available as input.
- All portfolio return and risk values are normalized to lie in the range [0, 1). model
Source sentence
For simplicity, we assume that all values are in the range [0, 1).
Data
No dataset named in the text.
Costs
Not applicable
Finds 2
- Using the designed oracles within the Quantum Exponential Search (QES) algorithm successfully identifies desired portfolios that meet specified return and risk thresholds. theoretical
Source sentence
The first part of our implementation shows that the desired portfolios with specified risks and returns are found by employing our oracles in QES.
- The index of the portfolio with the highest Sharpe ratio is correctly obtained by applying the Grover Adaptive Search (GAS) circuit on the efficient‑frontier portfolio set. performance
Source sentence
Then, the index of the portfolio with the highest Sharpe ratio is successfully obtained by using Circuit 2 in GAS.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 7 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
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.