{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T07:19:34Z","timestamp":1773299974956,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Quantum Engineering Programme","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"name":"Quantum Engineering Programme","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"name":"Quantum Engineering Programme","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"DOI":"10.13039\/501100020314","name":"QuantERA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020314","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CQT Bridging Grant"},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["810115-DYNASNET"],"award-info":[{"award-number":["810115-DYNASNET"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s42484-026-00363-y","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:13:30Z","timestamp":1773234810000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Quantum-Classical Algorithm for Robust Optimization via Stochastic-Gradient Online Learning"],"prefix":"10.1007","volume":"8","author":[{"given":"Debbie","family":"Lim","sequence":"first","affiliation":[]},{"given":"Joao F.","family":"Doriguello","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Rebentrost","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"363_CR1","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.22331\/q-2024-11-20-1530","volume":"8","author":"J Allcock","year":"2024","unstructured":"Allcock J, Bao J, Doriguello JF, Luongo A, Santha M (2024) Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates. Quantum 8:1530. https:\/\/doi.org\/10.22331\/q-2024-11-20-1530","journal-title":"Quantum"},{"key":"363_CR2","unstructured":"Arora R (2009) On learning rotations. In: Bengio Y, Schuurmans D, Lafferty J, Williams C, Culotta A (eds) Advances in neural information processing systems, vol 22. Curran Associates, Inc., Vancouver, BC, Canada"},{"issue":"6","key":"363_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora S, Hazan E, Kale S (2012) The multiplicative weights update method: a meta-algorithm and applications. Theory Comput 8(6):121\u2013164. https:\/\/doi.org\/10.4086\/toc.2012.v008a006","journal-title":"Theory Comput"},{"key":"363_CR4","doi-asserted-by":"publisher","unstructured":"Arora S, Ge R, Kannan R, Moitra A (2012) Computing a nonnegative matrix factorization \u2013 provably. In: Proceedings of the forty-fourth annual ACM symposium on theory of computing. STOC \u201912. Association for Computing Machinery, New York, NY, USA, pp 145\u2013162. https:\/\/doi.org\/10.1145\/2213977.2213994","DOI":"10.1145\/2213977.2213994"},{"key":"363_CR5","doi-asserted-by":"publisher","unstructured":"Arora S, Kale S (2007) A combinatorial, primal-dual approach to semidefinite programs. In: Proceedings of the thirty-ninth annual ACM symposium on theory of computing. STOC \u201907. Association for Computing Machinery, New York, NY, USA, pp 227\u2013236. https:\/\/doi.org\/10.1145\/1250790.1250823","DOI":"10.1145\/1250790.1250823"},{"issue":"12","key":"363_CR6","doi-asserted-by":"publisher","first-page":"123010","DOI":"10.1088\/1367-2630\/17\/12\/123010","volume":"17","author":"S Arunachalam","year":"2015","unstructured":"Arunachalam S, Gheorghiu V, Jochym-O\u2019Connor T, Mosca M, Srinivasan PV (2015) On the robustness of bucket brigade quantum ram. New J Phys 17(12):123010. https:\/\/doi.org\/10.1088\/1367-2630\/17\/12\/123010","journal-title":"New J Phys"},{"key":"363_CR7","unstructured":"Arunachalam S, Maity R (2020) Quantum boosting. In: III HD, Singh A (eds) Proceedings of the 37th international conference on machine learning. Proceedings of Machine Learning Research, vol 119. PMLR, Vienna, Austria, pp 377\u2013387"},{"issue":"10","key":"363_CR8","doi-asserted-by":"publisher","first-page":"13902","DOI":"10.1109\/TNNLS.2023.3273228","volume":"35","author":"T Avant","year":"2023","unstructured":"Avant T, Morgansen KA (2023) Analytical bounds on the local lipschitz constants of relu networks. IEEE Trans Neural Netw Learn Syst 35(10):13902\u201313913","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"363_CR9","doi-asserted-by":"publisher","first-page":"041015","DOI":"10.1103\/PhysRevX.8.041015","volume":"8","author":"R Babbush","year":"2018","unstructured":"Babbush R, Gidney C, Berry DW, Wiebe N, McClean J, Paler A, Fowler A, Neven H (2018) Encoding electronic spectra in quantum circuits with linear t complexity. Phys Rev X 8:041015. https:\/\/doi.org\/10.1103\/PhysRevX.8.041015","journal-title":"Phys Rev X"},{"key":"363_CR10","unstructured":"Bellante A, Vanerio S, Zanero S (2025) Quantum sparse recovery and quantum orthogonal matching pursuit. arXiv:2510.06925"},{"key":"363_CR11","doi-asserted-by":"publisher","unstructured":"Belmega EV, Mertikopoulos P, Negrel R (2022) Online convex optimization in wireless networks and beyond: the feedback-performance trade-off. In: 2022 20th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp 298\u2013305. https:\/\/doi.org\/10.23919\/WiOpt56218.2022.9930534","DOI":"10.23919\/WiOpt56218.2022.9930534"},{"issue":"4","key":"363_CR12","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1137\/S1052623495291951","volume":"7","author":"A Ben-Tal","year":"1997","unstructured":"Ben-Tal A, Nemirovski A (1997) Robust truss topology design via semidefinite programming. SIAM J Optim 7(4):991\u20131016. https:\/\/doi.org\/10.1137\/S1052623495291951","journal-title":"SIAM J Optim"},{"issue":"4","key":"363_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769\u2013805. https:\/\/doi.org\/10.1287\/moor.23.4.769","journal-title":"Math Oper Res"},{"issue":"1","key":"363_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25(1):1\u201313. https:\/\/doi.org\/10.1016\/S0167-6377(99)00016-4","journal-title":"Oper Res Lett"},{"issue":"3","key":"363_CR15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal A, Nemirovski A (2002) Robust optimization \u2013 methodology and applications. Math Program 92(3):453\u2013480. https:\/\/doi.org\/10.1007\/s101070100286","journal-title":"Math Program"},{"issue":"3","key":"363_CR16","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1287\/opre.2015.1374","volume":"63","author":"A Ben-Tal","year":"2015","unstructured":"Ben-Tal A, Hazan E, Koren T, Mannor S (2015) Oracle-based robust optimization via online learning. Oper Res 63(3):628\u2013638. https:\/\/doi.org\/10.1287\/opre.2015.1374","journal-title":"Oper Res"},{"key":"363_CR17","doi-asserted-by":"publisher","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2000) Robustness. In: Wolkowicz H, Saigal R, Vandenberghe L (eds) Handbook of semidefinite programming: theory, algorithms, and applications. Springer, Boston, MA, pp 139\u2013162. https:\/\/doi.org\/10.1007\/978-1-4615-4381-7_6","DOI":"10.1007\/978-1-4615-4381-7_6"},{"key":"363_CR18","doi-asserted-by":"publisher","unstructured":"Ben-Tal A, Ghaoui LE, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton. https:\/\/doi.org\/10.1515\/9781400831050","DOI":"10.1515\/9781400831050"},{"key":"363_CR19","doi-asserted-by":"publisher","unstructured":"Ben-Tal A, Nemirovski A (2001) Lectures on modern convex optimization. Society for Industrial and Applied Mathematics, USA. https:\/\/doi.org\/10.1137\/1.9780898718829","DOI":"10.1137\/1.9780898718829"},{"key":"363_CR20","doi-asserted-by":"publisher","unstructured":"Berry DW, Childs AM, Cleve R, Kothari R, Somma RD (2014) Exponential improvement in precision for simulating sparse Hamiltonians. In: Proceedings of the forty-sixth annual ACM symposium on theory of computing. STOC \u201914. Association for Computing Machinery, New York, NY, USA, pp 283\u2013292. https:\/\/doi.org\/10.1145\/2591796.2591854","DOI":"10.1145\/2591796.2591854"},{"issue":"2","key":"363_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00220-006-0150-x","volume":"270","author":"DW Berry","year":"2007","unstructured":"Berry DW, Ahokas G, Cleve R, Sanders BC (2007) Efficient quantum algorithms for simulating sparse Hamiltonians. Commun Math Phys 270(2):359\u2013371. https:\/\/doi.org\/10.1007\/s00220-006-0150-x","journal-title":"Commun Math Phys"},{"key":"363_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-25960-2_7","volume-title":"Integer programming and combinatorial optimization","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Thiele A (2004) A robust optimization approach to supply chain management. In: Bienstock D, Nemhauser G (eds) Integer programming and combinatorial optimization. Springer, Berlin, Heidelberg, pp 86\u2013100"},{"issue":"3","key":"363_CR23","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Rev"},{"key":"363_CR24","doi-asserted-by":"crossref","unstructured":"Bhowmick A, D\u2019Souza M, Raghavan GS (2021) Lipbab: computing exact lipschitz constant of relu networks. In: International conference on artificial neural networks. Springer, pp 151\u2013162","DOI":"10.1007\/978-3-030-86380-7_13"},{"key":"363_CR25","doi-asserted-by":"crossref","unstructured":"Bottou L (1999) On-line learning and stochastic approximations. Cambridge University Press, USA, pp 9\u201342","DOI":"10.1017\/CBO9780511569920.003"},{"key":"363_CR26","doi-asserted-by":"publisher","unstructured":"Brandao FGSL, Svore KM (2017) Quantum speed-ups for solving semidefinite programs. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp 415\u2013426. https:\/\/doi.org\/10.1109\/FOCS.2017.45","DOI":"10.1109\/FOCS.2017.45"},{"key":"363_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard G, H\u00f8yer P, Mosca M, Tapp A (2002) Quantum amplitude amplification and estimation. Contemp Math 305:53\u201374. https:\/\/doi.org\/10.1090\/conm\/305\/05215","journal-title":"Contemp Math"},{"key":"363_CR28","doi-asserted-by":"publisher","unstructured":"Brassard G, Dupuis F, Gambs S, Tapp A (2011) An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance. arXiv:1106.4267, https:\/\/doi.org\/10.48550\/arXiv.1106.4267","DOI":"10.48550\/arXiv.1106.4267"},{"key":"363_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi N, Lugosi G (2006) Prediction, learning, and games. Cambridge University Press, USA"},{"key":"363_CR30","first-page":"19189","volume":"33","author":"T Chen","year":"2020","unstructured":"Chen T, Lasserre JB, Magron V, Pauwels E (2020) Semialgebraic optimization for lipschitz constants of relu networks. Adv Neural Inf Process Syst 33:19189\u201319200","journal-title":"Adv Neural Inf Process Syst"},{"key":"363_CR31","unstructured":"Chen Z, Sheehan C, Zadik I (2024) On the low-temperature mcmc threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule. arXiv:2408.00746"},{"key":"363_CR32","doi-asserted-by":"publisher","first-page":"6","DOI":"10.3905\/jpm.1993.409440","volume":"19","author":"VK Chopra","year":"1993","unstructured":"Chopra VK, Ziemba WT (1993) The effect of errors in means, variances, and covariances on optimal portfolio choice. J Portfolio Manag 19:6\u201311. https:\/\/doi.org\/10.3905\/jpm.1993.409440","journal-title":"J Portfolio Manag"},{"issue":"5","key":"363_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2371656.2371658","volume":"59","author":"KL Clarkson","year":"2012","unstructured":"Clarkson KL, Hazan E, Woodruff DP (2012) Sublinear optimization for machine learning. J ACM (JACM) 59(5):1\u201349. https:\/\/doi.org\/10.1145\/2371656.2371658","journal-title":"J ACM (JACM)"},{"key":"363_CR34","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.22331\/q-2025-03-25-1674","volume":"9","author":"JF Doriguello","year":"2025","unstructured":"Doriguello JF, Lim D, Pun CS, Rebentrost P, Vaidya T (2025) Quantum algorithms for the pathwise lasso. Quantum 9:1674. https:\/\/doi.org\/10.22331\/q-2025-03-25-1674","journal-title":"Quantum"},{"key":"363_CR35","doi-asserted-by":"publisher","unstructured":"Duchi J, Shalev-Shwartz S, Singer Y, Chandra T (2008) Efficient projections onto the $$l_1$$-ball for learning in high dimensions. In: Proceedings of the 25th international conference on machine learning. ICML \u201908. Association for Computing Machinery, New York, NY, USA, pp 272\u2013279. https:\/\/doi.org\/10.1145\/1390156.1390191","DOI":"10.1145\/1390156.1390191"},{"key":"363_CR36","unstructured":"Flaxman AD, Kalai AT, McMahan HB (2005) Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms. SODA \u201905. Society for Industrial and Applied Mathematics, USA, pp 385\u2013394"},{"key":"363_CR37","first-page":"7816","volume-title":"Advances in neural information processing systems","author":"D Fotakis","year":"2020","unstructured":"Fotakis D, Lianeas T, Piliouras G, Skoulakis S (2020) Efficient online learning of optimal rankings: dimensionality reduction via gradient descent. In: Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H (eds) Advances in neural information processing systems, vol 33. Curran Associates, Inc., Virtual, pp 7816\u20137827"},{"issue":"1","key":"363_CR38","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1):119\u2013139. https:\/\/doi.org\/10.1006\/jcss.1997.1504","journal-title":"J Comput Syst Sci"},{"issue":"233","key":"363_CR39","first-page":"1","volume":"21","author":"C Geoffrey","year":"2020","unstructured":"Geoffrey C, Guillaume L, Matthieu L (2020) Robust high dimensional learning for lipschitz and convex losses. J Mach Learn Res 21(233):1\u201347","journal-title":"J Mach Learn Res"},{"key":"363_CR40","doi-asserted-by":"publisher","unstructured":"Gily\u00e9n A, Su Y, Low GH, Wiebe N (2019) Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing. STOC 2019. Association for Computing Machinery, New York, NY, USA, pp 193\u2013204. https:\/\/doi.org\/10.1145\/3313276.3316366","DOI":"10.1145\/3313276.3316366"},{"key":"363_CR41","doi-asserted-by":"publisher","first-page":"160501","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V, Lloyd S, Maccone L (2008a) Quantum random access memory. Phys Rev Lett 100:160501. https:\/\/doi.org\/10.1103\/PhysRevLett.100.160501","journal-title":"Phys Rev Lett"},{"key":"363_CR42","doi-asserted-by":"publisher","first-page":"052310","DOI":"10.1103\/PhysRevA.78.052310","volume":"78","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti V, Lloyd S, Maccone L (2008b) Architectures for a quantum random access memory. Phys Rev A 78:052310. https:\/\/doi.org\/10.1103\/PhysRevA.78.052310","journal-title":"Phys Rev A"},{"issue":"1","key":"363_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.28.1.1.14260","volume":"28","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb D, Iyengar G (2003) Robust portfolio selection problems. Math Oper Res 28(1):1\u201338. https:\/\/doi.org\/10.1287\/moor.28.1.1.14260","journal-title":"Math Oper Res"},{"issue":"2","key":"363_CR44","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0167-6377(95)00032-0","volume":"18","author":"MD Grigoriadis","year":"1995","unstructured":"Grigoriadis MD, Khachiyan LG (1995) A sublinear-time randomized approximation algorithm for matrix games. Oper Res Lett 18(2):53\u201358. https:\/\/doi.org\/10.1016\/0167-6377(95)00032-0","journal-title":"Oper Res Lett"},{"key":"363_CR45","doi-asserted-by":"publisher","first-page":"062440","DOI":"10.1103\/PhysRevA.105.062440","volume":"105","author":"Y Hamoudi","year":"2022","unstructured":"Hamoudi Y (2022) Preparing many copies of a quantum state in the black-box model. Phys Rev A 105:062440. https:\/\/doi.org\/10.1103\/PhysRevA.105.062440","journal-title":"Phys Rev A"},{"issue":"15\u201316","key":"363_CR46","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.26421\/qic19.15-16-5","volume":"19","author":"Y Hamoudi","year":"2019","unstructured":"Hamoudi Y, Rebentrost P, Rosmanis A, Santha M (2019) Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf Comput 19(15\u201316):1325\u20131349. https:\/\/doi.org\/10.26421\/qic19.15-16-5","journal-title":"Quantum Inf Comput"},{"key":"363_CR47","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow AW, Hassidim A, Lloyd S (2009) Quantum algorithm for linear systems of equations. Phys Rev Lett 103:150502. https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys Rev Lett"},{"issue":"3\u20134","key":"363_CR48","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan E (2016) Introduction to Online Convex Optimization. Found Trends\u00ae Optim 2(3\u20134):157\u2013325. https:\/\/doi.org\/10.1561\/2400000013","journal-title":"Found Trends\u00ae Optim"},{"issue":"2","key":"363_CR49","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E Hazan","year":"2007","unstructured":"Hazan E, Agarwal A, Kale S (2007) Logarithmic regret algorithms for online convex optimization. Mach Learn 69(2):169\u2013192. https:\/\/doi.org\/10.1007\/s10994-007-5016-8","journal-title":"Mach Learn"},{"issue":"1","key":"363_CR50","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10994-016-5548-x","volume":"104","author":"E Hazan","year":"2016","unstructured":"Hazan E, Kale S, Warmuth MK (2016) Learning rotations with little regret. Mach Learn 104(1):129\u2013148. https:\/\/doi.org\/10.1007\/s10994-016-5548-x","journal-title":"Mach Learn"},{"key":"363_CR51","doi-asserted-by":"publisher","unstructured":"Helmbold DP, Warmuth MK (2007) Learning permutations with exponential weights. In: Bshouty NH, Gentile C (eds) Learning theory. Springer, Berlin, Heidelberg, pp 469\u2013483. https:\/\/doi.org\/10.1007\/978-3-540-72927-3_34","DOI":"10.1007\/978-3-540-72927-3_34"},{"key":"363_CR52","first-page":"1705","volume":"10","author":"DP Helmbold","year":"2009","unstructured":"Helmbold DP, Warmuth MK (2009) Learning permutations with exponential weights. J Mach Learn Res 10:1705\u20131736","journal-title":"J Mach Learn Res"},{"issue":"4","key":"363_CR53","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1111\/1467-9965.00058","volume":"8","author":"DP Helmbold","year":"1998","unstructured":"Helmbold DP, Schapire RE, Singer Y, Warmuth MK (1998) On-line portfolio selection using multiplicative updates. Math Financ 8(4):325\u2013347. https:\/\/doi.org\/10.1111\/1467-9965.00058","journal-title":"Math Financ"},{"key":"363_CR54","doi-asserted-by":"publisher","unstructured":"Izdebski A, de Wolf R (2023) Improved quantum boosting. In: G\u00f8rtz IL, Farach-Colton M, Puglisi SJ, Herman G (eds) 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol 274. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, pp 64\u201316416. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2023.64","DOI":"10.4230\/LIPIcs.ESA.2023.64"},{"issue":"6","key":"363_CR55","doi-asserted-by":"publisher","first-page":"2784","DOI":"10.1109\/TSG.2016.2539948","volume":"8","author":"S-J Kim","year":"2017","unstructured":"Kim S-J, Giannakis GB (2017) An online convex optimization approach to real-time energy pricing for demand response. IEEE Trans Smart Grid 8(6):2784\u20132793. https:\/\/doi.org\/10.1109\/TSG.2016.2539948","journal-title":"IEEE Trans Smart Grid"},{"issue":"1","key":"363_CR56","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s11579-021-00304-2","volume":"16","author":"R Korn","year":"2022","unstructured":"Korn R, M\u00fcller L (2022) Optimal portfolios in the presence of stress scenarios a worst-case approach. Math Financ Econ 16(1):153\u2013185. https:\/\/doi.org\/10.1007\/s11579-021-00304-2","journal-title":"Math Financ Econ"},{"key":"363_CR57","unstructured":"Li T, Chakrabarti S, Wu X (2019) Sublinear quantum algorithms for training linear and kernel-based classifiers. In: Chaudhuri K, Salakhutdinov R (eds) Proceedings of the 36th international conference on machine learning. Proceedings of Machine Learning Research, vol 97. PMLR, Long Beach, California, USA, pp 3815\u20133824. https:\/\/proceedings.mlr.press\/v97\/li19b.html"},{"key":"363_CR58","doi-asserted-by":"publisher","unstructured":"Li B, Hoi SCH (2014) Online portfolio selection: a survey. ACM Comput Surv 46(3). https:\/\/doi.org\/10.1145\/2512962","DOI":"10.1145\/2512962"},{"key":"363_CR59","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s42064-017-0003-8","volume":"1","author":"X Liu","year":"2017","unstructured":"Liu X, Lu P, Pan B (2017) Survey of convex optimization for aerospace applications. Astrodynamics 1:23\u201340. https:\/\/doi.org\/10.1007\/s42064-017-0003-8","journal-title":"Astrodynamics"},{"key":"363_CR60","unstructured":"Lobo MS, Boyd S (2000) The worst-case risk of a portfolio"},{"key":"363_CR61","unstructured":"Luo J, Li G, Li L (2025) Space-time tradeoff for sparse quantum state preparation. arXiv:2506.16964"},{"issue":"1","key":"363_CR62","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/2975974","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz H (1952) Portfolio selection. J Financ 7(1):77\u201391. https:\/\/doi.org\/10.2307\/2975974","journal-title":"J Financ"},{"key":"363_CR63","unstructured":"McMahan HB, Streeter MJ (2010) Adaptive bound optimization for online convex optimization. In: COLT 2010 - The 23rd conference on learning theory. Omnipress, Haifa, Israel, pp 244\u2013256"},{"key":"363_CR64","unstructured":"Meng K, Wu P, Yang X (2024) Lipschitz continuity of solution multifunctions of extended $$\\ell _1$$ regularization problems. arXiv:2406.16053"},{"issue":"1","key":"363_CR65","doi-asserted-by":"publisher","first-page":"11002","DOI":"10.1038\/s41598-025-95283-5","volume":"15","author":"P Mukhopadhyay","year":"2025","unstructured":"Mukhopadhyay P (2025) A quantum random access memory (QRAM) using a polynomial encoding of binary strings. Sci Rep 15(1):11002. https:\/\/doi.org\/10.1038\/s41598-025-95283-5","journal-title":"Sci Rep"},{"key":"363_CR66","doi-asserted-by":"publisher","unstructured":"Nayak A, Wu F (1999) The quantum query complexity of approximating the median and related statistics. In: Proceedings of the thirty-first annual ACM symposium on theory of computing. STOC \u201999. Association for Computing Machinery, New York, NY, USA, pp 384\u2013393. https:\/\/doi.org\/10.1145\/301250.301349","DOI":"10.1145\/301250.301349"},{"key":"363_CR67","doi-asserted-by":"publisher","unstructured":"Nielsen MA, Chuang IL (2010) Quantum computation and quantum information. Cambridge university press, New Yok. https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"1","key":"363_CR68","doi-asserted-by":"publisher","first-page":"218","DOI":"10.2514\/1.49518","volume":"34","author":"RB Patel","year":"2011","unstructured":"Patel RB, Goulart PJ (2011) Trajectory generation for aircraft avoidance maneuvers using online optimization. J Guid Control Dyn 34(1):218\u2013230. https:\/\/doi.org\/10.2514\/1.49518","journal-title":"J Guid Control Dyn"},{"key":"363_CR69","unstructured":"Prakash A (2014) Quantum algorithms for linear algebra and machine learning. PhD thesis, University of California, Berkeley. https:\/\/escholarship.org\/uc\/item\/5v9535q4"},{"key":"363_CR70","unstructured":"Schraudolph NN, Yu J, G\u00fcnter S (2007) A stochastic quasi-Newton method for online convex optimization. In: Meila M, Shen X (eds) Proceedings of the eleventh international conference on artificial intelligence and statistics. Proceedings of Machine Learning Research, vol 2. PMLR, San Juan, Puerto Rico, pp 436\u2013443"},{"key":"363_CR71","doi-asserted-by":"publisher","unstructured":"Servedio RA (2001) Smooth boosting and learning with malicious noise. In: Helmbold D, Williamson B (eds) Computational learning theory. Springer, Berlin, Heidelberg, pp 473\u2013489. https:\/\/doi.org\/10.1007\/3-540-44581-1_31","DOI":"10.1007\/3-540-44581-1_31"},{"key":"363_CR72","doi-asserted-by":"publisher","unstructured":"Shalev-Shwartz S (2012) Online learning and online convex optimization. Found Trends\u00ae Mach Learn 4(2):107\u2013194. https:\/\/doi.org\/10.1561\/2200000018","DOI":"10.1561\/2200000018"},{"key":"363_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.22331\/q-2020-02-14-230","volume":"4","author":"J van Apeldoorn","year":"2020","unstructured":"van Apeldoorn J, Gily\u00e9n A, Gribling S (2020) de Wolf R (2020) Quantum SDP-Solvers: better upper and lower bounds. Quantum 4:1\u201369. https:\/\/doi.org\/10.22331\/q-2020-02-14-230","journal-title":"Quantum"},{"key":"363_CR74","doi-asserted-by":"publisher","unstructured":"van Apeldoorn J, Gily\u00e9n A (2019) Quantum algorithms for zero-sum games. arXiv:1904.03180. https:\/\/doi.org\/10.48550\/arXiv.1904.03180","DOI":"10.48550\/arXiv.1904.03180"},{"key":"363_CR75","doi-asserted-by":"publisher","unstructured":"Vose MD (1991) A linear algorithms for generating random numbers with a given distribution. IEEE Trans Softw Eng 17(972). https:\/\/doi.org\/10.1109\/32.92917","DOI":"10.1109\/32.92917"},{"key":"363_CR76","doi-asserted-by":"publisher","unstructured":"Wang H, Banerjee A (2014) Randomized block coordinate descent for online and stochastic optimization. arXiv:1407.0107, https:\/\/doi.org\/10.48550\/arXiv.1407.0107","DOI":"10.48550\/arXiv.1407.0107"},{"key":"363_CR77","unstructured":"Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the twentieth international conference on international conference on machine learning. ICML\u201903. AAAI Press, Washington, DC, USA, pp 928\u2013935"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00363-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:13:47Z","timestamp":1773234827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00363-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00363-y","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"10 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"28"}}