{
  "annotation_id": "a3c5fba8-a039-4336-8a8d-6c8be9546372",
  "date_created": "2026-03-02T18:02:20.140000Z",
  "date_modified": "2026-03-02T18:02:20.140000Z",
  "file_hash": "a42e5738b6b2f16b57b7cf3b3adbabf4e3134aa1ba7e4f44b7ba775f5d90fd1e",
  "private": false,
  "record": {
    "abstract": "A C# package is presented that allows a user for an input quantum circuit to\ngenerate a set of multivariate polynomials over the finite field Z_2 whose\ntotal number of solutions in Z_2 determines the output of the quantum\ncomputation defined by the circuit. The generated polynomial system can further\nbe converted to the canonical Groebner basis form which provides a universal\nalgorithmic tool for counting the number of common roots of the polynomials.",
    "arxiv_id": "quant-ph/0509064",
    "authors": [
      "Vladimir P. Gerdt",
      "Vasily M. Severyanov"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/j.nima.2005.11.147",
    "title": "A Software Package to Construct Polynomial Sets over Z_2 for Determining   the Output of Quantum Computations",
    "url": "https://arxiv.org/abs/quant-ph/0509064"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e404f588-2241-4ec6-a952-31a516ab5b2f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}