{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T01:43:18Z","timestamp":1784598198202,"version":"3.55.0"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-022-00446-y","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T17:12:40Z","timestamp":1647277960000},"page":"269-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks"],"prefix":"10.1038","volume":"4","author":[{"given":"Yu-Qin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chee-Kong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang-Yu","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"446_CR1","doi-asserted-by":"publisher","first-page":"17667","DOI":"10.1038\/s41598-018-36058-z","volume":"8","author":"S Jiang","year":"2018","unstructured":"Jiang, S., Britt, K. A., McCaskey, A. J., Humble, T. S. & Kais, S. Quantum annealing for prime factorization. Sci. Rep. 8, 17667 (2018).","journal-title":"Sci. Rep."},{"key":"446_CR2","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/s41586-018-0410-x","volume":"560","author":"AD King","year":"2018","unstructured":"King, A. D. et al. Observation of topological phenomena in a programmable lattice of 1,800 qubits. Nature 560, 456\u2013460 (2018).","journal-title":"Nature"},{"key":"446_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1126\/science.aat2025","volume":"361","author":"R Harris","year":"2018","unstructured":"Harris, R. et al. Phase transitions in a programmable quantum spin glass simulator. Science 361, 162\u2013165 (2018).","journal-title":"Science"},{"key":"446_CR4","doi-asserted-by":"publisher","first-page":"107006","DOI":"10.1016\/j.cpc.2019.107006","volume":"248","author":"D Willsch","year":"2020","unstructured":"Willsch, D., Willsch, M., De Raedt, H. & Michielsen, K. Support vector machines on the D-wave quantum annealer. Comput. Phys. Commun. 248, 107006 (2020).","journal-title":"Comput. Phys. Commun."},{"key":"446_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1038\/nature24047","volume":"550","author":"A Mott","year":"2017","unstructured":"Mott, A., Job, J., Vlimant, Jean-Roch, Lidar, D. & Spiropulu, M. Solving a Higgs optimization problem with quantum annealing for machine learning. Nature 550, 375\u2013379 (2017).","journal-title":"Nature"},{"key":"446_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1038\/s41534-018-0060-8","volume":"4","author":"RY Li","year":"2018","unstructured":"Li, R. Y., Di Felice, R., Rohs, R. & Lidar, D. A. Quantum annealing versus classical machine learning applied to a simplified computational biology problem. npj Quant. Inf. 4, 14 (2018).","journal-title":"npj Quant. Inf."},{"key":"446_CR7","doi-asserted-by":"publisher","first-page":"184416","DOI":"10.1103\/PhysRevB.95.184416","volume":"95","author":"L Hormozi","year":"2017","unstructured":"Hormozi, L., Brown, E. W., Carleo, G. & Troyer, M. Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass. Phys. Rev. B 95, 184416 (2017).","journal-title":"Phys. Rev. B"},{"key":"446_CR8","unstructured":"Herr, D. et al. Optimizing schedules for quantum annealing. Preprint at https:\/\/arxiv.org\/abs\/1705.00420 (2017)."},{"key":"446_CR9","doi-asserted-by":"publisher","first-page":"165305","DOI":"10.1088\/1751-8113\/49\/16\/165305","volume":"49","author":"L Zeng","year":"2016","unstructured":"Zeng, L., Zhang, J. & Sarovar, M. Schedule path optimization for adiabatic quantum computing and optimization. J Phys. A 49, 165305 (2016).","journal-title":"J Phys. A"},{"key":"446_CR10","doi-asserted-by":"publisher","first-page":"023002","DOI":"10.7566\/JPSJ.87.023002","volume":"87","author":"Y Susa","year":"2018","unstructured":"Susa, Y., Yamashiro, Y., Yamamoto, M. & Nishimori, H. Exponential speedup of quantum annealing by inhomogeneous driving of the transverse field. J. Phys. Soc. Jpn 87, 023002 (2018).","journal-title":"J. Phys. Soc. Jpn"},{"key":"446_CR11","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash, T. & Lidar, D. A. Adiabatic quantum computation. Rev. Mod. Phys. 90, 015002 (2018).","journal-title":"Rev. Mod. Phys."},{"key":"446_CR12","doi-asserted-by":"publisher","first-page":"054401","DOI":"10.1088\/1361-6633\/ab85b8","volume":"83","author":"P Hauke","year":"2020","unstructured":"Hauke, P. et al. Perspectives of quantum annealing: Methods and implementations. Rep. Progr. Phys. 83, 054401 (2020).","journal-title":"Rep. Progr. Phys."},{"key":"446_CR13","unstructured":"Farhi, E., Goldstone, J., Gutmann, S. & Sipser, M. Quantum computation by adiabatic evolution. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0001106 (2000)."},{"key":"446_CR14","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E. et al. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472\u2013475 (2001).","journal-title":"Science"},{"key":"446_CR15","doi-asserted-by":"crossref","unstructured":"Das, A. & Chakrabarti, B. K. Quantum Annealing and Related Optimization Methods (Springer, 2005).","DOI":"10.1007\/11526216"},{"key":"446_CR16","doi-asserted-by":"publisher","first-page":"012322","DOI":"10.1103\/PhysRevA.65.012322","volume":"65","author":"AM Childs","year":"2001","unstructured":"Childs, A. M., Farhi, E. & Preskill, J. Robustness of adiabatic quantum computation. Phys. Rev. A 65, 012322 (2001).","journal-title":"Phys. Rev. A"},{"key":"446_CR17","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/080734479","volume":"50","author":"D Aharonov","year":"2008","unstructured":"Aharonov, D. et al. Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50, 755\u2013787 (2008).","journal-title":"SIAM Rev."},{"key":"446_CR18","doi-asserted-by":"publisher","first-page":"022619","DOI":"10.1103\/PhysRevA.103.022619","volume":"103","author":"Y Susa","year":"2021","unstructured":"Susa, Y. & Nishimori, H. Variational optimization of the quantum annealing schedule for the Lechner\u2013Hauke\u2013Zoller scheme. Phys. Rev. A 103, 022619 (2021).","journal-title":"Phys. Rev. A"},{"key":"446_CR19","unstructured":"Herr, D. et al. Optimizing schedules for quantum annealing. Preprint at https:\/\/arxiv.org\/abs\/1705.00420 (2017)."},{"key":"446_CR20","doi-asserted-by":"crossref","unstructured":"Schiffer, B. F., Tura, J. & Cirac, J. I. Adiabatic spectroscopy and a variational quantum adiabatic algorithm. Preprint at https:\/\/arxiv.org\/abs\/2103.01226 (2021).","DOI":"10.1103\/PRXQuantum.3.020347"},{"key":"446_CR21","first-page":"833","volume":"9","author":"S Boixo","year":"2009","unstructured":"Boixo, S. et al. Eigenpath traversal by phase randomization. Quant. Inf. Comput. 9, 833\u2013855 (2009).","journal-title":"Quant. Inf. Comput."},{"key":"446_CR22","doi-asserted-by":"publisher","unstructured":"Coulom, R. in Computers and Games 72\u201383 (Springer, 2007); https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"446_CR23","doi-asserted-by":"crossref","unstructured":"Kocsis, L. & Szepesv\u00e1ri, C. Bandit based Monte-Carlo planning. In European Conference on Machine Learning 282\u2013293 (Springer, 2006).","DOI":"10.1007\/11871842_29"},{"key":"446_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TCIAIG.2009.2018703","volume":"1","author":"Chang-Shing Lee","year":"2009","unstructured":"Lee, Chang-Shing et al. The computational intelligence of Mogo revealed in Taiwan\u2019s computer Go tournaments. IEEE Trans. Comput. Intell. AI Games 1, 73\u201389 (2009).","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"446_CR25","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D. et al. Mastering the game of go without human knowledge. Nature 550, 354\u2013359 (2017).","journal-title":"Nature"},{"key":"446_CR26","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D. et al. A general reinforcement learning algorithm that masters Chess, Shogi, and Go through self-play. Science 362, 1140\u20131144 (2018).","journal-title":"Science"},{"key":"446_CR27","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).","journal-title":"Nat. Commun."},{"key":"446_CR28","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1038\/nature23879","volume":"549","author":"A Kandala","year":"2017","unstructured":"Kandala, A. et al. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 242\u2013246 (2017).","journal-title":"Nature"},{"key":"446_CR29","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. Preprint at https:\/\/arxiv.org\/abs\/1411.4028 (2014)."},{"key":"446_CR30","doi-asserted-by":"publisher","first-page":"023023","DOI":"10.1088\/1367-2630\/18\/2\/023023","volume":"18","author":"JR McClean","year":"2016","unstructured":"McClean, J. R., Romero, J., Babbush, R. & Aspuru-Guzik, A. The theory of variational hybrid quantum\u2013classical algorithms. New. J. Phys. 18, 023023 (2016).","journal-title":"New. J. Phys."},{"key":"446_CR31","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).","journal-title":"Quantum"},{"key":"446_CR32","doi-asserted-by":"publisher","first-page":"10856","DOI":"10.1021\/acs.chemrev.8b00803","volume":"119","author":"Y Cao","year":"2019","unstructured":"Cao, Y. et al. Quantum chemistry in the age of quantum computing. Chem. Rev. 119, 10856\u201310915 (2019).","journal-title":"Chem. Rev."},{"key":"446_CR33","doi-asserted-by":"publisher","first-page":"180501","DOI":"10.1103\/PhysRevLett.125.180501","volume":"125","author":"M-C Chen","year":"2020","unstructured":"Chen, M.-C. et al. Demonstration of adiabatic variational quantum computing with a superconducting quantum coprocessor. Phys. Rev. Lett. 125, 180501 (2020).","journal-title":"Phys. Rev. Lett."},{"key":"446_CR34","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1038\/s41534-019-0241-0","volume":"6","author":"M Dalgaard","year":"2020","unstructured":"Dalgaard, M., Motzoi, F., S\u00f8rensen, J. J. & Sherson, J. Global optimization of quantum dynamics with AlphaZero deep exploration. npj Quant. Inf. 6, 6 (2020).","journal-title":"npj Quant. Inf."},{"key":"446_CR35","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1038\/s41534-019-0201-8","volume":"5","author":"X-M Zhang","year":"2019","unstructured":"Zhang, X.-M., Wei, Z., Asad, R., Yang, X.-C. & Wang, X. When reinforcement learning stands out in quantum control? A comparative study on state preparation. npj Quant. Inf. 5, 85 (2019).","journal-title":"npj Quant. Inf."},{"key":"446_CR36","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/TNNLS.2013.2283574","volume":"25","author":"C Chen","year":"2014","unstructured":"Chen, C., Dong, D., Li, H.-X., Chu, J. & Tarn, T.-J. Fidelity-based probabilistic Q-learning for control of quantum systems. IEEE Trans. Neural Netw. Learn. Syst. 25, 920\u2013933 (2014).","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"446_CR37","first-page":"031086","volume":"8","author":"M Bukov","year":"2018","unstructured":"Bukov, M. et al. Reinforcement learning in different phases of quantum control. Phys. Rev. X 8, 031086 (2018).","journal-title":"Phys. Rev. X"},{"key":"446_CR38","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1038\/s41534-019-0141-3","volume":"5","author":"MY Niu","year":"2019","unstructured":"Niu, M. Y., Boixo, S., Smelyanskiy, V. N. & Neven, H. Universal quantum control through deep reinforcement learning. npj Quant. Inf. 5, 33 (2019).","journal-title":"npj Quant. Inf."},{"key":"446_CR39","unstructured":"McKiernan, K. A., Davis, E., Alam, M. S. & Rigetti, C. Automated quantum programming via reinforcement learning for combinatorial optimization. Preprint at https:\/\/arxiv.org\/abs\/1908.08054 (2019)."},{"key":"446_CR40","unstructured":"Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y. & Balaprakash, P. Reinforcement-learning-based variational quantum circuits optimization for combinatorial problems. Preprint at https:\/\/arxiv.org\/abs\/1911.04574 (2019)."},{"key":"446_CR41","doi-asserted-by":"publisher","first-page":"052327","DOI":"10.1103\/PhysRevA.101.052327","volume":"101","author":"J Lin","year":"2020","unstructured":"Lin, J., Lai, Z. Y. & Li, X. Quantum adiabatic algorithm design using reinforcement learning. Phys. Rev. A 101, 052327 (2020).","journal-title":"Phys. Rev. A"},{"key":"446_CR42","doi-asserted-by":"publisher","first-page":"025009","DOI":"10.1088\/2632-2153\/abc328","volume":"2","author":"D Beloborodov","year":"2020","unstructured":"Beloborodov, D. et al. Reinforcement learning enhanced quantum-inspired algorithm for combinatorial optimization. Mach. Learn. Sci. Technol. 2, 025009 (2020).","journal-title":"Mach. Learn. Sci. Technol."},{"key":"446_CR43","doi-asserted-by":"crossref","unstructured":"Ayanzadeh, R., Halem, M. & Finin, T. Reinforcement quantum annealing: a quantum-assisted learning automata approach. Preprint at https:\/\/arxiv.org\/abs\/2001.00234 (2020).","DOI":"10.1038\/s41598-020-64078-1"},{"key":"446_CR44","unstructured":"Sutton, R. S. and Barto, A. G. Reinforcement Learning: An Introduction (Bradford, 2018)."},{"key":"446_CR45","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling, L. P., Littman, M. L. & Moore, A. W. Reinforcement learning: a survey. J. Artif. Intell. Res. 4, 237\u2013285 (1996).","journal-title":"J. Artif. Intell. Res."},{"key":"446_CR46","doi-asserted-by":"publisher","unstructured":"van Otterlo, M. & Wiering, M. in Adaptation, Learning, and Optimization 3\u201342 (Springer, 2012); https:\/\/doi.org\/10.1007\/978-3-642-27645-3_1","DOI":"10.1007\/978-3-642-27645-3_1"},{"key":"446_CR47","unstructured":"Mnih, V. et al. Playing Atari with deep reinforcement learning. Preprint at https:\/\/arxiv.org\/abs\/1312.5602 (2013)."},{"key":"446_CR48","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V. et al. Human-level control through deep reinforcement learning. Nature 518, 529\u2013533 (2015).","journal-title":"Nature"},{"key":"446_CR49","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A. & Klimov, O. Proximal policy optimization algorithms. Preprint at https:\/\/arxiv.org\/abs\/1707.06347 (2017)"},{"key":"446_CR50","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1613\/jair.5507","volume":"60","author":"T Vodopivec","year":"2017","unstructured":"Vodopivec, T., Samothrakis, S. & Ster, B. On Monte Carlo tree search and reinforcement learning. J. Artif. Intell. Res. 60, 881\u2013936 (2017).","journal-title":"J. Artif. Intell. Res."},{"key":"446_CR51","doi-asserted-by":"publisher","first-page":"215","DOI":"10.22331\/q-2019-12-16-215","volume":"3","author":"HendrikPoulsen Nautrup","year":"2019","unstructured":"Nautrup, HendrikPoulsen, Delfosse, N., Dunjko, V., Briegel, H. J. & Friis, N. Optimizing quantum error correction codes with reinforcement learning. Quantum 3, 215 (2019).","journal-title":"Quantum"},{"key":"446_CR52","doi-asserted-by":"publisher","first-page":"025015","DOI":"10.1088\/2058-9565\/abe139","volume":"6","author":"S Kanno","year":"2021","unstructured":"Kanno, S. & Tada, T. Many-body calculations for periodic materials via restricted Boltzmann machine-based VQE. Quant. Sci. Technol. 6, 025015 (2021).","journal-title":"Quant. Sci. Technol."},{"key":"446_CR53","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s11128-020-02748-9","volume":"19","author":"MES Morales","year":"2020","unstructured":"Morales, M. E. S., Biamonte, J. & Zimbor\u00e1s, Z. On the universality of the quantum approximate optimization algorithm. Quant. Inf. Process. 19, 291 (2020).","journal-title":"Quant. Inf. Process."},{"key":"446_CR54","doi-asserted-by":"publisher","first-page":"022326","DOI":"10.1103\/PhysRevA.84.022326","volume":"84","author":"T Caneva","year":"2011","unstructured":"Caneva, T., Calarco, T. & Montangero, S. Chopped random-basis quantum optimization. Phys. Rev. A 84, 022326 (2011).","journal-title":"Phys. Rev. A"},{"key":"446_CR55","first-page":"031084","volume":"8","author":"T F\u00f6sel","year":"2018","unstructured":"F\u00f6sel, T., Tighineanu, P., Weiss, T. & Marquardt, F. Reinforcement learning with neural networks for quantum feedback. Phys. Rev. X 8, 031084 (2018).","journal-title":"Phys. Rev. X"},{"key":"446_CR56","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1038\/s41534-019-0198-z","volume":"5","author":"H Xu","year":"2019","unstructured":"Xu, H. et al. Generalizable control for quantum parameter estimation through reinforcement learning. npj Quant. Inf. 5, 82 (2019).","journal-title":"npj Quant. Inf."},{"key":"446_CR57","doi-asserted-by":"publisher","first-page":"010301","DOI":"10.1103\/PRXQuantum.1.010301","volume":"1","author":"J Walln\u00f6fer","year":"2020","unstructured":"Walln\u00f6fer, J. et al. Machine learning for long-distance quantum communication. PRX Quant. 1, 010301 (2020).","journal-title":"PRX Quant."},{"key":"446_CR58","unstructured":"Karanikolas, V. & Kawabata, S. Improved performance of quantum annealing by a diabatic pulse application. Preprint at https:\/\/arxiv.org\/abs\/1806.08517 (2018)."},{"key":"446_CR59","doi-asserted-by":"publisher","first-page":"061007","DOI":"10.7566\/JPSJ.88.061007","volume":"88","author":"J King","year":"2019","unstructured":"King, J. et al. Quantum annealing amid local ruggedness and global frustration. J. Phys. Soc. Jpn 88, 061007 (2019).","journal-title":"J. Phys. Soc. Jpn"},{"key":"446_CR60","doi-asserted-by":"publisher","first-page":"022314","DOI":"10.1103\/PhysRevA.67.022314","volume":"67","author":"T Hogg","year":"2003","unstructured":"Hogg, T. Adiabatic quantum computing for random satisfiability problems. Phys. Rev. A 67, 022314 (2003).","journal-title":"Phys. Rev. A"},{"key":"446_CR61","doi-asserted-by":"publisher","first-page":"062305","DOI":"10.1103\/PhysRevA.71.062305","volume":"71","author":"M \u017dnidari\u010d","year":"2005","unstructured":"\u017dnidari\u010d, M. Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability. Phys. Rev. A 71, 062305 (2005).","journal-title":"Phys. Rev. A"},{"key":"446_CR62","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S Kirkpatrick","year":"1994","unstructured":"Kirkpatrick, S. & Selman, B. Critical behavior in the satisfiability of random boolean expressions. Science 264, 1297\u20131301 (1994).","journal-title":"Science"},{"key":"446_CR63","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B. & Troyansky, L. Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature 400, 133\u2013137 (1999).","journal-title":"Nature"},{"key":"446_CR64","unstructured":"Brockman, G. et al. OpenAI gym. Preprint at https:\/\/arxiv.org\/abs\/1606.01540 (2016)."},{"key":"446_CR65","unstructured":"Dhariwal, P. et al. OpenAI Baselines (GitHub, 2017); https:\/\/github.com\/openai\/baselines"},{"key":"446_CR66","unstructured":"Lloyd, S. Quantum approximate optimization is computationally universal. Preprint at https:\/\/arxiv.org\/abs\/1812.11075 (2018)."},{"key":"446_CR67","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. Quantum adiabatic evolution algorithms versus simulated annealing. Preprint at https:\/\/arxiv.org\/abs\/quant-ph\/0201031 (2002)."},{"key":"446_CR68","doi-asserted-by":"publisher","first-page":"1750011","DOI":"10.1142\/S0219749917500113","volume":"15","author":"L Kong","year":"2017","unstructured":"Kong, L. & Crosson, E. The performance of the quantum adiabatic algorithm on spike Hamiltonians. Int. J. Quant. Inf. 15, 1750011 (2017).","journal-title":"Int. J. Quant. Inf."},{"key":"446_CR69","doi-asserted-by":"publisher","first-page":"042308","DOI":"10.1103\/PhysRevA.65.042308","volume":"65","author":"J Roland","year":"2002","unstructured":"Roland, J. & Cerf, N. J. Quantum search by local adiabatic evolution. Phys. Rev. A 65, 042308 (2002).","journal-title":"Phys. Rev. A"},{"key":"446_CR70","doi-asserted-by":"publisher","first-page":"070505","DOI":"10.1103\/PhysRevLett.126.070505","volume":"126","author":"LT Brady","year":"2021","unstructured":"Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y. & Gorshkov, A. V. Optimal protocols in quantum annealing and quantum approximate optimization algorithm problems. Phys. Rev. Lett. 126, 070505 (2021).","journal-title":"Phys. Rev. Lett."},{"key":"446_CR71","doi-asserted-by":"publisher","unstructured":"Chen, Y. et al. yutuer21\/quantumzero: Quantumzero (Zenodo, 2021); https:\/\/doi.org\/10.5281\/zenodo.5749588","DOI":"10.5281\/zenodo.5749588"}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-022-00446-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-022-00446-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-022-00446-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T09:19:44Z","timestamp":1669367984000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-022-00446-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":71,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["446"],"URL":"https:\/\/doi.org\/10.1038\/s42256-022-00446-y","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"21 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}