Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing

被引:0
作者
Xu, Hanjing [1 ]
Dasgupta, Samudra [2 ,3 ,4 ]
Pothen, Alex [1 ]
Banerjee, Arnab [2 ,3 ]
机构
[1] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47906 USA
[2] Purdue Univ, Dept Phys, W Lafayette, IN 47906 USA
[3] Oak Ridge Natl Lab, Quantum Comp Inst, Oak Ridge, TN 37831 USA
[4] Univ Tennessee, Bredesen Ctr, Knoxville, TN 37996 USA
关键词
portfolio optimization problem; Quadratic Unconstrained Binary Optimization (QUBO); quantum annealing; hybrid algorithm; COMPUTATIONAL-COMPLEXITY; OPTIMIZATION; RISK;
D O I
10.3390/e25030541
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Recent advances in quantum hardware offer new approaches to solve various optimization problems that can be computationally expensive when classical algorithms are employed. We propose a hybrid quantum-classical algorithm to solve a dynamic asset allocation problem where a target return and a target risk metric (expected shortfall) are specified. We propose an iterative algorithm that treats the target return as a constraint in a Markowitz portfolio optimization model, and dynamically adjusts the target return to satisfy the targeted expected shortfall. The Markowitz optimization is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. The use of the expected shortfall risk metric enables the modeling of extreme market events. We compare the results from D-Wave's 2000Q and Advantage quantum annealers using real-world financial data. Both quantum annealers are able to generate portfolios with more than 80% of the return of the classical optimal solutions, while satisfying the expected shortfall. We observe that experiments on assets with higher correlations tend to perform better, which may help to design practical quantum applications in the near term.
引用
收藏
页数:19
相关论文
共 46 条
  • [41] Solving dynamic double row layout problem via combining simulated annealing and mathematical programming
    Wang, Shengli
    Zuo, Xingquan
    Liu, Xueqing
    Zhao, Xinchao
    Li, Jianqiang
    APPLIED SOFT COMPUTING, 2015, 37 : 303 - 310
  • [42] Solving Dynamic Double-row Layout Problem via an Improved Simulated Annealing Algorithm
    Wang, Shengli
    Zuo, Xingquan
    Zhao, Xinchao
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1299 - 1304
  • [43] Parallel machine scheduling with dynamic resource allocation via a master-slave genetic algorithm
    Fu, Yaping
    Tian, Guangdong
    Li, Zhiwu
    Wang, Zhenling
    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2018, 13 (05) : 748 - 756
  • [44] Content-aware rate allocation for efficient video streaming via dynamic network utility maximization
    Hajiesmaili, Mohammad H.
    Khonsari, Ahmad
    Sehati, Ali
    Talebi, Mohammad Sadegh
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2012, 35 (06) : 2016 - 2027
  • [45] Simulating Two-Dimensional Square J1-J2 Ising Model via Quantum Annealing
    Cha, Jeonghyeok
    Kim, Heung-Sik
    JOURNAL OF THE KOREAN MAGNETICS SOCIETY, 2022, 32 (04): : 180 - 185
  • [46] Optimisation of spatiotemporal context-constrained full-view area coverage deployment in camera sensor networks via quantum annealing
    Li, Jie
    Li, Zhenqiang
    Yao, Long
    Wang, Ke
    Li, Jialin
    Lu, Yao
    Hu, Chuli
    INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2024, 38 (09) : 1827 - 1855