Scholarlink

<p>Blind quantum computing (BQC) allows classical clients to delegate quantum computing tasks to cloud servers while maintaining privacy throughout the computation. Although the circuit-based BQC protocol proposed by Childs laid the foundation for the field, the implementation of quantum algorithm encryption has remained a significant challenge. Here, we propose a novel BQC protocol that combines quantum teleportation with one-time-pad cryptography, effectively addressing the challenges of implementing universal BQC within the circuit model. In our protocol, the client only needs the capability to prepare single-qubit states and apply <i>X</i> and <i>Z</i> gates, while the server creates all required quantum states, performs the quantum computations and the Bell measurement. In contrast to measurement-based BQC protocols, the proposed scheme significantly reduces server-side hardware complexity and overall resource consumption by avoiding the need to prepare large-scale graph states, thereby simplifying the state preparation requirements for the server. This work introduces a novel approach for efficient BQC and contributes to the advancement of privacy protection techniques in quantum computing.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Universal blind quantum computing assisted by quantum teleportation

  • 期刊论文

  • 发表日期：

    2025年6月16日

查看全文
  • Xiaoqian Zhang

摘要

Blind quantum computing (BQC) allows classical clients to delegate quantum computing tasks to cloud servers while maintaining privacy throughout the computation. Although the circuit-based BQC protocol proposed by Childs laid the foundation for the field, the implementation of quantum algorithm encryption has remained a significant challenge. Here, we propose a novel BQC protocol that combines quantum teleportation with one-time-pad cryptography, effectively addressing the challenges of implementing universal BQC within the circuit model. In our protocol, the client only needs the capability to prepare single-qubit states and apply X and Z gates, while the server creates all required quantum states, performs the quantum computations and the Bell measurement. In contrast to measurement-based BQC protocols, the proposed scheme significantly reduces server-side hardware complexity and overall resource consumption by avoiding the need to prepare large-scale graph states, thereby simplifying the state preparation requirements for the server. This work introduces a novel approach for efficient BQC and contributes to the advancement of privacy protection techniques in quantum computing.