{
  "annotation_id": "f9ceec18-e1cc-41ad-a3f1-a23ccca54446",
  "date_created": "2026-03-02T18:01:56.251000Z",
  "date_modified": "2026-03-02T18:01:56.251000Z",
  "file_hash": "9bc788a843e81b835013a0991f62072e7dae41bb86c1dbcda9b96090065a4bef",
  "private": false,
  "record": {
    "abstract": "We introduce a method for finding the required control parameters for a\nquantum computer that yields the desired quantum algorithm without invoking\nelementary gates. We concentrate on the Josephson charge-qubit model, but the\nscenario is readily extended to other physical realizations. Our strategy is to\nnumerically find any desired double- or triple-qubit gate. The motivation is\nthe need to significantly accelerate quantum algorithms in order to fight\ndecoherence.",
    "arxiv_id": "quant-ph/0302052",
    "authors": [
      "Antti O. Niskanen",
      "Juha J. Vartiainen",
      "Martti M. Salomaa"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.90.197901",
    "title": "Optimal multiqubit operations for Josephson charge qubits",
    "url": "https://arxiv.org/abs/quant-ph/0302052"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0f1a3435-b554-400a-adb4-8a660bf0fe01",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}