Timing Constraints Due to Real-Time Graph-Traversal Algorithms on Incomplete Cluster States in Photonic Measurement-Based Quantum Computing

John R Scott; Krishna Coimbatore Balram

doi:10.1103/PhysRevApplied.20.024019

Timing Constraints Due to Real-Time Graph-Traversal Algorithms on Incomplete Cluster States in Photonic Measurement-Based Quantum Computing

Research output: Contribution to journal › Article (Academic Journal) › peer-review

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 subsection of the cluster state, we analyze the trade-off 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

Original language	English
Article number	024019
Number of pages	19
Journal	Physical Review Applied
Volume	20
Issue number	2
DOIs	https://doi.org/10.1103/PhysRevApplied.20.024019
Publication status	Published - 8 Aug 2023

Bibliographical note

Funding Information:
The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843).

Funding Information:
ACKNOWLEDGMENTS The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843).

Publisher Copyright:
© 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the "https://creativecommons.org/licenses/by/4.0/"Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Research Groups and Themes

Photonics and Quantum

Access to Document

10.1103/PhysRevApplied.20.024019Licence: CC BY

Handle.net

Persistent link

Classical Control Systems for Photonic Quantum Computing
Scott, J. R. (Author), Coimbatore Balram, K. (Supervisor), 27 Sept 2022
Student thesis: Doctoral Thesis › Doctor of Philosophy (PhD)

File

Cite this

@article{6d6bf86ec013433e8aeeaa97a23dd852,

title = "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 subsection of the cluster state, we analyze the trade-off 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",

author = "Scott, {John R} and {Coimbatore Balram}, Krishna",

note = "Funding Information: The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843). Funding Information: ACKNOWLEDGMENTS The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843). Publisher Copyright: {\textcopyright} 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the {"}https://creativecommons.org/licenses/by/4.0/{"}Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.",

year = "2023",

month = aug,

day = "8",

doi = "10.1103/PhysRevApplied.20.024019",

language = "English",

volume = "20",

journal = "Physical Review Applied",

issn = "2331-7019",

publisher = "American Physical Society (APS)",

number = "2",

}

TY - JOUR

T1 - Timing Constraints Due to Real-Time Graph-Traversal Algorithms on Incomplete Cluster States in Photonic Measurement-Based Quantum Computing

AU - Scott, John R

AU - Coimbatore Balram, Krishna

N1 - Funding Information: The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843). Funding Information: ACKNOWLEDGMENTS The authors would like to thank Lana Mineh, Naomi Solomons, and Oliver Thomas for reading through the manuscript and providing valuable suggestions. J.R.S. received funding from the Bristol Quantum Engineering Center for Doctoral Training, EPSRC Grant No. EP/L015730/1. K.C.B. would like to thank the European Research Council for funding support (ERC-StG SBS3-5, 758843). Publisher Copyright: © 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the "https://creativecommons.org/licenses/by/4.0/"Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

PY - 2023/8/8

Y1 - 2023/8/8

N2 - 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 subsection of the cluster state, we analyze the trade-off 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

AB - 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 subsection of the cluster state, we analyze the trade-off 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

U2 - 10.1103/PhysRevApplied.20.024019

DO - 10.1103/PhysRevApplied.20.024019

M3 - Article (Academic Journal)

SN - 2331-7019

VL - 20

JO - Physical Review Applied

JF - Physical Review Applied

IS - 2

M1 - 024019

ER -

Timing Constraints Due to Real-Time Graph-Traversal Algorithms on Incomplete Cluster States in Photonic Measurement-Based Quantum Computing

Abstract

Bibliographical note

Research Groups and Themes

Access to Document

Handle.net

Fingerprint

Student theses

Classical Control Systems for Photonic Quantum Computing

Cite this