{
  "annotation_id": "c270396f-5b65-43e9-bf9b-0942e090bebc",
  "date_created": "2026-03-02T18:01:38.004000Z",
  "date_modified": "2026-03-02T18:01:38.004000Z",
  "file_hash": "c05768457f97a782ca9f00f7205b0cfa7ec7d5f6fac0eacb3042598fc6743b0d",
  "private": false,
  "record": {
    "abstract": "We consider quantum computing in the k-qubit model where the starting state\nof a quantum computer consists of k qubits in a pure state and n-k qubits in a\nmaximally mixed state. We ask the following question: is there a general method\nfor simulating an arbitrary m-qubit pure state quantum computation by a quantum\ncomputation in the k-qubit model? We show that, under certain constraints, this\nis impossible, unless m=O(k+ log n).",
    "arxiv_id": "quant-ph/0003136",
    "authors": [
      "Andris Ambainis",
      "Leonard J. Schulman",
      "Umesh Vazirani"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Computing with highly mixed states",
    "url": "https://arxiv.org/abs/quant-ph/0003136"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f40fc3c5-1f0b-4651-8672-d1a4e89cbc75",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}