论文标题
在基于光子测量的量子计算中，由于实时图遍历状态上的实时图形遍历算法而引起的时间限制
Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing
论文作者
论文摘要
随着这些量子机的规模和复杂性的增长，了解量子计算平台上经典控制系统对量子计算平台施加的计算开销变得至关重要。在这项工作中，我们通过实现通过不完整的群集状态来实现实现一量点门所需的实时图形遍历算法来计算施加的开销；实现基于光子测量的量子计算的现实实现的必要要求。通过实施两种不同的算法，即搜索整个群集状态的全球广度优先搜索和一个越过群集状态的狭窄子段的增量版本，我们分析了找到可行途径的准确性与能够执行此操作的速度的准确性之间的权衡，从而限制了系统的整体光电时钟周期。我们还概述了结果对基于测量的光子量子计算实施经典控制系统的更广泛含义。
Understanding the computational overheads imposed by classical control systems on quantum computing platforms becomes critically important as these quantum machines grow in scale and complexity. In this work, we calculate the overheads imposed by the implementation of real-time graph traversal algorithms needed to find computational paths through incomplete cluster states for the implementation of one-qubit gates; a necessary requirement for a realistic implementation of photonic measurement-based quantum computing. By implementing two different algorithms, a global breadth-first search that searches the entire cluster state and an incremental version that traverses a narrow sub-section of the cluster state, we analyze the tradeoff between the accuracy of finding viable paths and the speed at which this operation can be performed, which constrains the overall photonic clock cycle of the system. We also outline the broader implications of our results for implementing classical control systems for measurement-based photonic quantum computing.
