{
  "annotation_id": "45a9bd07-077e-447c-a646-53057e99d349",
  "date_created": "2026-03-02T18:01:45.402000Z",
  "date_modified": "2026-03-02T18:01:45.402000Z",
  "file_hash": "ce94ef2a57a5d885fff4479a1a1ec0f01cb43de302e876a730f59bfb66638d46",
  "private": false,
  "record": {
    "abstract": "The ultimate goal of the classicality programme is to quantify the amount of\nquantumness of certain processes. Here, classicality is studied for a\nrestricted type of process: quantum information processing (QIP). Under special\nconditions, one can force some qubits of a quantum computer into a classical\nstate without affecting the outcome of the computation. The minimal set of\nconditions is described and its structure is studied. Some implications of this\nformalism are the increase of noise robustness, a proof of the quantumness of\nmixed state quantum computing and a step forward in understanding the very\nfoundation of QIP.",
    "arxiv_id": "quant-ph/0108102",
    "authors": [
      "David Poulin"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.042319",
    "title": "Classicality of quantum information processing",
    "url": "https://arxiv.org/abs/quant-ph/0108102"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e7b9ef4a-f1fe-4c8c-8012-66a9ab599036",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}