Block Coordinate Descent for Dynamic Portfolio Optimization on Finite-Precision Coherent Ising Machines

Read full text Summarise with VIRAT
Authors: Keming He, Yuehan Zhang, Hongshun Yao, Jin-Guo Liu, Xin Wang
Cited by: 0
References: 30

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Coherent Ising machines (CIMs) have emerged as specialized quantum hardware for large-scale combinatorial optimization. However, for large instances that remain challenging for classical methods, some platforms support only finite-precision inputs, and the required scaling and quantization can degrade solution quality. Dynamic portfolio optimization (DPO) can be formulated as a quadratic unconstrained binary optimization (QUBO) problem, but large instances are especially vulnerable to precision loss under global scaling. We propose a block coordinate descent method that decomposes the DPO model along the time dimension and iteratively solves compact time-block subproblems on the device. Experiments on finite-precision CIM hardware show that the method enables these instances to be solved under hardware precision limits, yields portfolios competitive with classical benchmark solvers, and reduces runtime through fast CIM solution of the resulting subproblems. These results demonstrate the promise of finite-precision CIMs as a practical and scalable approach to structured large-scale combinatorial optimization.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Neural Networks and Reservoir Computing Risk and Portfolio Optimization

Publication details

Journal / source
arXiv (Cornell University)
Publication date
24 March 2026
Language
EN
Document type
Preprint