{
  "annotation_id": "9e07e395-3702-4a48-9e8a-a3e4263c2806",
  "date_created": "2026-03-02T18:01:39.205000Z",
  "date_modified": "2026-03-02T18:01:39.205000Z",
  "file_hash": "0958451527b02b63e96424c36b1eeb25a9b79368ba7113f918fa7f56d3bad039",
  "private": false,
  "record": {
    "abstract": "A theoretical model of a quantum device which can factorize any number N in\ntwo steps i.e. by preparing an input state and performing a measurement is\ndiscussed. The analysis reveals that the duration of state preparation and\nmeasurement is proportional to N while the energy consumption grows like log N.\nThese results suggest the existence of Heisenberg-type relation putting limits\non the efficiency of a quantum computer in terms of a total computation time, a\ntotal energy consumption and a classical complexity of the problem.",
    "arxiv_id": "quant-ph/0006018",
    "authors": [
      "Robert Alicki"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Can quantum computer perform better than classical?",
    "url": "https://arxiv.org/abs/quant-ph/0006018"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "dfbfe5f8-246b-4767-9c57-05ccad0306da",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}