Xu Qingshan, Tan Xiaoqing, Huang Rui
College of Information Science and Technology, Jinan University, Guangzhou 510632, China.
Entropy (Basel). 2020 Sep 7;22(9):996. doi: 10.3390/e22090996.
Recent advances in theoretical and experimental quantum computing raise the problem of verifying the outcome of these quantum computations. The recent verification protocols using blind quantum computing are fruitful for addressing this problem. Unfortunately, all known schemes have relatively high overhead. Here we present a novel construction for the resource state of verifiable blind quantum computation. This approach achieves a better verifiability of 0.866 in the case of classical output. In addition, the number of required qubits is 2N+4cN, where and are the number of vertices and the maximal degree in the original computation graph, respectively. In other words, our overhead is less linear in the size of the computational scale. Finally, we utilize the method of repetition and fault-tolerant code to optimise the verifiability.
理论和实验量子计算的最新进展引发了验证这些量子计算结果的问题。最近使用盲量子计算的验证协议在解决这个问题方面卓有成效。不幸的是，所有已知方案都有相对较高的开销。在此，我们提出了一种用于可验证盲量子计算资源状态的新颖构造。在经典输出的情况下，这种方法实现了0.866的更好可验证性。此外，所需量子比特数为2N + 4cN，其中N和c分别是原始计算图中的顶点数和最大度数。换句话说，我们的开销在计算规模大小方面的线性程度较低。最后，我们利用重复和容错编码方法来优化可验证性。
