{
  "annotation_id": "fd634af1-b550-43d5-a4e0-48ecaead2cee",
  "date_created": "2026-03-02T18:02:41.538000Z",
  "date_modified": "2026-03-02T18:02:41.538000Z",
  "file_hash": "6df8bb10cca20215e86c6457a06003b9339b99e162fe987dd06ac211b24582a3",
  "private": false,
  "record": {
    "abstract": "The many-body dynamics of a quantum computer can be reduced to the time\nevolution of non-interacting quantum bits in auxiliary fields by use of the\nHubbard-Stratonovich representation of two-bit quantum gates in terms of\none-bit gates. This makes it possible to perform the stochastic simulation of a\nquantum algorithm, based on the Monte Carlo evaluation of an integral of\ndimension polynomial in the number of quantum bits. As an example, the\nsimulation of the quantum circuit for the Fast Fourier Transform is discussed.",
    "arxiv_id": "quant-ph/9703050",
    "authors": [
      "N. J. Cerf",
      "S. E. Koonin"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Math. and Comp. in Simulation 47 (1998), 143-152",
    "title": "Monte Carlo Simulation of Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/9703050"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e04ee412-c413-449c-be3c-0e5f90ad9869",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}