Blind quantum computation (BQC) provides a secure framework for clients to delegate quantum computations to servers without revealing their private information. Among BQC protocols, those built on iterated gate teleportation (IGTBQC) have demonstrated promising potential in overcoming the constraints imposed by the no-programming theorem and significantly reducing communication overhead. However, existing IGTBQC protocols lack mechanisms for clients to verify the correctness of computation results and deal with only one type of clients capable of preparing qubits. To address these limitations, we first extend the current IGTBQC protocol to be a verifiable one and then propose another verifiable IGTBQC protocol tailored for a different type of clients with the capability of measuring single-qubit states. Furthermore, both protocols are shown to satisfy blindness and verification simultaneously in a relatively formal way. Our results not only broaden the applicability to a wider range of clients but also enhance the practicality of delegated quantum computation.

Close

PrevNext

View figure in article

• Quantum algorithms & computation
• Quantum communication, protocols & technology