Not logged in.png)
Share.png)
SaveEvidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
Shaydulin, Ruslan; Li, Changhao; Chakrabarti, Shouvanik; Decross, Matthew; Herman, Dylan; Kumar, Niraj; Larson, Jeffrey; Lykov, Danylo; Minssen, Pierre; Sun, Yue; Alexeev, Yuri; Dreiling, Joan M.; Gaebler, John P.; Gatterman, Thomas M.; Gerber, Justin A.; Gilmore, Kevin; Gresh, Dan; Hewitt, Nathan; Horst, Chandler V.; Hu, Shaohan; Johansen, Jacob; Matheny, Mitchell; Mengle, Tanner; Mills, Michael; Moses, Steven A.; Neyenhuis, Brian; Siegfried, Peter; Yalovetzky, Romina; Pistoia, Marco Share Save Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedupsAndrist, Ruben S.; Schuetz, Martin J. A.; Minssen, Pierre; Yalovetzky, Romina; Chakrabarti, Shouvanik; Herman, Dylan; Kumar, Niraj; Salton, Grant; Shaydulin, Ruslan; Sun, Yue; Pistoia, Marco; Katzgraber, Helmut G. Share Save Share Save Share Save Share Save 
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}