{
  "annotation_id": "3c806496-4c1c-43ad-abb6-561e5ab39883",
  "date_created": "2026-03-02T18:01:38.571000Z",
  "date_modified": "2026-03-02T18:01:38.571000Z",
  "file_hash": "0958c004e082a69b38757af77cc57861fba0701a1ec4781925889549dc9c5213",
  "private": false,
  "record": {
    "abstract": "We offer an improved method for using a nuclear-magnetic-resonance quantum\ncomputer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the\napplication of the NMRQC are exponential diminishment of density-matrix\nelements with the number of bits, threatening weak signal levels, and the high\ncost of preparing a suitable starting state. A third obstacle is a heretofore\nunnoticed restriction on measurement operators available for use by an NMRQC.\nVariations on the function classes of the Deutsch-Jozsa problem are introduced,\nboth to extend the range of problems advantageous for quantum computation and\nto escape all three obstacles to use of an NMRQC. By adapting it to one such\nfunction class, the Deutsch-Jozsa problem is made solvable without exponential\nloss of signal. The method involves an extra work bit and a polynomially more\ninvolved Oracle; it uses the thermal-equilibrium density matrix systematically\nfor an arbitrary number of spins, thereby avoiding both the preparation of a\npseudopure state and temporal averaging.",
    "arxiv_id": "quant-ph/0007043",
    "authors": [
      "John M. Myers",
      "A. F. Fahmy",
      "S. J. Glaser",
      "R. Marx"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.63.032302",
    "title": "Rapid solution of problems by nuclear-magnetic-resonance quantum   computation",
    "url": "https://arxiv.org/abs/quant-ph/0007043"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d5a98250-56df-4cae-a677-3a9499eea804",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}