Universal Blind Quantum Computation with Recursive Rotation Gates

TL;DR

This paper introduces a universal blind quantum computation protocol that uses recursive decryption of parametric rotation gates, avoiding highly entangled states and reducing communication rounds, thus enhancing practicality for NISQ-era hybrid quantum-classical systems.

Contribution

The proposed protocol enables universal blind quantum computation with recursive rotation gates, eliminating the need for highly entangled resource states and improving efficiency for variational algorithms.

Findings

Reduces communication rounds in blind quantum protocols

Eliminates reliance on highly entangled resource states

Supports practical implementation in NISQ-era systems

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 non-parametric resource sets (in circuit-based models). These restrictions hinder the practical applicability of such an algorithm 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.