2025/02/06 by Ying Chen, Thorsten Koch, Chen, Ying +4 · 2 citations
Computer Science · Economics, Econometrics and Finance · #Complex Systems and Time Series Analysis #Computational Complexity (cs.CC) #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Stochastic processes and financial applications
paper · pdf · doi:10.48550/arxiv.2502.05226
openalex publication_date 2025/02/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Quantum computing is poised to transform the financial industry, yet its advantages over traditional methods have not been evidenced. As this technology rapidly evolves, benchmarking is essential to fairly evaluate and compare different computational strategies. This study presents a challenging yet solvable problem of large-scale dynamic portfolio optimization under realistic market conditions with frictions. We frame this issue as a Quadratic Unconstrained Binary Optimization (QUBO) problem, compatible with digital computing and ready for quantum computing, to establish a reliable benchmark. By applying the latest solvers to real data, we release benchmarks that help verify true advancements in dynamic trading strategies, either quantum or digital computing, ensuring that reported improvements in portfolio optimization are based on robust, transparent, and comparable metrics.