Universal Blind Quantum Computation with Recursive Rotation Gates

• URL: http://arxiv.org/abs/2512.15101v1
• Date: Wed, 17 Dec 2025 05:43:36 GMT
• Title: Universal Blind Quantum Computation with Recursive Rotation Gates
• Abstract summary: Blind Quantum Computation lets a limited-capability client delegate its complex computation to a remote server without revealing its data or computation.<n>We present a protocol for universal blind quantum computation based on recursion of parametric rotation gates.
• Score: 1.1333522464162373
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations [1.1333522464162373]
  Blind quantum computation is a cryptographic primitive that allows a limited-capability client to delegate its computation to a remote server without revealing its data and/or computation.<n>We describe the development of the first such library for transpiling circuits written in Qiskit to its blind counterpart.
  arXiv  Detail & Related papers  (2026-07-19T08:37:25Z)
• Communication-Efficient Distributed Inverse Quantum Fourier Transform [1.376615688087685]
  We propose a distributed formulation of the iQFT over a quantum network composed of $P$ nodes, each hosting $Q$ qubits.<n>By reducing the number of inter-node quantum interactions, the proposed approach significantly lowers the quantum communication requirements of the distributed iQFT.
  arXiv  Detail & Related papers  (2026-05-11T15:22:03Z)
• Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers [0.0]
  It is crucial to develop methods and software that minimize the number of inter-QPU communications.<n>Here we describe key features of the quantum compiler araQne, which is designed to minimize distribution cost.<n>We establish the crucial role played by circuit reordering strategies, which strongly reduce the distribution cost compared to a baseline approach.
  arXiv  Detail & Related papers  (2025-07-01T18:00:02Z)
• Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians [4.852613028421959]
  We present efficient quantum algorithms for inverting unitaries with specific Hamiltonian structures.<n>We identify cases where unitaries encoding exponentially many parameters can be inverted using only a single query.
  arXiv  Detail & Related papers  (2025-06-25T16:06:55Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• A fault-tolerant variational quantum algorithm with limited T-depth [2.7648976108201815]
  We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set. VQE is suitable for implementation on a future error-corrected quantum computer.
  arXiv  Detail & Related papers  (2023-03-08T10:31:12Z)
• Applications and resource reductions in measurement-based variational quantum eigensolvers [0.0]
  We present three different problems which are solved by employing a measurement-based implementation of the variational quantum eigensolver algorithm (MBVQE) We show that by utilising native measurement-based gates rather than standard gates, such as the standard CNOT, MBQCs may be obtained that are both shallow and have simple connectivity while simultaneously exhibiting a large expressibility.
  arXiv  Detail & Related papers  (2023-02-01T22:58:12Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

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.