{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:54Z","timestamp":1772119794632,"version":"3.50.1"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Research Foundation, the Prime Minister\u2019s Office, and the Ministry of Education, Singapore","award":["R-710-000-012-135"],"award-info":[{"award-number":["R-710-000-012-135"]}]},{"name":"National Research Foundation, the Prime Minister\u2019s Office, and the Ministry of Education, Singapore","award":["R-710-000-012-135"],"award-info":[{"award-number":["R-710-000-012-135"]}]},{"name":"Quantum Engineering Program","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"name":"Quantum Engineering Program","award":["NRF2021-QEP2-02-P05"],"award-info":[{"award-number":["NRF2021-QEP2-02-P05"]}]},{"name":"EU Recovery and Resilience Facility","award":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"],"award-info":[{"award-number":["2.3.1.1.i.0\/1\/22\/I\/CFLA\/001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-024-04256-6","type":"journal-article","created":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T04:03:25Z","timestamp":1708056205000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A quantum online portfolio optimization algorithm"],"prefix":"10.1007","volume":"23","author":[{"given":"Debbie","family":"Lim","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Rebentrost","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"key":"4256_CR1","unstructured":"Zinkevich, M.: Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In: Proceedings Twentieth International Conference on Machine Learning 2(February), 928\u2013935 (2003)"},{"issue":"34","key":"4256_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1561\/2400000013","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E.: Introduction Online Convex Optimization. Found. Trends Optim. 2(34), 157\u2013325 (2016)","journal-title":"Found. Trends Optim."},{"key":"4256_CR3","unstructured":"Flaxman, A. D., Kalai, A. T., McMahan, H. B.: Online convex optimization in the bandit setting: gradient descent without a gradient. arXiv:cs\/0408007"},{"key":"4256_CR4","first-page":"8","volume":"20","author":"Elad Hazan","year":"2007","unstructured":"Hazan, Elad, Rakhlin, Alexander, Bartlett, Peter: Adaptive online gradient descent. Adv. Neural Inf. Process. Syst. 20, 8 (2007)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"4256_CR5","unstructured":"Wang, H., Banerjee, A.: Randomized block coordinate descent for online and stochastic optimization. arXiv preprint arXiv:1407.0107, (2014)"},{"issue":"2","key":"4256_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2837020","volume":"63","author":"Sanjeev Arora","year":"2016","unstructured":"Arora, Sanjeev, Kale, Satyen: A combinatorial, primal-dual approach to semidefinite programs. J. ACM 63(2), 1\u201335 (2016)","journal-title":"J. ACM"},{"key":"4256_CR7","unstructured":"Schraudolph, N. N., Yu, J., G\u00fcnter, S.: A stochastic quasi-Newton method for online convex optimization. In Artificial intelligence and statistics, pp 436\u2013443. PMLR, (2007)"},{"issue":"4","key":"4256_CR8","doi-asserted-by":"crossref","first-page":"1582","DOI":"10.1137\/130913869","volume":"45","author":"S Arora","year":"2016","unstructured":"Arora, S., Ge, R., Kannan, R., Moitra, A.: Computing a nonnegative matrix factorization-provably. SIAM J. Comput. 45(4), 1582\u20131611 (2016)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"4256_CR9","first-page":"1705","volume":"10","author":"DP Helmbold","year":"2009","unstructured":"Helmbold, D.P., Warmuth, M.K.: Learning permutations with exponential weights. J. Mach. Learn. Res. 10(10), 1705\u20131736 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"4256_CR10","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1111\/1467-9965.00058","volume":"8","author":"DP Helmbold","year":"1998","unstructured":"Helmbold, D.P., Schapire, R.E., Singer, Y., Warmuth, M.K.: On-line portfolio selection using multiplicative updates. Math. Financ. 8(4), 325\u2013347 (1998)","journal-title":"Math. Financ."},{"key":"4256_CR11","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: Gradient descent without a gradient. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp 385\u2013394, (2005)"},{"key":"4256_CR12","unstructured":"Bubeck, S., Eldan, R.: Multi-scale exploration of convex functions and bandit convex optimization. In: Feldman, V., Rakhlin, A., Shamir, O.: (eds) 29th Annual Conference on Learning Theory, volume\u00a049 of Proceedings of Machine Learning Research, pages 583\u2013589, Columbia University, New York, New York, USA, (2016). PMLR"},{"issue":"4","key":"4256_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3453721","volume":"68","author":"S Bubeck","year":"2021","unstructured":"Bubeck, S., Eldan, R., Lee, Y.T.: Kernel-based methods for bandit convex optimization. J. ACM 68(4), 1\u201335 (2021)","journal-title":"J. ACM"},{"issue":"3","key":"4256_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.4171\/msl\/17","volume":"2","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T.: Improved regret for zeroth-order adversarial bandit convex optimisation. Math. Stat. Learn. 2(3), 311\u2013334 (2020)","journal-title":"Math. Stat. Learn."},{"issue":"1","key":"4256_CR15","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio Optimization. J. Financ. 7(1), 77\u201391 (1952)","journal-title":"J. Financ."},{"key":"4256_CR16","unstructured":"El\u00a0Ghaoui, L., Oustry, F., Oks, M.: Worst-Case Value-at-Risk and Robust Asset Allocation: A Semidefinite Programming Approach. In: Technical report, EECS Department, University of California, Berkeley, (2000)"},{"key":"4256_CR17","doi-asserted-by":"crossref","unstructured":"Skolpadungket, P., Dahal, K., Harnpornchai, N.: Portfolio optimization using multi-objective genetic algorithms. In: 2007 IEEE Congress on Evolutionary Computation, pages 516\u2013523. IEEE, (2007)","DOI":"10.1109\/CEC.2007.4424514"},{"issue":"3","key":"4256_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A Ponsich","year":"2012","unstructured":"Ponsich, A., Jaimes, A.L., Coello, C.A.: Coello,: a survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans. Evol. Comput. 17(3), 321\u2013344 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4256_CR19","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.csda.2013.07.010","volume":"76","author":"Y Yen","year":"2014","unstructured":"Yen, Y., Yen, T.: Solving norm constrained portfolio optimization via coordinate-wise descent algorithms. Comput. Stat. Data Anal. 76, 737\u2013759 (2014)","journal-title":"Comput. Stat. Data Anal."},{"key":"4256_CR20","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.csda.2013.07.010","volume":"76","author":"Y Yen","year":"2014","unstructured":"Yen, Y., Yen, T.: Solving norm constrained portfolio optimization via coordinate-wise descent algorithms. Comput. Stat. Data Anal. 76, 737\u2013759 (2014)","journal-title":"Comput. Stat. Data Anal."},{"issue":"5","key":"4256_CR21","first-page":"1","volume":"64","author":"Ameer Tamoor Khan","year":"2021","unstructured":"Khan, Ameer Tamoor, Cao, Xinwei, Li, Shuai, Bin, Hu., Katsikis, Vasilios N.: Quantum beetle antennae search: a novel technique for the constrained portfolio optimization problem. Sci. China Inf. Sci. 64(5), 1\u201314 (2021)","journal-title":"Sci. China Inf. Sci."},{"key":"4256_CR22","volume-title":"Modern portfolio theory and investment analysis","author":"Edwin J Elton","year":"2014","unstructured":"Elton, Edwin J., Gruber, Martin J., Brown, Stephen J., Goetzmann, William N.: Modern portfolio theory and investment analysis. Wiley (2014)"},{"issue":"1","key":"4256_CR23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02282047","volume":"45","author":"AJ King","year":"1993","unstructured":"King, A.J.: Asymmetric risk measures and tracking models for portfolio optimization under uncertainty. Ann. Oper. Res. 45(1), 165\u2013177 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"4256_CR24","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1287\/mnsc.37.5.519","volume":"37","author":"H Konno","year":"1991","unstructured":"Konno, H., Yamazki, H.: Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market. Manag. Sci. 37(5), 519\u2013531 (1991)","journal-title":"Manag. Sci."},{"issue":"6","key":"4256_CR25","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1080\/758533851","volume":"7","author":"TC Mills","year":"1997","unstructured":"Mills, T.C.: Stylized facts on the temporal and distributional properties of daily FT-SE returns. Appl. Financ. Econ. 7(6), 599\u2013604 (1997)","journal-title":"Appl. Financ. Econ."},{"key":"4256_CR26","first-page":"7","volume":"24","author":"Peter W Turnbull","year":"1990","unstructured":"Turnbull, Peter W.: A review of portfolio planning models for industrial marketing and purchasing management. Eur. J. Market. 24, 7\u201322 (1990)","journal-title":"Eur. J. Market."},{"key":"4256_CR27","unstructured":"Morgan, J.P.: RiskMetricsTM-Technical Document. ... Trust Company of New York: New ..., pages 2\u2013296, (1996)"},{"issue":"7","key":"4256_CR28","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"R Tyrrell Rockafellar","year":"2002","unstructured":"Tyrrell Rockafellar, R., Uryasev, S.: Conditional value-at-risk for general loss distributions. J. Bank. Financ. 26(7), 1443\u20131471 (2002)","journal-title":"J. Bank. Financ."},{"key":"4256_CR29","doi-asserted-by":"crossref","unstructured":"Kivinen, J., Warmuth, M. K.: Additive versus exponentiated gradient updates for linear prediction. In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 209\u2013218, (1995)","DOI":"10.1145\/225058.225121"},{"issue":"3","key":"4256_CR30","first-page":"1","volume":"46","author":"BH Li","year":"2014","unstructured":"Li, B.H., Steven, C.H.: Online portfolio selection?: a survey y. ACM Comput. Surv. (CSUR) 46(3), 1\u201336 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"4256_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.revip.2019.100028","volume":"4","author":"R Or\u00fas","year":"2019","unstructured":"Or\u00fas, R., Mugel, Samuel, Lizaso, Enrique: Quantum computing for finance: overview and prospects. Rev. Phys. 4, 1\u201313 (2019)","journal-title":"Rev. Phys."},{"key":"4256_CR32","unstructured":"Bouland, A., van Dam, W., Joorati, H., Kerenidis, I., Prakash, A.: Prospects and challenges of quantum finance. arXiv preprint arXiv:2011.06492, (2020)"},{"key":"4256_CR33","first-page":"1","volume":"1","author":"DJ Egger","year":"2021","unstructured":"Egger, D.J., Gambella, Claudio, Marecek, Jakub, McFaddin, Scott, Mevissen, Martin, Raymond, Rudy, Simonetto, Andrea, Woerner, Stefan, Yndurain, Elena: Quantum computing for finance: state-of-the-art and future prospects. IEEE Trans. Quant. Eng. 1, 1\u201324 (2021)","journal-title":"IEEE Trans. Quant. Eng."},{"key":"4256_CR34","doi-asserted-by":"crossref","unstructured":"Herman, D., Googin, C., Liu, X., Galda, A., Safro, I., Sun, Y., Pistoia, M., Alexeev, Y.: A Survey of Quantum Computing for Finance. arXiv preprint arXiv:2201.02773, (2022)","DOI":"10.1038\/s42254-023-00603-1"},{"issue":"6","key":"4256_CR35","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1109\/JSTSP.2016.2574703","volume":"10","author":"Gili Rosenberg","year":"2016","unstructured":"Rosenberg, Gili, Haghnegahdar, Poya, Goddard, Phil, Carr, Peter, Kesheng, Wu., Prado, Marcos L\u00f3pez.: Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Select. Top. Signal Process. 10(6), 1053\u20131060 (2016)","journal-title":"IEEE J. Select. Top. Signal Process."},{"key":"4256_CR36","unstructured":"Rebentrost, P., Lloyd, S.: Quantum computational finance: quantum algorithm for portfolio optimization. arXiv preprint arXiv:1811.03975, (2018)"},{"issue":"15","key":"4256_CR37","volume":"103","author":"Aram W Harrow","year":"2009","unstructured":"Harrow, Aram W., Hassidim, Avinatan, Lloyd, Seth: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"4256_CR38","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1137\/16M1087072","volume":"46","author":"AM Childs","year":"2017","unstructured":"Childs, A.M., Kothari, R., Somma, R.D.: Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comput. 46(6), 1920\u20131950 (2017)","journal-title":"SIAM J. Comput."},{"key":"4256_CR39","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., Prakash, A., Szil\u00e1gyi, D.: Quantum algorithms for portfolio optimization. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pages 147\u2013155, (2019)","DOI":"10.1145\/3318041.3355465"},{"key":"4256_CR40","unstructured":"Hodson, M., Ruck, B., Ong, H., Garvin, D., Dulman, S.: Portfolio rebalancing experiments using the Quantum Alternating Operator Ansatz. arXiv preprint arXiv:1911.05296, (2019)"},{"key":"4256_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.22331\/q-2021-07-28-513","volume":"5","author":"N Slate","year":"2021","unstructured":"Slate, N., Matwiejew, E., Marsh, S., Wang, J.B.: Quantum walk-based portfolio optimisation. Quantum 5, 1\u201317 (2021)","journal-title":"Quantum"},{"key":"4256_CR42","unstructured":"Yalovetzky, R., Minssen, P., Herman, D., Pistoia, M.: Portfolio optimization for near-term quantum hardware. arXiv preprint arXiv:2110.15958, (2021)"},{"issue":"4","key":"4256_CR43","volume":"4","author":"Narendra N Hegade","year":"2022","unstructured":"Hegade, Narendra N., Chandarana, Pranav, Paul, Koushik, Chen, Xi., Albarr\u00e1n-Arriagada, Francisco, Solano, E.: Portfolio optimization with digitized counterdiabatic quantum algorithms. Phys. Rev. Res. 4(4), 043204 (2022)","journal-title":"Phys. Rev. Res."},{"issue":"1","key":"4256_CR44","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s11128-022-03766-5","volume":"22","author":"S Brandhofer","year":"2022","unstructured":"Brandhofer, S., Braun, Daniel, Dehn, Vanessa, Hellstern, Gerhard, H\u00fcls, Matthias, Ji, Yanjun, Polian, Ilia, Bhatia, Amandeep Singh, Wellens, Thomas: Benchmarking the performance of portfolio optimization with QAOA. Quant. Inf. Process. 22(1), 25 (2022)","journal-title":"Quant. Inf. Process."},{"key":"4256_CR45","unstructured":"Baker, J. S., Radha, S. K.: Wasserstein solution quality and the quantum approximate optimization algorithm: a portfolio optimization case study. arXiv preprint arXiv:2202.06782, (2022)"},{"key":"4256_CR46","unstructured":"Arunachalam, S., Maity, R.: Quantum boosting. In: International Conference on Machine Learning, pages 377\u2013387. PMLR, (2020)"},{"issue":"771\u2013780","key":"4256_CR47","first-page":"1612","volume":"14","author":"Y Freund","year":"1999","unstructured":"Freund, Y., Schapire, Robert, Abe, Naoki: A short introduction to boosting. J. Japan. Soc. Artif. Intell. 14(771\u2013780), 1612 (1999)","journal-title":"J. Japan. Soc. Artif. Intell."},{"key":"4256_CR48","unstructured":"Izdebski, A., de\u00a0Wolf, R.: Improved quantum boosting. arXiv preprint arXiv:2009.08360, (2020)"},{"key":"4256_CR49","doi-asserted-by":"crossref","unstructured":"Klivans, A., Meka, R.: Learning graphical models using multiplicative weights. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 343\u2013354. IEEE, (2017)","DOI":"10.1109\/FOCS.2017.39"},{"issue":"1","key":"4256_CR50","volume":"103","author":"P Rebentrost","year":"2020","unstructured":"Rebentrost, P., Hamoudi, Yassine, Ray, Maharshi, Wang, Xin, Yang, Siyi, Santha, Miklos: Quantum algorithms for hedging and the learning of Ising models. Phys. Rev. A 103(1), 012418 (2020)","journal-title":"Phys. Rev. A"},{"key":"4256_CR51","doi-asserted-by":"crossref","unstructured":"Wang, D., You, X., Tongyang Li, and Andrew\u00a0M Childs. Quantum exploration algorithms for multi-armed bandits. In: Proceedings of the AAAI Conference on Artificial Intelligence, volume\u00a035, pages 10102\u201310110, (2021)","DOI":"10.1609\/aaai.v35i11.17212"},{"issue":"1","key":"4256_CR52","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"key":"4256_CR53","doi-asserted-by":"crossref","DOI":"10.1017\/9781108571401","volume-title":"Bandit algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit algorithms. Cambridge University Press (2020)"},{"issue":"2","key":"4256_CR54","volume":"7","author":"Jianhao He","year":"2022","unstructured":"He, Jianhao, Yang, Feidiao, Zhang, Jialin, Li, Lvzhou: Quantum algorithm for online convex optimization. Quant. Sci. Technol. 7(2), 025022 (2022)","journal-title":"Quant. Sci. Technol."},{"issue":"1","key":"4256_CR55","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J. Mach. Learn. Res. 18(1), 1703\u20131713 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"4256_CR56","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A Quantum Algorithm for Finding the Minimum. arXiv:quant-ph\/9607014 (1996)"},{"issue":"9","key":"4256_CR57","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/32.92917","volume":"17","author":"MD Vose","year":"1991","unstructured":"Vose, M.D.: A linear algorithms for generating random numbers with A Given Distribution. IEEE Trans. Softw. Eng. 17(9), 972\u2013975 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"8","key":"4256_CR58","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1049\/el:19740097","volume":"10","author":"AJ Walker","year":"1974","unstructured":"Walker, A.J.: New fast method for generating discrete random numbers with arbitrary frequency distributions. Electron. Lett. 10(8), 127\u2013128 (1974)","journal-title":"Electron. Lett."},{"key":"4256_CR59","doi-asserted-by":"crossref","unstructured":"Tang, E.: A quantum-inspired classical algorithm for recommendation systems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 217\u2013228, (2019)","DOI":"10.1145\/3313276.3316310"},{"key":"4256_CR60","doi-asserted-by":"crossref","unstructured":"Chia, N., Gily\u00e9n, A., Li, T., Lin, H., Tang, E., Wang, C.: Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. In: Proceedings of the 52nd Annual ACM SIGACT symposium on theory of computing, pages 387\u2013400, (2020)","DOI":"10.1145\/3357713.3384314"},{"key":"4256_CR61","unstructured":"Chia, N.H., Lin, H. H., Wang, C.: Quantum-inspired sublinear classical algorithms for solving low-rank linear systems. arXiv preprint arXiv:1811.04852, (2018)"},{"issue":"15\u201316","key":"4256_CR62","first-page":"1325","volume":"19","author":"Y Hamoudi","year":"2019","unstructured":"Hamoudi, Y., Rebentrost, Patrick, Rosmanis, Ansis, Santha, Miklos: Quantum and classical algorithms for approximate submodular function minimization. Quant. Inf. Comput. 19(15\u201316), 1325\u20131349 (2019)","journal-title":"Quant. Inf. Comput."},{"issue":"1","key":"4256_CR63","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1103\/PhysRevA.54.147","volume":"54","author":"V Vedral","year":"1996","unstructured":"Vedral, V., Barenco, Adriano, Ekert, Artur: Quantum networks for elementary arithmetic operations. Phys. Rev. A 54(1), 147 (1996)","journal-title":"Phys. Rev. A"},{"key":"4256_CR64","unstructured":"Li, T., Chakrabarti, S., Wu, X.: Sublinear quantum algorithms for training linear and kernel-based classifiers. In: 36th International Conference on Machine Learning, ICML 2019, pages 6784\u20136804, (2019)"},{"key":"4256_CR65","doi-asserted-by":"crossref","first-page":"463","DOI":"10.22331\/q-2021-06-01-463","volume":"5","author":"Shouvanik Chakrabarti","year":"2021","unstructured":"Chakrabarti, Shouvanik, Krishnakumar, Rajiv, Mazzola, Guglielmo, Stamatopoulos, Nikitas, Woerner, Stefan, Zeng, William J.: A threshold for quantum advantage in derivative pricing. Quantum 5, 463 (2021)","journal-title":"Quantum"},{"key":"4256_CR66","unstructured":"Rebentrost, P., Santha, M., Yang, S.: Quantum alphatron. arXiv preprint arXiv:2108.11670, (2021)"},{"key":"4256_CR67","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. arXiv preprint arXiv:0910.2530, (2009)"},{"issue":"2","key":"4256_CR68","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/TETC.2019.2910870","volume":"9","author":"Himanshu Thapliyal","year":"2019","unstructured":"Thapliyal, Himanshu, Edgard Munoz-Coreas, T.S.S., Varun, Travis S.: Quantum circuit designs of integer division optimizing t-count and t-depth. IEEE Trans. Emerg. Top. Comput. 9(2), 1045\u20131056 (2019)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"4256_CR69","doi-asserted-by":"crossref","unstructured":"Haener, T., Soeken, M., Roetteler, M., Svore, K.M.: Quantum circuits for floating-point arithmetic. In: International Conference on Reversible Computation, pages 162\u2013174. Springer, (2018)","DOI":"10.1007\/978-3-319-99498-7_11"},{"issue":"6","key":"4256_CR70","doi-asserted-by":"crossref","first-page":"703","DOI":"10.3390\/electronics10060703","volume":"10","author":"SS Gayathri","year":"2021","unstructured":"Gayathri, S.S., Kumar, R., Dhanalakshmi, Samiappan, Dooly, Gerard, Duraibabu, Dinesh Babu: T-count optimized quantum circuit designs for single-precision floating-point division. Electronics 10(6), 703 (2021)","journal-title":"Electronics"},{"issue":"2","key":"4256_CR71","first-page":"1","volume":"11","author":"Trung Duc Nguyen and Rodney Van Meter","year":"2014","unstructured":"Trung Duc Nguyen and Rodney Van Meter: A resource-efficient design for a reversible floating point adder in quantum computing. ACM J. Emerg. Technol. Comput. Syst. (JETC) 11(2), 1\u201318 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"key":"4256_CR72","doi-asserted-by":"crossref","unstructured":"Nachtigal, M., Thapliyal, H., Ranganathan, N.: Design of a reversible single precision floating point multiplier based on operand decomposition. In: 10th IEEE International Conference on Nanotechnology, pages 233\u2013237. IEEE, (2010)","DOI":"10.1109\/NANO.2010.5697746"},{"key":"4256_CR73","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, Peter, Mosca, Michele, Tapp, Alain: Quantum amplitude amplification and estimation. Contem. Math. 305, 53\u201374 (2002)","journal-title":"Contem. Math."},{"key":"4256_CR74","unstructured":"van Apeldoorn, J., Gily\u00e9n, A.: Quantum algorithms for zero-sum games. arXiv preprint arXiv:1904.03180, (2019)"},{"key":"4256_CR75","first-page":"1","volume":"2020","author":"Xin Wang","year":"2020","unstructured":"Wang, Xin, Sun, Tao, Liu, Zhi: Kernel-based aggregating learning system for online portfolio optimization. Math. Probl. Eng. 2020, 1\u201314 (2020)","journal-title":"Math. Probl. Eng."},{"issue":"8","key":"4256_CR76","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1080\/14697688.2017.1357831","volume":"18","author":"Bin Li","year":"2018","unstructured":"Li, Bin, Wang, Jialei, Huang, Dingjiang, Hoi, Steven CH.: Transaction cost optimization for online portfolio selection. Quant. Financ. 18(8), 1411\u20131424 (2018)","journal-title":"Quant. Financ."},{"key":"4256_CR77","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113546","volume":"159","author":"M Khedmati","year":"2020","unstructured":"Khedmati, M., Azin, P.: An online portfolio selection algorithm using clustering approaches and considering transaction costs. Expert Syst. Appl. 159, 113546 (2020)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"4256_CR78","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1111\/1467-9965.00058","volume":"8","author":"DP Helmbold","year":"1998","unstructured":"Helmbold, D.P., Schapire, R.E., Singer, Y., Warmuth, M.K.: On-line portfolio selection using multiplicative updates. Math. Financ. 8(4), 325\u2013347 (1998)","journal-title":"Math. Financ."},{"key":"4256_CR79","doi-asserted-by":"crossref","unstructured":"Fernando G.S.L.B., Svore, K. M.: Quantum speed-ups for solving semidefinite programs. In: Annual Symposium on Foundations of Computer Science - Proceedings, 2017-Octob(2):415\u2013426, (2017)","DOI":"10.1109\/FOCS.2017.45"},{"issue":"617","key":"4256_CR80","first-page":"1","volume":"132","author":"V Apeldoorn","year":"2019","unstructured":"Apeldoorn, V., Joran, Gily\u00e9n: Improvements in quantum SDP-solving with applications. Leibniz International Proceedings in Informatics, LIPIcs 132(617), 1\u201336 (2019)","journal-title":"Leibniz International Proceedings in Informatics, LIPIcs"},{"key":"4256_CR81","first-page":"1","volume":"4","author":"J van Apeldoorn","year":"2020","unstructured":"van Apeldoorn, J., Gily\u00e9n, Andr\u00e1s, Gribling, Sander, de Wolf, Ronald: Quantum SDP-Solvers: Better upper and lower bounds. Quantum 4, 1\u201369 (2020)","journal-title":"Quantum"},{"key":"4256_CR82","doi-asserted-by":"crossref","unstructured":"B.\u00a0David Clader, Alexander\u00a0M. Dalzell, Nikitas Stamatopoulos, Grant Salton, Mario Berta, and William\u00a0J. Zeng. Quantum Resources Required to Block-Encode a Matrix of Classical Data, June (2022)","DOI":"10.1109\/TQE.2022.3231194"},{"issue":"16","key":"4256_CR83","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti, V., Lloyd, Seth, Maccone, Lorenzo: Quantum random access memory. Phys. Rev. Lett. 100(16), 160501 (2008)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"4256_CR84","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.78.052310","volume":"78","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti, V., Lloyd, S., maccone, L.: Architectures for a quantum random access memory. Phys. Rev. A 78(5), 052310 (2008)","journal-title":"Phys. Rev. A"},{"issue":"12","key":"4256_CR85","volume":"17","author":"Srinivasan Arunachalam","year":"2015","unstructured":"Arunachalam, Srinivasan, Gheorghiu, Vlad, Jochym-O\u2019Connor, Tomas, Mosca, Michele, Srinivasan, Priyaa Varshinee: On the robustness of bucket brigade quantum ram. New J. Phys. 17(12), 123010 (2015)","journal-title":"New J. Phys."},{"key":"4256_CR86","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2020.2965803","volume":"1","author":"D Matteo","year":"2020","unstructured":"Matteo, D., Olivia, Gheorghiu, Vlad, Mosca: Fault tolerant resource estimation of quantum random-access memories. IEEE Trans. Quantum Eng. 1, 1\u201313 (2020)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"4256_CR87","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511753886","volume-title":"Optimization methods in finance","author":"Gerard Cornuejols","year":"2006","unstructured":"Cornuejols, Gerard, T\u00fct\u00fcnc\u00fc, Reha: Optimization methods in finance. Cambridge University Press (2006)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04256-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04256-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04256-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T13:19:01Z","timestamp":1712323141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04256-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,16]]},"references-count":87,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["4256"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04256-6","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3397276\/v1","asserted-by":"object"}]},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,16]]},"assertion":[{"value":"29 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","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":"Conflict of interest"}}],"article-number":"63"}}