{
  "annotation_id": "af5216ff-4664-43ff-9e8e-4b56b80d3ae0",
  "date_created": "2026-03-02T18:01:37.947000Z",
  "date_modified": "2026-03-02T18:01:37.947000Z",
  "file_hash": "895eb385882cea007643a0a9c071d53d7d18363c58e2a4cf375ce426b78998e3",
  "private": false,
  "record": {
    "abstract": "We develop a multi-valued logic for quantum computing for use in multi-level\nquantum systems, and discuss the practical advantages of this approach for\nscaling up a quantum computer. Generalizing the methods of binary quantum\nlogic, we establish that arbitrary unitary operations on any number of d-level\nsystems (d \u003e 2) can be decomposed into logic gates that operate on only two\nsystems at a time. We show that such multi-valued logic gates are\nexperimentally feasible in the context of the linear ion trap scheme for\nquantum computing. By using d levels in each ion in this scheme, we reduce the\nnumber of ions needed for a computation by a factor of log d.",
    "arxiv_id": "quant-ph/0002033",
    "authors": [
      "Ashok Muthukrishnan",
      "C. R. Stroud, Jr"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.62.052309",
    "title": "Multi-valued Logic Gates for Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0002033"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b14c0d66-ed16-4e97-bb0b-8a128f0aaba9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}