Timing constraints due to real-time graph traversal algorithms on incomplete cluster states in photonic measurement-based quantum computing

Abstract

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.

18 pages, 14 figures. Comments welcome !!!

References in corpus (8)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• From three-photon GHZ states to ballistic universal quantum computation
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Phase transition of computational power in the resource states for one-way quantum computation
• Physical-depth architectural requirements for generating universal photonic cluster states
• Timing constraints imposed by classical digital control systems on photonic implementations of measurement-based quantum computing