Paper: arXiv 2507.03963
Authors: Yen Jui Chang, Wei-Ting Wang, Yun-Yuan Wang, Chen-Yu Liu, Kuan-Cheng Chen, Ching-Ray Chang
Abstract
Financial markets are noisy yet contain a latent graph-theoretic structure that can be exploited for superior risk-adjusted returns. We propose a quantum stochastic walk (QSW) optimizer that embeds assets in a weighted graph: nodes represent securities while edges encode the return-covariance kernel. Portfolio weights are derived from the walk’s stationary distribution. Three empirical studies support the approach. (i) For the top 100 S&P 500 constituents over 2016-2024, six scenario portfolios calibrated on 1- and 2-year windows lift the out-of-sample Sharpe ratio by up to 27% while cutting annual turnover from 480% (mean-variance) to 2-90%. (ii) A \(5^{“4”}=625\)-point grid search identifies a robust sweet spot, \(α,λ\lesssim0.5\) and \(ω\in[“0.2,0.4”]\), that delivers Sharpe \(\approx0.97\) at \(\le 5%\) turnover and Herfindahl-Hirschman index \(\sim0.01\). (iii) Repeating the full grid on 50 random 100-stock subsets of the S&P 500 adds 31,350 back-tests: the best-per-draw QSW beats re-optimised mean-variance on Sharpe in 54% of cases and always wins on trading efficiency, with median turnover 36% versus 351%. Overall, QSW raises the annualized Sharpe ratio by 15% and cuts turnover by 90% relative to classical optimisation, all while respecting the UCITS 5/10/40 rule. These results show that hybrid quantum-classical dynamics can uncover non-linear dependencies overlooked by quadratic models and offer a practical, low-cost weighting engine for themed ETFs and other systematic mandates.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 8.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper introduces advanced mathematical constructs from quantum mechanics (Hamiltonian generators, density matrices, stochastic walks) and complex network theory. It provides extensive empirical validation with a large grid search (625 points), 31,350 back-tests across random universes, and robust performance metrics (Sharpe ratio, turnover, HHI) over a long historical period.
Research Flowchart
flowchart TD A["Research Goal: Validate QSW optimizer for portfolio<br>weighting vs. classical mean-variance"] --> B["Data Input:<br>S&P 500 constituents (2016-2024)<br>50 random 100-stock subsets"] B --> C["Methodology: Graph Embedding<br>Nodes = Securities<br>Edges = Return-Covariance Kernel"] C --> D["Computational Process:<br>Quantum Stochastic Walk<br>Calibration via Grid Search (α, λ, ω)<br>Derive Stationary Distribution"] D --> E["Key Finding 1: Performance<br>Up to 27% higher Sharpe Ratio<br>vs. Mean-Variance"] D --> F["Key Finding 2: Efficiency<br>90% turnover reduction<br>(Median 36% vs 351%)"] D --> G["'Key Finding 3: Robustness<br>Works under UCITS constraints<br>Optimal α,λ ≤ 0.5, ω ∈ [0.2,0.4]"]
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 a quantum stochastic walk (QSW) optimizer that embeds assets in a weighted graph and derives portfolio weights from the walk's stationary distribution.
Source sentence
We propose a quantum stochastic walk (QSW) optimizer that embeds assets in a weighted graph: nodes represent securities while edges encode the return-covariance kernel. Portfolio weights are derived from the walk's stationary distribution.
Assumes 6
- The QSW dynamics converge to a unique stationary state for any ω>0. model
Source sentence
if we set cij = Gij where G is the Google matrix (2), then for any ω > 0 the quantum dynamical semigroup generated by Eq. (4) is primitive: a unique, full-rank stationary state ρ∞exists and ρ(t) →ρ∞exponentially fast.
- Daily returns are computed over a training window of length T. data
Source sentence
We encode financial data on the graph by taking n financial assets with daily returns {ri,t} over a training window of length T.
- Portfolios are rebalanced quarterly. execution
Source sentence
All strategies are evaluated in a common backtesting framework with quarterly rebalancing.
- Turnover above roughly 200% per year is considered prohibitively expensive. execution
Source sentence
annual turnover above roughly 200% is often considered prohibitively expensive because of spread and market-impact costs, whereas turnover below about 50% is usually viewed as readily implementable.
Show 2 more
- The universe consists of 100 top‑S&P 500 constituents selected point‑in‑time to avoid survivorship bias. data
Source sentence
we draw 100 constituents from the S&P 500 members active at that time; at each quarterly rebal‑ance we remove any delisted names
- Self‑loops encode asset‑specific Sharpe information and edges penalize correlation. model
Source sentence
we map expected returns and covariances to a weighted, directed graph in which self-loops encode asset-specific Sharpe information and inter-node edges penalize correlation
Data
1990 – 2024 · S&P 500 stocks · equities
- S&P 500 daily adjusted close prices market-prices public
Source sentence
Historical daily adjusted close prices from 1988-01-01 to 2024-12-31 are obtained from Yahoo Finance.
Costs
Not modeled
Source sentence
High-turnover strategies face substantial transaction costs, price impact during execution, and capacity constraints that can erode theoretical performance gains in practice
Finds 5
Sharpe 0.98 (benchmark 0.86) · max drawdown 19.3%
- QSW lifts out‑of‑sample Sharpe ratio by up to 27% while cutting annual turnover from 480% (mean‑variance) to 2‑90%. performance
Source sentence
six scenario portfolios calibrated on 1- and 2-year windows lift the out-of-sample Sharpe ratio by up to 27% while cutting annual turnover from 480% (mean-variance) to 2-90%.
- A grid search identifies a robust sweet spot (α,λ≲0.5, ω∈[0.2,0.4]) delivering Sharpe ≈0.97 at ≤5% turnover and HHI ≈0.01. performance
Source sentence
A $5^{4}=625$-point grid search identifies a robust sweet spot, $α,λ\lesssim0.5$ and $ω\in[0.2,0.4]$, that delivers Sharpe $\approx0.97$ at $\le 5\%$ turnover and Herfindahl-Hirschman index $\sim0.01$.
- Across 31,350 back‑tests, the best‑per‑draw QSW beats re‑optimised mean‑variance on Sharpe in 54% of cases and always wins on trading efficiency (median turnover 36% vs 351%). performance
Source sentence
the best-per-draw QSW beats re-optimised mean-variance on Sharpe in 54% of cases and always wins on trading efficiency, with median turnover 36% versus 351%.
- Overall QSW raises annualized Sharpe by 15% and cuts turnover by 90% relative to classical optimisation, while respecting UCITS 5/10/40 rule. performance
Source sentence
Overall, QSW raises the annualized Sharpe ratio by 15% and cuts turnover by 90% relative to classical optimisation, all while respecting the UCITS 5/10/40 rule.
- In a 34‑year, 30‑universe dynamic experiment QSW achieves ~23% CAGR, Sharpe near 1.0, and turnover around 200% (vs 300‑400% for MPT). performance
Source sentence
... The dynamic optimizer accepts a higher average turnover (around 200% per year) than in the static Phase 1 experiments
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 29 related papers). Coverage is partial, so this is neither replication nor refutation.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (86)
- Quantum Navigation and Ranking in Complex Networks (2012) — link
- Quantum stochastic walks: A generalization of classical random walks and quantum walks (2010) — link
- Open Quantum Random Walks (2012) — link
- Quantum Google in a Complex Network (2013) — link
- Continuous-time quantum walk based centrality testing on weighted graphs (2022) — link
- Implementation of quantum stochastic walks for function approximation, two-dimensional data classification, and sequence classification (2022) — link
- Centrality measure based on continuous-time quantum walks and experimental realization (2017)
- Quantum Random Walks (1993) — link
and 78 more
- Quantum computation and decision trees (1998) — link
- Quantum random walks: An introductory overview (2003) — link
- Exponential algorithmic speedup by a quantum walk (2003) — link
- Quantum random-walk search algorithm (2003) — link
- A Brief History of the GKLS Equation (2017) — link
- Deep learning with long short-term memory networks for financial market predictions (2018)
- Deep learning for portfolio optimization (2021) — link
- Empirical asset pricing via machine learning (2020) — link
- Risk budgeting portfolio optimization with deep reinforcement learning (2023) — link
- A deep reinforcement learning framework for the financial portfolio management problem (2017) — link
- Explainable Artificial Intelligence ( XAI ): Concepts, taxonomies, opportunities and challenges (2020) — link
- Risk-Adjusted Deep Reinforcement Learning for Portfolio Optimization: A Multi-reward Approach (2025)
- Advances in Financial Machine Learning (2018)
- Pseudo-mathematics and financial charlatanism: The effects of backtest overfitting on out-of-sample performance (2014)
- cuPyNumeric : A NumPy -Compatible Library for NVIDIA GPU Calculations (2024)
- CuPy : A NumPy -Compatible Library for NVIDIA GPU Calculations (2017)
- Portfolio Selection (1952) — link
- Capital Asset Prices: A Theory of Market Equilibrium Under Conditions of Risk (1964) — link
- Liquidity Preference as Behavior Towards Risk (1958) — link
- An Analytic Derivation of the Efficient Portfolio Frontier (1972) — link
- Robust Portfolio Optimization and Management (2007) — link
- Global Portfolio Optimization (1992) — link
- Introduction to Econophysics: Correlations and Complexity in Finance (1999) — link
- Returns to Buying Winners and Selling Losers: Implications for Stock Market Efficiency (1993) — link
- Practical Methods of Optimization (2013) — link
- Hierarchical structure in financial markets (1999) — link
- Correlation, hierarchies, and networks in financial markets (2010) — link
- Spread of Risk Across Financial Markets: Better to Invest in the Peripheries (2013) — link
- Dependency Network and Node Influence: Application to the Study of Financial Markets (2012) — link
- Networks of Financial Market Dependencies: Structure and Dynamics (2015) — link
- Dynamic asset trees and Black Monday (2003) — link
- Robust Portfolio Selection Problems (2003) — link
- Portfolio Selection with Parameter and Model Uncertainty: A Multi-Prior Approach (2007) — link
- The Markowitz Optimization Enigma: Is ‘Optimized’ Optimal? (1989) — link
- Coherent Measures of Risk (1999) — link
- Optimization of Conditional Value-at-Risk (2000) — link
- Optimal Versus Naive Diversification: How Inefficient is the 1/ N Portfolio Strategy? (2009) — link
- Convex Optimization (2004) — link
- Extreme Correlation of International Equity Markets (2001) — link
- Asymmetric Correlations of Equity Portfolios (2002) — link
- Empirical Properties of Asset Returns: Stylized Facts and Statistical Issues (2001) — link
- Heuristics for Cardinality Constrained Portfolio Optimisation (2000) — link
- Computational Study of a Family of Mixed-Integer Quadratic Programming Problems (1996) — link
- Optimal Execution of Portfolio Transactions (2001) — link
- Active Portfolio Management: A Quantitative Approach for Producing Superior Returns and Controlling Risk (1999)
- On the Sensitivity of Mean-Variance-Efficient Portfolios to Changes in Asset Means: Some Analytical and Computational Results (1991) — link
- The Effect of Errors in Means, Variances, and Covariances on Optimal Portfolio Choice (1993) — link
- Mutual Fund Performance (1966)
- Statistics of Sharpe Ratios (2002)
- Robust Performance Hypothesis Testing with the Sharpe Ratio (2008)
- A New Interpretation of Information Rate (1956) — link
- The Properties of Equally Weighted Risk Contribution Portfolios (2010) — link
- The Sharpe ratio (1994)
- Backtesting (2017)
- The implementation shortfall: Paper versus reality (1988) — link
- Trading Costs (2018) — link
- The Science of Algorithmic Trading and Portfolio Management (2013) — link
- Quantum computational finance: Monte Carlo pricing of financial derivatives (2018) — link
- Quantum Risk Analysis (2019) — link
- Quantum Algorithms for Portfolio Optimization (2019) — link
- Exploiting quantum computing in portfolio optimization (2023) — link
- Quantum-inspired portfolio optimization with graph neural networks (2023) — link
- Solving the optimal trading trajectory problem using a quantum annealer (2016)
- Quantum Computing for Finance: Overview and Prospects (2019) — link
- Quantum Computing for Finance: State-of-the-Art and Future Prospects (2020) — link
- On the Complexity and Prospects of Quantum Finance (2021) — link
- Option Pricing Using Quantum Computers (2020) — link
- The New VIX and Implications for Volatility Derivatives (2003) — link
- Centrality measures and thermodynamic formalism for complex networks (2011)
- PageRank beyond the Web (2015) — link
- The anatomy of a large-scale hypertextual web search engine (1998) — link
- Algebraic Conditions for the Approach to Equilibrium of an Open $N$-Level System (1977) — link
- Non-negative Matrices and Markov Chains (2006) — link
- Numerical Methods in Finance and Economics: A MATLAB -Based Introduction (2018)
- On the Numerical Solution of the Equation by Which in Technical Questions Frequencies of Small Oscillations of Material Systems are Determined (1931)
- Iterative Methods for Sparse Linear Systems (2003)
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States (2014) — link
- Variational Quantum Algorithms (2021) — link
0 of 86 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.