{
  "annotation_id": "dfd28e98-91b4-4908-ad12-bf402e3682de",
  "date_created": "2026-02-17T05:53:19.776000Z",
  "date_modified": "2026-02-17T05:53:19.776000Z",
  "file_hash": "1b9cd5b0fff58ac1b76e51dcd256757fc05c3471f50a213fad71f233164e715b",
  "private": false,
  "record": {
    "abstract": "A recent advancement in quantum computing shows a quantum advantage of certified randomness on the racetrack processor. This work investigates the execution efficiency of this architecture for general-purpose programs. We first explore the impact of increasing zones on runtime efficiency. Counterintuitively, our evaluations using variational programs reveal that expanding zones may degrade runtime performance under the existing scheduling policy. This degradation may be attributed to the increase in track length, which increases ion circulation overhead, offsetting the benefits of enhanced parallelism. To mitigate this, the proposed \\textit{Plutarch} exploits 3 strategies: (i) unitary decomposition and translation to maximize zone utilization, (ii) prioritizing the execution of nearby gates over ion circulation, and (iii) implementing shortcuts to provide the alternative path.",
    "arxiv_id": "2601.08930",
    "authors": [
      "Enhyeok Jang",
      "Hyungseok Kim",
      "Yongju Lee",
      "Jaewon Kwon",
      "Yipeng Huang",
      "Won Woo Ro"
    ],
    "categories": [
      "quant-ph"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Plutarch: Toward Scalable Operational Parallelism on Racetrack-Shaped Trapped-Ion Processors",
    "url": "https://arxiv.org/abs/2601.08930",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "89ab0469-34ad-4d34-a427-2d611453a81f",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}