{
  "annotation_id": "a77f19f4-e149-4c97-b9f0-149d2f1a3d74",
  "date_created": "2026-03-02T18:02:13.630000Z",
  "date_modified": "2026-03-02T18:02:13.630000Z",
  "file_hash": "8ff127225614594a0571afc9041492d579b81f17dd713c34a798d8966db1cfd2",
  "private": false,
  "record": {
    "abstract": "Using the tensor product representation in the density matrix renormalization\ngroup, we show that a quantum circuit of Grover\u0027s algorithm, which has\none-qubit unitary gates, generalized Toffoli gates, and projective\nmeasurements, can be efficiently simulated by a classical computer. It is\npossible to simulate quantum circuits with several ten qubits.",
    "arxiv_id": "quant-ph/0411205",
    "authors": [
      "A. Kawaguchi",
      "K. Shimizu",
      "Y. Tokura",
      "N. Imoto"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Classical simulation of quantum algorithms using the tensor product   representation",
    "url": "https://arxiv.org/abs/quant-ph/0411205"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "85646622-f694-4dbc-8257-fc72cce6eb7d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}