English

State Similarity in Modular Superconducting Quantum Processors with Classical Communications

Quantum Physics 2025-06-12 v3

Abstract

As quantum devices continue to scale, distributed quantum computing emerges as a promising strategy for executing large-scale tasks across modular quantum processors. A central challenge in this paradigm is verifying the correctness of computational outcomes when subcircuits are executed independently following circuit cutting. Here we propose a cross-platform fidelity estimation algorithm tailored for modular architectures. Our method achieves substantial reductions in sample complexity compared to previous approaches designed for single-processor systems. We experimentally implement the protocol on modular superconducting quantum processors with up to 6 qubits to verify the similarity of two 11-qubit GHZ states. Beyond verification, we show that our algorithm enables a federated quantum kernel method that preserves data privacy. As a proof of concept, we apply it to a 5-qubit quantum phase learning task using six 3-qubit modules, successfully extracting phase information with just eight training samples. These results establish a practical path for scalable verification and trustworthy quantum machine learning of modular quantum processors.

Keywords

Cite

@article{arxiv.2506.01657,
  title  = {State Similarity in Modular Superconducting Quantum Processors with Classical Communications},
  author = {Bujiao Wu and Changrong Xie and Peng Mi and Zhiyi Wu and Zechen Guo and Peisheng Huang and Wenhui Huang and Xuandong Sun and Jiawei Zhang and Libo Zhang and Jiawei Qiu and Xiayu Linpeng and Ziyu Tao and Ji Chu and Ji Jiang and Song Liu and Jingjing Niu and Yuxuan Zhou and Yuxuan Du and Wenhui Ren and Youpeng Zhong and Tongliang Liu and Dapeng Yu},
  journal= {arXiv preprint arXiv:2506.01657},
  year   = {2025}
}

Comments

10 pages, 3 figures, 27-page appendix, reference citation typos corrected

R2 v1 2026-07-01T02:54:25.486Z