{
  "annotation_id": "92e0bb1e-ec2e-4cd9-85a3-9b415966f56e",
  "date_created": "2026-03-02T18:02:38.119000Z",
  "date_modified": "2026-03-02T18:02:38.119000Z",
  "file_hash": "a32e136cb8e4289be9c722b460a87e768ae382bbcc19c2a41f82e77c68bf7b7b",
  "private": false,
  "record": {
    "abstract": "This paper extends work done to date on quantum computation by associating\npotentials with different types of computation steps. Quantum Turing machine\nHamiltonians, generalized to include potentials, correspond to sums over tight\nbinding Hamiltonians each with a different potential distribution. Which\ndistribution applies is determined by the initial state. An example, which\nenumerates the integers in succession as binary strings, is analyzed. It is\nseen that for some initial states the potential distributions have\nquasicrystalline properties and are similar to a substitution sequence.",
    "arxiv_id": "quant-ph/9610026",
    "authors": [
      "Paul Benioff"
    ],
    "categories": [
      "quant-ph",
      "cond-mat"
    ],
    "doi": "10.1103/PhysRevLett.78.590",
    "journal_ref": "Phys.Rev.Lett.78:590-593,1997",
    "title": "Tight Binding Hamiltonians and Quantum Turing Machines",
    "url": "https://arxiv.org/abs/quant-ph/9610026"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a619f61e-4225-4fd3-9f67-3b8f987e9bb3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}