www.icact.org

Member Login

Call for Paper

Committee

Paper Submission

CRF Submission

Find My Paper

Author Homepage

Statistics & History

Welcome Message

TACT Journal Homepage

Paper Procedure

FAQ

Registration & Invoice

Paper Archives

Outstanding Papers

Program & Proceedings

Presentation Platform

Hotel & Travel Info

Photo Gallery

Scheduler Login

Seminar

Archives Login

Sponsors

Virual Oral Question and Answer


IEEE/ICACT20260022 Question.11 Questioner: zhaozx@dsp.ac.cn 2026-02-11 오전 11:33:06	IEEE/ICACT20260022 Answer.11 Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-11 오전 11:33:06
Have any related works attempted to address MBQC scalability via distributed resource state generation? If so, what limitations (e.g., high latency, limited graph size, poor fidelity) do these works exhibit that MCBGD seeks to overcome?	Thanks for your question.MBQC resources are regarded as graph states. The related work mentioned in this paper includes recent research on graph state distribution. A common characteristic of these studies is that they often start from a single node to construct a star-like distribution path. This approach is not well-suited for the lattice-like graph states required by MBQC, potentially causing some nodes in the network to encounter bottlenecks earlier or leading to a rapid decline in the overall graph state fidelity due to the influence of nodes with low fidelity. In contrast, MCBGD divides the lattice graph state into horizontal and vertical linear graph states. The construction process of the overall graph state is parallelizable, effectively avoiding local bottleneck issues. Meanwhile, the heuristic algorithm employed is also optimized for the global overall fidelity.

Select Voice