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 (Contributor), Shor, Peter W. (Contributor), Gosset, David Nicholas (Author), Hen, Itay (Author), Sandvik, A. W. (Author), Young, A. P. (Author), Zamponi, Francesco (Author)
Other Authors: Massachusetts Institute of Technology. Center for Theoretical Physics (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor), Massachusetts Institute of Technology. Department of Physics (Contributor)
Format: Article
Language:English
Published: American Physical Society, 2013-02-13T17:06:09Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items