{
  "id": "2009.06667",
  "version": "v1",
  "published": "2020-09-14T18:07:43.000Z",
  "updated": "2020-09-14T18:07:43.000Z",
  "title": "Representation matching for delegated quantum computing",
  "authors": [
    "Yuxiang Yang",
    "Masahito Hayashi"
  ],
  "comment": "9 pages, 6 figures; comments are very welcome",
  "categories": [
    "quant-ph"
  ],
  "abstract": "Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for delegated quantum computing. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including delegated execution of unitary gate arrays, permutation gates, and unitary conjugation, as well as the storage and retrieval of unitary gates.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-09-14T18:07:43.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "delegated quantum computing",
      "unitary gate arrays",
      "generic probabilistic protocol",
      "quantum computational tasks",
      "representation matching protocol"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}