{
  "annotation_id": "340755ac-60d9-4bbe-a281-564103d29a1e",
  "date_created": "2026-03-02T18:02:17.100000Z",
  "date_modified": "2026-03-02T18:02:17.100000Z",
  "file_hash": "a7b91b6750ed94dff2aa2a5f28c585154f3442d7b166058e2df9f8f9bf8d91da",
  "private": false,
  "record": {
    "abstract": "Matrix product states provide a natural entanglement basis to represent a\nquantum register and operate quantum gates on it. This scheme can be\nmaterialized to simulate a quantum adiabatic algorithm solving hard instances\nof a NP-Complete problem. Errors inherent to truncations of the exact action of\ninteracting gates are controlled by the size of the matrices in the\nrepresentation. The property of finding the right solution for an instance and\nthe expected value of the energy are found to be remarkably robust against\nthese errors. As a symbolic example, we simulate the algorithm solving a\n100-qubit hard instance, that is, finding the correct product state out of ~\n10^30 possibilities. Accumulated statistics for up to 60 qubits point at a slow\ngrowth of the average minimum time to solve hard instances with\nhighly-truncated simulations of adiabatic quantum evolution.",
    "arxiv_id": "quant-ph/0503174",
    "authors": [
      "M. C. Banuls",
      "R. Orus",
      "J. I. Latorre",
      "A. Perez",
      "P. Ruiz-Femenia"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.other",
      "physics.comp-ph"
    ],
    "doi": "10.1103/PhysRevA.73.022344",
    "journal_ref": "Phys. Rev. A 73, 022344 (2006)",
    "title": "Simulation of many-qubit quantum computation with matrix product states",
    "url": "https://arxiv.org/abs/quant-ph/0503174"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "820272b9-0499-4ce2-8f2d-4331c90f528f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}