Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

By Gili Rosenberg, Poya Haghnegahdar, Phil Goddard, Peter Carr, Kesheng Wu, & Marcos López de Prado

We solve a multi-period portfolio optimization problem using D-Wave Systems’ quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and temporary market impact), and, significantly, the solution does not require the inversion of a covariance matrix. The discrete multi-period portfolio optimization problem we solve is significantly harder than the continuous variable problem. We present insight into how results may be improved using suitable software enhancements, and why current quantum annealing technology limits the size of problem that can be successfully solved today. The formulation presented is specifically designed to be scalable, with the expectation that as quantum annealing technology improves, larger problems will be solvable using the same techniques.
Journal reference: IEEE Journal of Selected Topics in Signal Processing (JSTSP), Volume 10, Issue 6, 2016 and Proc. of the 8th Workshop on High Performance Computational Finance (WHPCF), p. 7, ACM, 2015 and The Journal of Investing, Fall 2016, Vol. 25, No. 3: pp. 81-87

Most Recent Papers

Neural Error Mitigation of Near-Term Quantum Simulations

By Elizabeth R. Bennewitz, Florian Hopfmueller, Bohdan Kulchytskyy, Juan Carrasquilla, & Pooya Ronagh

One of the promising applications of early quantum computers is the simulation of quantum systems. Variational methods for near-term quantum computers, such as the variational quantum eigensolver (VQE), are a promising approach to finding ground states of quantum systems relevant in physics, chemistry, and materials science…

Benchmark Study of Quantum Algorithms for Combinatorial Optimization: Unitary versus Dissipative

By Krishanu Sankar, Artur Scherer, Satoshi Kako, Sam Reifenstein, Navid Ghadermarzy, Willem B. Krayenhoff, Yoshitaka Inui, Edwin Ng, Tatsuhiro Onodera, Pooya Ronagh, & Yoshihisa Yamamoto

We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the Dürr-Hoyer algorithm for quantum minimum finding (DH-QMF) that is based on Grover’s search. We use MaxCut problems as our reference for comparison, and time-to-solution (TTS) as a practical measure of performance for these optimization algorithms…

Scaling Up Electronic Structure Calculations on Quantum Computers: The Frozen Natural Orbital Based Method of Increments

By Prakash Verma, Lee Huntington, Marc Coons, Yukio Kawashima, Takeshi Yamazaki, & Arman Zaribafiyan

The method of increments and frozen natural orbital (MI-FNO) framework is introduced to help expedite the application of noisy, intermediate-scale quantum (NISQ) devices for quantum chemistry simulations. The MI-FNO framework provides a systematic reduction of the occupied and virtual orbital spaces for quantum chemistry simulations. The correlation energies of the resulting increments from the MI-FNO reduction can then be solved by various algorithms, including quantum algorithms such as the phase estimation algorithm and the variational quantum eigensolver (VQE)…

Variationally Scheduled Quantum Simulation

By Shunji Matsuura, Samantha Buck, Valentin Senicourt, & Arman Zaribafiyan

Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation (ASP). In the present work, we investigate a variational method for determining the optimal scheduling procedure within the context of ASP. In the absence of quantum error correction, running a quantum device for any meaningful amount of time causes a system to become susceptible to the loss of relevant information…

Efficient and Accurate Electronic Structure Simulation Demonstrated on a Trapped-Ion Quantum Computer

By Yukio Kawashima, Marc P. Coons, Yunseong Nam, Erika Lloyd, Shunji Matsuura, Alejandro J. Garza, Sonika Johri, Lee Huntington, Valentin Senicourt, Andrii O. Maksymov, Jason H. V. Nguyen, Jungsang Kim, Nima Alidoust, Arman Zaribafiyan, & Takeshi Yamazaki

Quantum computers have the potential to perform accurate and efficient electronic structure calculations, enabling the simulation of properties of materials. However, today’s noisy, intermediate-scale quantum (NISQ) devices have a limited number of qubits and gate operations due to the presence of errors. Here, we propose a systematically improvable end-to-end pipeline to alleviate these limitations…