{
  "annotation_id": "e897c80d-0b52-4944-8e38-55c50b0e5bf1",
  "date_created": "2026-03-02T18:02:41.591000Z",
  "date_modified": "2026-03-02T18:02:41.591000Z",
  "file_hash": "033aed8f3acf7973ad5249cdd73a377cdd1269d0a20110923e824ac6fb9f3d9f",
  "private": false,
  "record": {
    "abstract": "In bulk quantum computation one can manipulate a large number of\nindistinguishable quantum computers by parallel unitary operations and measure\nexpectation values of certain observables with limited sensitivity. The initial\nstate of each computer in the ensemble is known but not pure. Methods for\nobtaining effective pure input states by a series of manipulations have been\ndescribed by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial\naveraging) for the case of quantum computation with nuclear magnetic resonance.\nWe give a different technique called temporal averaging. This method is based\non classical randomization, requires no ancilla qubits and can be implemented\nin nuclear magnetic resonance without using gradient fields. We introduce\nseveral temporal averaging algorithms suitable for both high temperature and\nlow temperature bulk quantum computing and analyze the signal to noise behavior\nof each.",
    "arxiv_id": "quant-ph/9706053",
    "authors": [
      "Emanuel Knill",
      "Isaac Chuang",
      "Raymond Laflamme"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.57.3348",
    "title": "Effective Pure States for Bulk Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/9706053"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "08e5e776-7b29-460d-a31d-44bb729087d6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}