Ruslan Shaydulin et al.: Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem. (2023)journals/corr/abs-2308-0234210.48550/ARXIV.2308.02342Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem.29Ruslan Shaydulin1Changhao Li2Shouvanik Chakrabarti3Matthew DeCross4Dylan Herman5Niraj Kumar6Jeffrey Larson 00017Danylo Lykov8Pierre Minssen9Yue Sun10Yuri Alexeev11Joan M. Dreiling12John P. Gaebler13Thomas M. Gatterman14Justin A. Gerber15Kevin Gilmore16Dan Gresh17Nathan Hewitt18Chandler V. Horst19Shaohan Hu20Jacob Johansen21Mitchell Matheny22Tanner Mengle23Michael Mills24Steven A. Moses25Brian Neyenhuis26Peter Siegfried27Romina Yalovetzky28Marco Pistoia29CoRRCoRRabs/2308.023422023provenance information for RDF data of dblp record 'journals/corr/abs-2308-02342'2024-05-07T20:15:58+0200