A Remote Quantum Error-Correcting Code Preparation Protocol on Cluster States-Reference-Cited by-同舟云学术

A Remote Quantum Error-Correcting Code Preparation Protocol on Cluster States

Published:2023-07-08 Issue:14 Volume:11 Page:3035
ISSN:2227-7390
Container-title:Mathematics
language:en
Short-container-title:Mathematics

Author:

Zhao Qiang¹²,Mao Haokun¹^ORCID,Qiao Yucheng³^ORCID,El-Latif Ahmed A. Abd¹⁴⁵,Li Qiong¹^ORCID

Affiliation:

1. Information Countermeasure Technique Institute, School of Cyberspace Science, Faculty of Computing, Harbin Institute of Technology, Harbin 150001, China

2. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong 999077, China

3. School of Information Engineering, Guilin University of Electronic Science and Technology, Guilin 541004, China

4. EIAS Data Science Laboratory, College of Computer and Information Sciences, Prince Sultan University, Riyadh 11586, Saudi Arabia

5. Department of Mathematics and Computer Science, Faculty of Science, Menoufia University, Shibin Al Kawm 32511, Egypt

Abstract

The blind quantum computation (BQC) protocol allows for privacy-preserving remote quantum computations. In this paper, we introduce a remote quantum error correction code preparation protocol for BQC using a cluster state and analyze its blindness in the measurement-based quantum computation model. Our protocol requires fewer quantum resources than previous methods, as it only needs weak coherent pulses, eliminating the need for quantum memory and limited quantum computing. The results of our theoretical analysis and simulations show that our protocol requires fewer quantum resources compared to non-coding methods with the same qubit error rate.

Funder

National Natural Science Foundation of China

Talented Young Scientist Program

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2227-7390/11/14/3035/pdf

Reference26 articles.

1. Grover, L.K. (1996, January 22–24). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelpgia, PA, USA.

2. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer;Shor;SIAM Rev.,1999

3. Tanaka, S., Tamura, R., and Chakrabarti, B.K. (2017). Quantum Spin Glasses, Annealing and Computation, Cambridge University Press.

4. Adiabatic quantum computation;Albash;Rev. Mod. Phys.,2018

5. Alsubai, S., Alqahtani, A., Binbusayyis, A., Sha, M., Gumaei, A., and Wang, S. (2023). Quantum Computing Meets Deep Learning: A Promising Approach for Diabetic Retinopathy Classification. Mathematics, 11.