IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1508.06182.html
   My bibliography  Save this paper

Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

Author

Listed:
  • Gili Rosenberg
  • Poya Haghnegahdar
  • Phil Goddard
  • Peter Carr
  • Kesheng Wu
  • Marcos L'opez de Prado

Abstract

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.

Suggested Citation

  • Gili Rosenberg & Poya Haghnegahdar & Phil Goddard & Peter Carr & Kesheng Wu & Marcos L'opez de Prado, 2015. "Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer," Papers 1508.06182, arXiv.org, revised Aug 2016.
    • Handle: RePEc:arx:papers:1508.06182
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1508.06182
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nicolae Gârleanu & Lasse Heje Pedersen, 2013. "Dynamic Trading with Predictable Returns and Transaction Costs," Journal of Finance, American Finance Association, vol. 68(6), pages 2309-2340, December.
    2. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    3. Corazza, Marco & Favaretto, Daniela, 2007. "On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1947-1960, February.
    4. Pierre Bonami & Miguel A. Lejeune, 2009. "An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints," Post-Print hal-00421756, HAL.
    5. Galluccio, Stefano & Bouchaud, Jean-Philippe & Potters, Marc, 1998. "Rational decisions, random matrices and spin glasses," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 259(3), pages 449-456.
    6. Mansini, Renata & Speranza, Maria Grazia, 1999. "Heuristic algorithms for the portfolio selection problem with minimum transaction lots," European Journal of Operational Research, Elsevier, vol. 114(2), pages 219-233, April.
    7. Hans Kellerer & Renata Mansini & M. Speranza, 2000. "Selecting Portfolios with Fixed Costs and Minimum Transaction Lots," Annals of Operations Research, Springer, vol. 99(1), pages 287-304, December.
    8. N. J. Jobst & M. D. Horniman & C. A. Lucas & G. Mitra, 2001. "Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints," Quantitative Finance, Taylor & Francis Journals, vol. 1(5), pages 489-501.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Adam Bouland & Wim van Dam & Hamed Joorati & Iordanis Kerenidis & Anupam Prakash, 2020. "Prospects and challenges of quantum finance," Papers 2011.06492, arXiv.org.
    2. Kyle Steinhauer & Takahisa Fukadai & Sho Yoshida, 2020. "Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation," Papers 2009.08412, arXiv.org.
    3. Xiaoyuan Liu & Hayato Ushijima-Mwesigwa & Avradip Mandal & Sarvagya Upadhyay & Ilya Safro & Arnab Roy, 2022. "Leveraging special-purpose hardware for local search heuristics," Computational Optimization and Applications, Springer, vol. 82(1), pages 1-29, May.
    4. Samuel Fern'andez-Lorenzo & Diego Porras & Juan Jos'e Garc'ia-Ripoll, 2020. "Hybrid quantum-classical optimization for financial index tracking," Papers 2008.12050, arXiv.org, revised Oct 2021.
    5. Dylan Herman & Cody Googin & Xiaoyuan Liu & Alexey Galda & Ilya Safro & Yue Sun & Marco Pistoia & Yuri Alexeev, 2022. "A Survey of Quantum Computing for Finance," Papers 2201.02773, arXiv.org, revised Jun 2022.
    6. Davide Venturelli & Alexei Kondratyev, 2018. "Reverse Quantum Annealing Approach to Portfolio Optimization Problems," Papers 1810.08584, arXiv.org, revised Oct 2018.
    7. Martin Vesely, 2023. "Finding the Optimal Currency Composition of Foreign Exchange Reserves with a Quantum Computer," Papers 2303.01909, arXiv.org.
    8. Samuel Mugel & Enrique Lizaso & Roman Orus, 2020. "Use Cases of Quantum Optimization for Finance," Papers 2010.01312, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
    2. Kyle Steinhauer & Takahisa Fukadai & Sho Yoshida, 2020. "Solving the Optimal Trading Trajectory Problem Using Simulated Bifurcation," Papers 2009.08412, arXiv.org.
    3. Zhou, Zhongbao & Jin, Qianying & Xiao, Helu & Wu, Qian & Liu, Wenbin, 2018. "Estimation of cardinality constrained portfolio efficiency via segmented DEA," Omega, Elsevier, vol. 76(C), pages 28-37.
    4. Cristiano Arbex Valle, 2024. "Portfolio optimisation: bridging the gap between theory and practice," Papers 2407.00887, arXiv.org, revised Sep 2024.
    5. Tiago P. Filomena & Miguel A. Lejeune, 2014. "Warm-Start Heuristic for Stochastic Portfolio Optimization with Fixed and Proportional Transaction Costs," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 308-329, April.
    6. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    7. Ralph Steuer & Markus Hirschberger & Kalyanmoy Deb, 2016. "Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers," Journal of Global Optimization, Springer, vol. 64(1), pages 33-48, January.
    8. Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 518-535.
    9. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2015. "Linear vs. quadratic portfolio selection models with hard real-world constraints," Computational Management Science, Springer, vol. 12(3), pages 345-370, July.
    10. Buckley, Winston & Long, Hongwei & Marshall, Mario, 2016. "Numerical approximations of optimal portfolios in mispriced asymmetric Lévy markets," European Journal of Operational Research, Elsevier, vol. 252(2), pages 676-686.
    11. Wei Xu & Jie Tang & Ka Fai Cedric Yiu & Jian Wen Peng, 2024. "An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 690-704, March.
    12. Liu, Wenbin & Zhou, Zhongbao & Liu, Debin & Xiao, Helu, 2015. "Estimation of portfolio efficiency via DEA," Omega, Elsevier, vol. 52(C), pages 107-118.
    13. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    14. Eduardo Bered Fernandes Vieira & Tiago Pascoal Filomena, 2020. "Liquidity Constraints for Portfolio Selection Based on Financial Volume," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 1055-1077, December.
    15. Buckley, Winston S. & Brown, Garfield O. & Marshall, Mario, 2012. "A mispricing model of stocks under asymmetric information," European Journal of Operational Research, Elsevier, vol. 221(3), pages 584-592.
    16. Chien-Ming Chen & Joe Zhu, 2011. "Efficient Resource Allocation via Efficiency Bootstraps: An Application to R&D Project Budgeting," Operations Research, INFORMS, vol. 59(3), pages 729-741, June.
    17. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    18. Philipp Baumann & Norbert Trautmann, 2013. "Portfolio-optimization models for small investors," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 345-356, June.
    19. Corazza, Marco & Favaretto, Daniela, 2007. "On the existence of solutions to the quadratic mixed-integer mean-variance portfolio selection problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1947-1960, February.
    20. Fereshteh Vaezi & Seyed Jafar Sadjadi & Ahmad Makui, 2019. "A portfolio selection model based on the knapsack problem under uncertainty," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-19, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1508.06182. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.