• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Quantum Engineering >A simplified verifiable blind quantum computing protocol with quantum input verification
【24h】

A simplified verifiable blind quantum computing protocol with quantum input verification

机译：一个简化的可核查的盲目的量子计算协议与量子输入验证

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Blind quantum computing (BQC) enables a client with limited quantum capability to delegate her quantum computation to a remote quantum server and still keeps the client's input, output, and the algorithm private. One important property of BQC is verifiability, which means the client can verify the correctness of the computation or unknown quantum inputs. Recently, Morimae proposed a verifiable blind quantum computing protocol where the client can verify both the correctness of computing and the quantum input. However, the client needs much quantum memory and takes a lot of qubits to get the true result. We reduce the size of quantum memory and the number of qubits used in Morimae's protocol. Besides, we extend the resource state in Morimae's protocol from graph state to hypergraph state. For certain hypergraph states as resources states, such as Union Jack State, the client only needs Pauli measurements in the computation stage but he needs non-Clifford basis measurements if graph states are considered as resources states.
机译：盲目的量子计算(BQC)允许客户端量子有限的能力代表她量子计算远程量子服务器还让客户的输入、输出和私人的算法。BQC可验证性,这意味着客户机可以验证计算的正确性未知量子输入。提出了一个可核查的盲目的量子计算协议客户端可以验证的计算和量子输入的正确性。然而,量子存储器和客户需求需要大量的量子比特得到真实的结果。减少量子存储器的大小和数量用于Morimae量子位的协议。延长Morimae资源状态的协议从图状态超图状态。超图状态作为资源,如英国国旗的状态,客户端只需要泡利不相容但他测量的计算阶段如果需要non-Clifford基础测量图视为资源状态。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号