{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T15:40:32Z","timestamp":1787672432562,"version":"build-2736575974"},"reference-count":32,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,7,1]]},"DOI":"10.1587\/transinf.2024edp7254","type":"journal-article","created":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T17:13:15Z","timestamp":1736874795000},"page":"727-733","source":"Crossref","is-referenced-by-count":4,"title":["Improved Quantum Approximate Optimization Algorithm Based on Conditional Value-at-Risk for Portfolio Optimization"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Qingqing","family":"YU","sequence":"first","affiliation":[{"name":"Dept. of Information Engineering, MinNan University of Science and Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"JIN","sequence":"additional","affiliation":[{"name":"Dept. of Information Engineering, MinNan University of Science and Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H.M. Markowitz, \u201cPortfolio Selection: Efficient Diversification of Investments,\u201d 2017. 10.12987\/9780300191677","DOI":"10.12987\/9780300191677"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] F. Barahona, \u201cOn the computational complexity of ising spin glass models,\u201d Journal of Physics A: Mathematical and General, vol.15, no.10, pp.3241-3253, Oct. 1982. 10.1088\/0305-4470\/15\/10\/028","DOI":"10.1088\/0305-4470\/15\/10\/028"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] F. Glover, \u201cFuture paths for integer programming and links to artificial intelligence,\u201d Computers &amp; operations research, vol.13, no.5, pp.533-549, 1986. 10.1016\/0305-0548(86)90048-1","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] F. Glover, \u201cTabu Search\u2014Part I,\u201d ORSA Journal on Computing, vol.1, no.3, pp.190-206, 1989. 10.1287\/ijoc.1.3.190","DOI":"10.1287\/ijoc.1.3.190"},{"key":"5","unstructured":"[5] J.E. Beasley, \u201cHeuristic algorithms for the unconstrained binary quadratic programming problem,\u201d Tech. Rep., Working Paper, The Management School, Imperial College, London, England, 1998."},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] E. Boros, P.L. Hammer, and G. Tavares, \u201cLocal search heuristics for quadratic unconstrained binary optimization (QUBO),\u201d Journal of Heuristics, vol.13, no.2, pp.99-132, 2007. 10.1007\/s10732-007-9009-3","DOI":"10.1007\/s10732-007-9009-3"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] I. Dunning, S. Gupta, and J. Silberholz, \u201cWhat works best when? a systematic evaluation of heuristics for max-cut and QUBO,\u201d INFORMS Journal on Computing, vol.30, no.3, pp.608-624, 2018. 10.1287\/ijoc.2017.0798","DOI":"10.1287\/ijoc.2017.0798"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] M. Aramon, G. Rosenberg, E. Valiante, T. Miyazawa, H. Tamura, and H.G. Katzgraber, \u201cPhysics-inspired optimization for quadratic unconstrained problems using a digital annealer,\u201d Frontiers in Physics, vol.7, p.48, 2019. 10.3389\/fphy.2019.00048","DOI":"10.3389\/fphy.2019.00048"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] H. Goto, K. Endo, M. Suzuki, Y. Sakai, T. Kanao, Y. Hamakawa, R. Hidaka, M. Yamasaki, and K. Tatsumura, \u201cHigh-performance combinatorial optimization based on classical mechanics,\u201d Science Advances, vol.7, no.6, 2021. 10.1126\/sciadv.abe7953","DOI":"10.1126\/sciadv.abe7953"},{"key":"10","unstructured":"[10] E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, \u201cQuantum computation by adiabatic evolution,\u201d arXiv preprint quant-ph\/0001106, 2000."},{"key":"11","unstructured":"[11] E. Farhi, J. Goldstone, and S. Gutmann, \u201cA quantum approximate optimization algorithm,\u201d arXiv preprint arXiv:1411.4028, 2014."},{"key":"12","unstructured":"[12] K. Boothby, C. Enderud, T. Lanting, R. Molavi, N. Tsai, M.H. Volkmann, F. Altomare, M.H. Amin, M. Babcock, A.J. Berkley, <i>et al.<\/i>, \u201cArchitectural considerations in the design of a third-generation superconducting quantum annealing processor,\u201d arXiv preprint arXiv:2108.02322, 2021."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] G. Rosenberg, P. Haghnegahdar, P. Goddard, P. Carr, K. Wu, and M.L. De Prado, \u201cSolving the optimal trading trajectory problem using a quantum annealer,\u201d Proc. 8th Workshop on High Performance Computational Finance, pp.1-7, 2015. 10.1145\/2830556.2830563","DOI":"10.1145\/2830556.2830563"},{"key":"14","unstructured":"[14] N. Elsokkary, F.S. Khan, D. La Torre, T.S. Humble, and J. Gottlieb, \u201cFinancial portfolio management using adiabatic quantum optimization: the case of abu dhabi securities exchange,\u201d 2017 IEEE High Performance Extreme Computing Conference (HPEC), pp.1-4, 2017."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] D. Venturelli and A. Kondratyev, \u201cReverse quantum annealing approach to portfolio optimization problems,\u201d Quantum Machine Intelligence, vol.1, no.1, pp.17-30, 2019. 10.1007\/s42484-019-00001-w","DOI":"10.1007\/s42484-019-00001-w"},{"key":"16","unstructured":"[16] J. Cohen, A. Khan, and C. Alexander, \u201cPortfolio optimization of 60 stocks using classical and quantum algorithms,\u201d arXiv preprint arXiv:2008.08669, 2020."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] F. Phillipson and H.S. Bhatia, \u201cPortfolio optimisation using the d-wave quantum annealer,\u201d International Conference on Computational Science, pp.45-59, Springer, 2021. 10.1007\/978-3-030-77980-1_4","DOI":"10.1007\/978-3-030-77980-1_4"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] S. Mugel, M. Abad, M. Bermejo, J. S\u00e1nchez, E. Lizaso, and R. Or\u00fas, \u201cHybrid quantum investment optimization with minimal holding period,\u201d Scientific Reports, vol.11, no.1, p.19587, 2021. 10.1038\/s41598-021-98297-x","DOI":"10.1038\/s41598-021-98297-x"},{"key":"19","unstructured":"[19] M. Hodson, B. Ruck, H. Ong, D. Garvin, and S. Dulman, \u201cPortfolio rebalancing experiments using the quantum alternating operator ansatz,\u201d arXiv preprint arXiv:1911.05296, 2019."},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] D.J. Egger, J. Mare\u010dek, and S. Woerner, \u201cWarm-starting quantum optimization,\u201d Quantum, vol.5, p.479, 2021. 10.22331\/q-2021-06-17-479","DOI":"10.22331\/q-2021-06-17-479"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] N. Slate, E. Matwiejew, S. Marsh, and J.B. Wang, \u201cQuantum walk-based portfolio optimisation,\u201d Quantum, vol.5, p.513, 2021. 10.22331\/q-2021-07-28-513","DOI":"10.22331\/q-2021-07-28-513"},{"key":"22","unstructured":"[22] J.S. Baker and S.K. Radha, \u201cWasserstein solution quality and the quantum approximate optimization algorithm: A portfolio optimization case study,\u201d arXiv preprint arXiv:2202.06782, 2022."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] S. Hadfield, Z. Wang, B. O\u2019gorman, E.G. Rieffel, D. Venturelli, and R. Biswas, \u201cFrom the quantum approximate optimization algorithm to a quantum alternating operator ansatz,\u201d Algorithms, vol.12, no.2, p.34, 2019. 10.3390\/a12020034","DOI":"10.3390\/a12020034"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] P.K. Barkoutsos, G. Nannicini, A. Robert, I. Tavernelli, and S. Woerner, \u201cImproving variational quantum optimization using CVaR,\u201d Quantum, vol.4, p.256, 2020. 10.22331\/q-2020-04-20-256","DOI":"10.22331\/q-2020-04-20-256"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, \u201cA review on quantum approximate optimization algorithm and its variants,\u201d Physics Reports, vol.1068, pp.1-66, 2024. 10.1016\/j.physrep.2024.03.002","DOI":"10.1016\/j.physrep.2024.03.002"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] A. Gunjan and S. Bhattacharyya, \u201cA brief review of portfolio optimization techniques,\u201d Artificial Intelligence Review, vol.56, no.5, pp.3847-3886, 2022. 10.1007\/s10462-022-10273-7","DOI":"10.1007\/s10462-022-10273-7"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] A.A. Kamil, C.Y. Fei, and L.K. Kok, \u201cPortfolio analysis based on markowitz model,\u201d Journal of Statistics and Management Systems, vol.9, no.3, pp.519-536, 2006. 10.1080\/09720510.2006.10701221","DOI":"10.1080\/09720510.2006.10701221"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] B.M. Rom and K.W. Ferguson, \u201cPost-modern portfolio theory comes of age,\u201d Journal of investing, vol.3, no.3, pp.11-17, 1994. 10.3905\/joi.3.3.11","DOI":"10.3905\/joi.3.3.11"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] M. Chalupnik, H. Melo, Y. Alexeev, and A. Galda, \u201cAugmenting QAOA Ansatz with Multiparameter Problem-Independent Layer,\u201d 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pp.97-103, 2022. 10.1109\/qce53715.2022.00028","DOI":"10.1109\/QCE53715.2022.00028"},{"key":"30","unstructured":"[30] M.J.D. Powell, Advances in Optimization and Numerical Analysis, Kluwer Academic, Dordrecht, 1994."},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] G. Nannicini, \u201cPerformance of hybrid quantum-classical variational heuristics for combinatorial optimization,\u201d Physical Review E, vol.99, no.1, p.013304, 2019. 10.1103\/physreve.99.013304","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] S.-X. Zhang, J. Allcock, Z.-Q. Wan, S. Liu, J. Sun, H. Yu, X.-H. Yang, J. Qiu, Z. Ye, Y.-Q. Chen, C.-K. Lee, Y.-C. Zheng, S.-K. Jian, H. Yao, C.-Y. Hsieh, and S. Zhang, \u201cTensorCircuit: a Quantum Software Framework for the NISQ Era,\u201d Quantum, vol.7, p.912, 2023. 10.22331\/q-2023-02-02-912","DOI":"10.22331\/q-2023-02-02-912"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/7\/E108.D_2024EDP7254\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T23:35:57Z","timestamp":1751672157000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/7\/E108.D_2024EDP7254\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024edp7254","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,1]]},"article-number":"2024EDP7254"}}