Abstract
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 , where N and c 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.
Highlights
Scalable quantum computing still has a long way to go, while quantum computing in cloud mode is relatively reasonable
We briefly present the relevant concepts used in describing verifiable universal blind quantum computation (VUBQC) protocols
While we achieve the verification of blind quantum computing with the sandglass-like resource state, our protocol’s verifiability is too high to be applied in practice
Summary
Scalable quantum computing still has a long way to go, while quantum computing in cloud mode is relatively reasonable. In [17], dotted-complete graph was used for resource construction in verification protocol. It can achieve verifiability e = (5/6)d2d/5e , where d is the distance of error correcting code used in the protocol. In [25], a optimised resource construction using dotted-triple graph was proposed, where the number of traps can be a constant fraction of the total number of qubits. It can obtain verifiability e = (8/9)dd/18e.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have