Quantum computing on encrypted data with arbitrary rotation gates

• URL: http://arxiv.org/abs/2508.18811v2
• Date: Wed, 24 Sep 2025 14:42:25 GMT
• Title: Quantum computing on encrypted data with arbitrary rotation gates
• Authors: Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan,
• Abstract summary: We propose a universal scheme of half-blind quantum computation for computing on encrypted data using arbitrary rotation gates.<n>This work is an affirmative step towards the practical application of such techniques in secure NISQ-era computing.
• Score: 1.1333522464162373
• License: http://creativecommons.org/licenses/by-sa/4.0/
• 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 $H,S,T,CX, CZ$ or $CCX$ gates. In this study, we show that recursive decryption of the parametric gate, $R_z(\theta)$, is possible exactly when $\theta=\pm\pi/2^m$ for $m\in \mathbb{Z^{+}}$, and approximately with arbitrary precision $\epsilon$ for given $\theta$. We also show that a blind algorithm based on such a technique needs at most $O(\log_2^2(\pi/\epsilon))$ computation steps and communication rounds, while the techniques based on a non-parametric resource set require $O(\ln^{3.97}(1/\epsilon))$ rounds. We use these results to propose a universal scheme of half-blind quantum computation for computing on encrypted data using arbitrary rotation gates. This substantial reduction in the depth of blind circuit is an affirmative step towards the practical application of such techniques in secure NISQ-era computing.

Related papers

• Analytical construction of $(n, n-1)$ quantum random access codes saturating the conjectured bound [0.0]
  Quantum Random Access Codes (QRACs) embody the fundamental trade-off between the compressibility of information into limited quantum resources.<n>We establish an analytical construction method for $(n, n-1)$-QRACs by using an explicit operator formalism.<n>We present a systematic algorithm to decompose the derived optimal POVM into standard quantum gates.
  arXiv  Detail & Related papers  (2026-01-27T04:43:43Z)
• An end-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage [0.4618037115403289]
  We develop a novel algorithm for the incompressible lattice Boltzmann equation.<n>We find that for an end-to-end problem, a modest quantum advantage may be preserved for selected observables.<n>Our results give robust evidence that small, but nontrivial, quantum advantages can be achieved in the context of CFD.
  arXiv  Detail & Related papers  (2025-12-03T13:03:08Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Quantum and classical algorithms for SOCP based on the multiplicative weights update method [44.99833362998488]
  We give classical and quantum algorithms for approximately solving second-order cone programs (SOCPs)<n>Our approach follows the MW framework previously applied to semidefinite programs (SDPs)<n>We show that the additional structure of SOCPs can be exploited to give better runtime with SOCP-specific algorithms.
  arXiv  Detail & Related papers  (2025-07-18T17:55:58Z)
• Quantum Algorithm for the Fixed-Radius Neighbor Search [39.58317527488534]
  We propose a quantum algorithm for the Fixed RAdius Neighbor Search problem (FRANS) based on the fixed-point version of Grover's algorithm.<n>We derive an efficient circuit for solving the FRANS with linear query complexity with the number of particles $N$.<n>We assess the resilience of the model to the readout error, suggesting an error correction-free strategy to check the accuracy of the results.
  arXiv  Detail & Related papers  (2025-07-04T10:01:10Z)
• Distributed quantum algorithm for divergence estimation and beyond [12.925989807145301]
  We propose a distributed quantum algorithm framework to compute $rm Tr(f(A)g(B))$ within an additive error $varepsilon$.<n>This framework holds broad applicability across a range of distributed quantum computing tasks.
  arXiv  Detail & Related papers  (2025-03-12T14:28:22Z)
• Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC [34.32444379837011]
  We study a linear computation problem over a quantum multiple access channel (LC-QMAC)<n>We propose an achievable scheme for LC-QMAC based on the stabilizer formalism and the ideas from entanglement-assisted quantum error-correcting codes (EAQECC)
  arXiv  Detail & Related papers  (2025-01-27T18:35:33Z)
• Resource-efficient algorithm for estimating the trace of quantum state powers [1.5133368155322298]
  Estimating the trace of quantum state powers, $textTr(rhok)$, for $k$ identical quantum states is a fundamental task.<n>We introduce an algorithm that requires only $mathcalO(widetilder)$ qubits and $mathcalO(widetilder)$ multi-qubit gates.<n>We extend our algorithm to the estimation of $textTr(Mrhok)$ for arbitrary observables and $textTr(rho
  arXiv  Detail & Related papers  (2024-08-01T06:23:52Z)
• Do you know what q-means? [42.96240569413475]
  We present a classical $varepsilon$-$k$-means algorithm that performs an approximate version of one iteration of Lloyd's algorithm with time complexity.<n>We also propose an improved $q$-means quantum algorithm with time complexity.
  arXiv  Detail & Related papers  (2023-08-18T17:52:12Z)
• Homomorphic Encryption of the k=2 Bernstein-Vazirani Algorithm [0.4511923587827301]
  We find an application of this scheme to quantum homomorphic encryption (QHE) which is an important cryptographic technology useful for delegated quantum computation. We develop QHE schemes with perfect security, $mathcalF$-homomorphism, no interaction between server and client, and quasi-compactness bounded by $O(M)$ where M is the number of gates $T$ in the circuit.
  arXiv  Detail & Related papers  (2023-03-30T14:49:15Z)
• Unitarity estimation for quantum channels [7.323367190336826]
  Unitarity estimation is a basic and important problem in quantum device certification and benchmarking. We provide a unified framework for unitarity estimation, which induces ancilla-efficient algorithms. We show that both the $d$-dependence and $epsilon$-dependence of our algorithms are optimal.
  arXiv  Detail & Related papers  (2022-12-19T09:36:33Z)
• Communication-Efficient Adam-Type Algorithms for Distributed Data Mining [93.50424502011626]
  We propose a class of novel distributed Adam-type algorithms (emphi.e., SketchedAMSGrad) utilizing sketching. Our new algorithm achieves a fast convergence rate of $O(frac1sqrtnT + frac1(k/d)2 T)$ with the communication cost of $O(k log(d))$ at each iteration.
  arXiv  Detail & Related papers  (2022-10-14T01:42:05Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)
• Succinct Blind Quantum Computation Using a Random Oracle [0.8702432681310399]
  We give a new universal blind quantum computation protocol. The protocol's first phase is succinct, that is, its complexity is independent of circuit size.
  arXiv  Detail & Related papers  (2020-04-27T07:47:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.