{
  "annotation_id": "dbea8c80-41a4-404d-bb07-336b69a33846",
  "date_created": "2026-03-02T18:01:51.895000Z",
  "date_modified": "2026-03-02T18:01:51.895000Z",
  "file_hash": "f0c61a088dfaf0565d6c74ae6a86e61acb7a0d045b051323299f31cdbdf48acf",
  "private": false,
  "record": {
    "abstract": "In this paper, we present an architecture and implementation algorithm such\nthat digital data can be switched in the quantum domain. First we define the\nconnection digraph which can be used to describe the behavior of a switch at a\ngiven time, then we show how a connection digraph can be implemented using\nelementary quantum gates. The proposed mechanism supports unicasting as well as\nmulticasting, and is strict-sense non-blocking. It can be applied to perform\neither circuit switching or packet switching. Compared with a traditional space\nor time domain switch, the proposed switching mechanism is more scalable.\nAssuming an n-by-n quantum switch, the space consumption grows linearly, i.e.\nO(n), while the time complexity is O(1) for unicasting, and O(log n) for\nmulticasting. Based on these advantages, a high throughput switching device can\nbe built simply by increasing the number of I/O ports.",
    "arxiv_id": "quant-ph/0207064",
    "authors": [
      "I. M. Tsai",
      "S. Y. Kuo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1109/TNANO.2002.806824",
    "title": "Digital Switching in the Quantum Domain",
    "url": "https://arxiv.org/abs/quant-ph/0207064"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "09e6ddcc-a758-4a81-ac0b-6f53da431c54",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}