{
  "annotation_id": "7f803b03-bbe3-4cbe-aad0-ff0c4b6f9cb9",
  "date_created": "2026-03-02T18:02:03.319000Z",
  "date_modified": "2026-03-02T18:02:03.319000Z",
  "file_hash": "60752bc7c19c72158d78f9818fab1009271b7f31c497bd1345d9a0856f8c793a",
  "private": false,
  "record": {
    "abstract": "Quantum computation based on quantum cellular automata (QCA) can greatly\nreduce the control and precision necessary for experimental implementations of\nquantum information processing. A QCA system consists of a few species of\nqubits in which all qubits of a species evolve in parallel. We show that, in\nspite of its inherent constraints, a QCA system can be used to study complex\nquantum dynamics. To this aim, we demonstrate scalable operations on a QCA\nsystem that fulfill statistical criteria of randomness and explore which\ncriteria of randomness can be fulfilled by operators from various QCA\narchitectures. Other means of realizing random operators with only a few\nindependent operators are also discussed.",
    "arxiv_id": "quant-ph/0401040",
    "authors": [
      "Yaakov S. Weinstein",
      "C. Stephen Hellberg"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.69.062301",
    "journal_ref": "Phys. Rev. A, 69, 062301, (2004).",
    "title": "Quantum Cellular Automata Pseudo-Random Maps",
    "url": "https://arxiv.org/abs/quant-ph/0401040"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "107de970-4195-4057-8194-d6e285fa8965",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}