[论文解读] Plutarch: Toward Scalable Operational Parallelism on Racetrack-Shaped Trapped-Ion Processors

Enhyeok Jang, H J Kim+4 more|arXiv (Cornell University)|Jan 13, 2026

Quantum Computing Algorithms and Architecture被引用 0

一句话总结

paper 分析在受困离子处理器中增加赛车道区域对运行时的影响，并提出 Plutarch，一组通过优化单位分解、近邻门 prioritized、以及替代路径快捷方式来保持效率的策略。

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 extit{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.

研究动机与目标

• Motivate and evaluate the efficiency of racetrack-shaped trapped-ion processors for general-purpose programs.
• Investigate how increasing the number of zones affects runtime under current scheduling policies.
• Develop a remediation strategy to maintain or improve performance as the track length grows.

提出的方法

• Analyze runtime impact of increasing zones using variational programs.
• Propose Plutarch with three strategies: unitary decomposition and translation to maximize zone utilization; prioritizing execution of nearby gates over ion circulation; implementing shortcuts for alternative paths.
• Evaluate the proposed strategies in the context of racetrack-shaped trapped-ion architectures.

实验结果

研究问题

• RQ1 Does expanding the number of zones improve or degrade runtime performance under existing scheduling policies?
• RQ2 Can the proposed Plutarch techniques mitigate ion circulation overhead and preserve parallelism as track length increases?
• RQ3 How do unitary decomposition, gate locality prioritization, and shortcuts interact to improve overall execution efficiency on racetrack-shaped traps?

主要发现

• Expanding zones can degrade runtime performance under the current scheduling policy due to longer ion circulation overhead.
• Plutarch's strategies aim to maximize zone utilization, prioritize nearby gates, and provide alternative paths to mitigate circulation overhead.
• The combined approach is proposed to counteract efficiency losses when track length increases, enabling scalable operational parallelism.