{
  "annotation_id": "25cd58a2-30ba-4c5b-a76f-7e2d6c0aa4f3",
  "date_created": "2026-03-02T18:02:09.394000Z",
  "date_modified": "2026-03-02T18:02:09.394000Z",
  "file_hash": "88a038cece256616dcdd3d42ac6be34a407d2bb8f055f18888e119a1e990108d",
  "private": false,
  "record": {
    "abstract": "We present a quantum algorithm that verifies a product of two n*n matrices\nover any field with bounded error in worst-case time n^{5/3} and expected time\nn^{5/3} / min(w,sqrt(n))^{1/3}, where w is the number of wrong entries. This\nimproves the previous best algorithm that runs in time n^{7/4}. We also present\na quantum matrix multiplication algorithm that is efficient when the result has\nfew nonzero entries.",
    "arxiv_id": "quant-ph/0409035",
    "authors": [
      "Harry Buhrman",
      "Robert Spalek"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Verification of Matrix Products",
    "url": "https://arxiv.org/abs/quant-ph/0409035"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "dec66fb6-1f9d-4fb5-92d4-ae1a3ed00f9b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}