We use an optimization procedure based on simulated bifurcation (SB) to solve the integer portfolio and trading trajectory problem with an unprecedented computational speed. The underlying algorithm is based on a classical description of quantum adiabatic evolutions of a network of non-linearly interacting oscillators. This formulation has already proven to beat state of the art computation times for other NP-hard problems and is expected to show similar performance for certain portfolio optimization problems. Inspired by such we apply the SB approach to the portfolio integer optimization problem with quantity constraints and trading activities. We show first numerical results for portfolios of up to 1000 assets, which already confirm the power of the SB algorithm for its novel use-case as a portfolio and trading trajectory optimizer.
@article{arxiv.2009.08412,
title = {Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation},
author = {Kyle Steinhauer and Takahisa Fukadai and Sho Yoshida},
journal= {arXiv preprint arXiv:2009.08412},
year = {2020}
}