We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
(Sub)Exponential advantage of adiabatic quantum computation with no sign problem
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Adiabatic Quantum Computation in Open Systems
![QR code for arXiv:2005.03791 [quant-ph]](http://oss.arxitics.com/images/favicon.svg)