{
  "id": "2011.03403",
  "version": "v1",
  "published": "2020-11-06T15:03:27.000Z",
  "updated": "2020-11-06T15:03:27.000Z",
  "title": "Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm",
  "authors": [
    "Michael Streif",
    "Sheir Yarkoni",
    "Andrea Skolik",
    "Florian Neukart",
    "Martin Leib"
  ],
  "categories": [
    "quant-ph"
  ],
  "abstract": "The binary paint shop problem (BPSP) is an APX-hard optimization problem of the automotive industry. In this work, we show how to use the Quantum Approximate Optimization Algorithm (QAOA) to find solutions of the BPSP and demonstrate that QAOA with constant depth is able to beat classical heuristics on average in the infinite size limit $n\\rightarrow\\infty$. For the BPSP, it is known that no classical algorithm can exist which approximates the problem in polynomial runtime. We introduce a BPSP instance which is hard to solve with QAOA, and numerically investigate its performance and discuss QAOA's ability to generate approximate solutions. We complete our studies by running first experiments of small-sized instances on a trapped-ion quantum computer through AWS Braket.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-11-06T15:03:27.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum approximate optimization algorithm",
      "binary paint shop problem",
      "beating classical heuristics"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}