Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Polynomial unconstrained binary optimisation inspired by optical
  simulation   We propose an algorithm inspired by optical coherent Ising machines to solve
the problem of polynomial unconstrained binary optimisation (PUBO). We
benchmark the proposed algorithm against existing PUBO algorithms on the
extended Sherrington-Kirkpatrick model and random third-degree polynomial
pseudo-Boolean functions, and observe its superior performance. We also address
instances of practically relevant computational problems such as protein
folding and electronic structure calculations with problem sizes not accessible
to existing quantum annealing devices. In particular, we successfully find the
lowest-energy conformation of lattice protein molecules containing up to eleven
amino-acids. The application of our algorithm to quantum chemistry sheds light
on the shortcomings of approximating the electronic structure problem by a PUBO
problem, which, in turn, puts into question the applicability of quantum
annealers in this context.

14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
36
The categories of this paper are: cmp-lg
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
35
The categories of this paper are: mtrl-th
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph