Universal blind quantum computation with recursive rotation gates

Abstract

Blind quantum computation lets a limited-capability client delegate its complex computation to a remote server without revealing its data or computation. Several such protocols have been proposed under varied quantum computing models. However, these protocols either rely on highly entangled resource states (in measurement-based models) or are based on nonparametric resource sets (in circuit-based models). These restrictions hinder the practical applicability of such algorithms in the NISQ era, especially concerning the hybrid quantum-classical infrastructure, which depends on parametric gates. We present a protocol for universal blind quantum computation based on recursive decryption of parametric rotation gates, which does not require a highly entangled state at the server side and substantially reduces the communication rounds required for practical prototyping of secure variational algorithms.