{
  "annotation_id": "573f9032-e44c-4a16-8031-d7c60fd689a0",
  "date_created": "2026-03-02T18:02:47.930000Z",
  "date_modified": "2026-03-02T18:02:47.930000Z",
  "file_hash": "3471755c2e1306ad31fb88a447c4ea899b3280c05f64e3028dd35ecd74717a64",
  "private": false,
  "record": {
    "abstract": "Grover\u0027s quantum algorithm for an unstructured search problem and the Count\nalgorithm by Brassard et al. are generalized to the case when the initial state\nis arbitrarily and maximally entangled. This ansatz might be relevant with\nquantum subroutines, when the computational qubits and the environment are\ncoupled, and in general when the control over the quantum system is partial.",
    "arxiv_id": "quant-ph/9909089",
    "authors": [
      "A. Carlini",
      "A. Hosoya"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Computers and Unstructured Search: Finding and Counting Items   with an Arbitrarily Entangled Initial State",
    "url": "https://arxiv.org/abs/quant-ph/9909089"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "df37a7b7-179f-482f-937f-e834ded1d739",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}