Quantum computing on encrypted data with arbitrary rotation gates
Mohit Joshi, Manoj Kumar Mishra, and S. Karthikeyan

TL;DR
This paper introduces a universal scheme for quantum computing on encrypted data using arbitrary rotation gates, significantly reducing circuit depth and advancing practical secure quantum computation in the NISQ era.
Contribution
It demonstrates recursive decryption of parametric rotation gates for arbitrary angles and proposes a universal half-blind quantum computation scheme with improved efficiency.
Findings
Recursive decryption of $R_z( heta)$ is exact for $ heta= extstylerac{ ext{ extpm}\pi}{2^m}$.
Approximate decryption is possible for arbitrary $ heta$ with precision $ extepsilon$.
The new scheme reduces the depth of blind circuits, enabling more practical secure quantum computing.
Abstract
An efficient technique of computing on encrypted data allows a client with limited capability to perform complex operations on a remote fault-tolerant server without leaking anything about the input or output. Quantum computing provides information-theoretic security to solve such a problem, and many such techniques have been proposed under the premises of half-blind quantum computation. However, they are dependent on a fixed non-parametric resource set that comprises some universal combination of or gates. In this study, we show that recursive decryption of the parametric gate, , is possible exactly when for , and approximately with arbitrary precision for given . We also show that a blind algorithm based on such a technique needs at most computation steps and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
