{
  "annotation_id": "827410b7-6c01-4379-9983-20a068351bd4",
  "date_created": "2026-03-02T18:02:06.641000Z",
  "date_modified": "2026-03-02T18:02:06.641000Z",
  "file_hash": "cb99abcad76ed040929bf187e2c0309a652e7fbc1f6284dd2587862ac6cf1b2f",
  "private": false,
  "record": {
    "abstract": "We propose a new cryptographic protocol. It is suggested to encode\ninformation in ordinary binary form into many-qubit entangled states with the\nhelp of a quantum computer. A state of qubits (realized, e.g., with photons) is\ntransmitted through a quantum channel to the addressee, who applies a quantum\ncomputer tuned to realize the inverse unitary transformation decoding of the\nmessage. Different ways of eavesdropping are considered, and an estimate of the\ntime needed for determining the secret unitary transformation is given. It is\nshown that using even small quantum computers can serve as a basis for very\nefficient cryptographic protocols. For a suggested cryptographic protocol, the\ntime scale on which communication can be considered secure is exponential in\nthe number of qubits in the entangled states and in the number of gates used to\nconstruct the quantum network.",
    "arxiv_id": "quant-ph/0405190",
    "authors": [
      "K. V. Bayandin",
      "G. B. Lesovik"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.mes-hall",
      "cond-mat.supr-con",
      "physics.atom-ph",
      "physics.optics"
    ],
    "doi": "10.1134/1.1944077",
    "journal_ref": "JETP Letters, Vol. 81, No. 7, 2005, pp. 351-355",
    "title": "Using of small-scale quantum computers in cryptography with many-qubit   entangled states",
    "url": "https://arxiv.org/abs/quant-ph/0405190"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9537720a-d70a-497c-b621-4c3ef5010b62",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}