ICACT20260022 Question.1
Questioner: md02anas02@gmail.com 2026-02-09 오후 1:09:11 |
ICACT20260022 Answer.1
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 1:09:11
Chrome  Click!! |
| Does MCBGD work only for grid networks, or can it be applied to other network topologies as well? |
Thanks for your question.MCBGD can be applied to networks with arbitrary topologies; however, since the cluster states required for MBQC inherently possess a lattice-like topology, MCBGD demonstrates optimal performance on lattice networks. |
ICACT20260022 Question.10
Questioner: 965925058@qq.com 2026-02-09 오후 2:14:48 |
ICACT20260022 Answer.10
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:14:48
Chrome Click!! |
| What are the main technical obstacles in extending MCBGD to heterogeneous quantum networks? |
Key obstacles include handling resource disparities in heterogeneous nodes, managing cross-domain entanglement, and integrating diverse noise models; the document highlights these as future challenges to enhance generality. |
ICACT20260022 Question.11
Questioner: zhaozx@dsp.ac.cn 2026-02-11 오전 11:33:06 |
ICACT20260022 Answer.11
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-11 오전 11:33:06
Chrome Click!! |
| 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. |
ICACT20260022 Question.2
Questioner: md02anas02@gmail.com 2026-02-09 오후 1:14:41 |
ICACT20260022 Answer.2
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 1:14:41
Chrome Click!! |
| How sensitive is MCBGD to variations in initial channel fidelity or qubit resource availability? |
Thanks for your question.The existence of entanglement purification technology creates an interdependent and mutually constraining relationship between the initial fidelity and the quantum resources. When the initial fidelity is too low, sufficient quantum resources are required to ensure that entanglement is purified to the target fidelity. If quantum resources are insufficient, the impact on fidelity will be exponential. Conversely, to ensure that fidelity can always be purified to the target, the variation in quantum resources required at each node becomes exponential. |
ICACT20260022 Question.3
Questioner: 965925058@qq.com 2026-02-09 오후 1:51:28 |
ICACT20260022 Answer.3
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 1:51:28
Chrome Click!! |
| How does the genetic multi-path routing algorithm in MCBGD balance path overlap penalties and resource constraints to optimize horizontal cluster deployment? |
The algorithm uses a genetic approach to optimize the fitness function (Eq. 7), incorporating qubit availability, link fidelity, and time delay coefficients, with a path overlap penalty term Φ(P) (Eq. 9) to minimize resource conflicts, achieving near-optimal paths under the constraints of Eq. 4 and 6. |
ICACT20260022 Question.4
Questioner: 965925058@qq.com 2026-02-09 오후 2:09:24 |
ICACT20260022 Answer.4
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:09:24
Chrome Click!! |
| How does the vertical cluster state segmentation scheme minimize hop count consumption of entanglement paths via genetic algorithm? |
The scheme encodes segmentation as chromosomes and employs a genetic algorithm to maximize the fitness function Fit_v(S) (Eq. 15), which considers vertical path fidelity and time delay, using Dijkstras algorithm to find shortest paths, thereby reducing hop count resource consumption in entanglement swaps. |
ICACT20260022 Question.5
Questioner: 965925058@qq.com 2026-02-09 오후 2:11:21 |
ICACT20260022 Answer.5
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:11:21
Chrome Click!! |
| Does the uniform distribution initialization in NetSquid simulations adequately reflect the resource heterogeneity of real quantum networks? |
The initialization uses uniform distributions (e.g., qubits per node ~ U(10,50)), which simplifies experiments but may not fully reflect real-world heterogeneity; future work should extend to non-uniform models for broader validation. |
ICACT20260022 Question.6
Questioner: 965925058@qq.com 2026-02-09 오후 2:11:57 |
ICACT20260022 Answer.6
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:11:57
Chrome Click!! |
| To what extent does MCBGDs fidelity advantage over EDCG and DODAG-X depend on specific noise model assumptions? |
Thanks for your question.MCBGDs advantage stems from explicit resource constraint modeling and local entanglement optimization, reducing long-range entanglement needs; however, reliance on NetSquids discrete-event noise model means advantages might diminish under more severe decoherence models. |
ICACT20260022 Question.7
Questioner: 965925058@qq.com 2026-02-09 오후 2:12:53 |
ICACT20260022 Answer.7
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:12:53
Chrome Click!! |
| Does the grid network topology in experiments limit the scalability conclusions of MCBGD for complex network structures? |
Thanks for your question.Experiments on 20×20 grid networks validate basic scalability, but the document notes future need for heterogeneous topologies, so current conclusions may not directly apply to more complex structures. |
ICACT20260022 Question.8
Questioner: 965925058@qq.com 2026-02-09 오후 2:13:42 |
ICACT20260022 Answer.8
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:13:42
Chrome Click!! |
| Is the horizontal-vertical decomposition strategy of MCBGD applicable to all measurement-based quantum computation algorithms, such as quantum chemistry simulations? |
Thanks for your question.The strategy builds on general MBQC translation processes, validated with QFT and QAOA; it is theoretically applicable to other algorithms like quantum chemistry simulations, but requires adaptation to specific circuit structures. |
ICACT20260022 Question.9
Questioner: 965925058@qq.com 2026-02-09 오후 2:14:38 |
ICACT20260022 Answer.9
Answer by Auhor ygt991129@mail.ustc.edu.cn 2026-02-09 오후 2:14:38
Chrome Click!! |
| How would a dynamic workload adaptive algorithm real-time adjust cluster state segmentation in response to resource fluctuations? |
The document does not detail dynamic algorithms but suggests future adaptive segmentation, potentially via real-time resource monitoring and re-running genetic algorithms to optimize the segmentation scheme S. |
