Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs

In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular max-cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on...

Full description

Bibliographic Details
Main Authors: Farhi, Edward, Shor, Peter W., Gosset, David Nicholas, Hen, Itay, Sandvik, A. W., Young, A. P., Zamponi, Francesco
Other Authors: Massachusetts Institute of Technology. Center for Theoretical Physics
Format: Article
Language:en_US
Published: American Physical Society 2013
Online Access:http://hdl.handle.net/1721.1/76798
https://orcid.org/0000-0002-7309-8489
https://orcid.org/0000-0003-4626-5648

Internet

http://hdl.handle.net/1721.1/76798
https://orcid.org/0000-0002-7309-8489
https://orcid.org/0000-0003-4626-5648

Similar Items