{
  "annotation_id": "c297c669-dd15-4c3e-ac76-7232e1e49eed",
  "date_created": "2026-03-02T18:02:23.432000Z",
  "date_modified": "2026-03-02T18:02:23.432000Z",
  "file_hash": "43844764588eee9a63f0ccdc95ed8c8d2953f01d828e1c197f256c97687f12c0",
  "private": false,
  "record": {
    "abstract": "We show that an n-th root of the Walsh-Hadamard transform (obtained from the\nHadamard gate and a cyclic permutation of the qubits), together with two\ndiagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit)\nand a non-local phase-flip (for a fixed but arbitrary coefficient), can do\nuniversal quantum computation on n qubits. A quantum computation, making use of\nn qubits and based on these operations, is then a word of variable length, but\nwhose letters are always taken from an alphabet of cardinality three.\nTherefore, in contrast with other universal sets, no choice of qubit lines is\nneeded for the application of the operations described here. A quantum\nalgorithm based on this set can be interpreted as a discrete diffusion of a\nquantum particle on a de Bruijn graph, corrected on-the-fly by auxiliary\nmodifications of the phases associated to the arcs.",
    "arxiv_id": "quant-ph/0601078",
    "authors": [
      "Simone Severini"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0305-4470/39/26/016",
    "journal_ref": "J. Physics A: Math. Gen. 39 (2006) 8507-8515.",
    "title": "Universal quantum computation with unlabeled qubits",
    "url": "https://arxiv.org/abs/quant-ph/0601078"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "48c0404f-4d27-4d3c-b795-3d335536d339",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}