Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations
- URL: http://arxiv.org/abs/2607.17131v1
- Date: Sun, 19 Jul 2026 08:37:25 GMT
- Title: Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations
- Abstract summary: 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.
- Score: 1.1333522464162373
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Blind quantum computation is a cryptographic primitive that allows a limited-capability client to delegate its complex computation to a remote server without revealing its data and/or computation. This branch of quantum cryptography has been bifurcated into two distinct primitives, quantum homomorphic encryption (concerning the security of only data) and universal blind quantum computation (concerning the security of data and the computing algorithm). These primitives have immense applicability in problems like secure cloud computing, secure quantum variational algorithms, quantum federated learning, and secure multiparty computation. However, no software tools exist for the rapid prototyping of such protocols, hindering the academic interrogation for potential applications. In this paper, we describe the development of the first such library for transpiling circuits written in Qiskit to its blind counterpart, which can then be delegated in a client-server architecture without revealing the client's data and/or computation. The proposed library is designed in modular and reusable component layers, enabling easier scalability to newer BQC primitives and robustness against changes in underlying primitives. We show the implementation of these primitives to a blind variational quantum classifier for the IRIS dataset.
Related papers
- Partially-Blind Single-Qubit Classification over a Prototype Hybrid Quantum Network [33.72751145910978]
Single-qubit classifiers (SQCs) are small-scale hybrid quantum-classical machines capable of performing a basic machine learning task: classifying data.<n>Blind quantum computation (BQC) enables a client may run delegated quantum computations on an untrusted server with information-theoretic security.<n>We propose a prototype experiment for a SQC where it is known to the server that a classification is being performed, but the data and outcome stay hidden.<n>This can be integrated into a quantum network to deliver quantum-secured classifications to remote clients.
arXiv Detail & Related papers (2026-07-02T10:32:34Z) - Blind Quantum Computation on a Modular Superconducting Processor [0.021748200848556345]
Cloud-based quantum processors offer access to advanced hardware hosted on a remote server, but do not guarantee data or algorithm privacy.<n>Blind quantum computation provides information-theoretic privacy by enabling a client to execute an algorithm without disclosing information about either the task or the final result.
arXiv Detail & Related papers (2026-05-14T10:11:33Z) - Universal Blind Quantum Computation with Recursive Rotation Gates [1.1333522464162373]
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.
arXiv Detail & Related papers (2025-12-17T05:43:36Z) - Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
arXiv Detail & Related papers (2025-05-06T03:42:38Z) - An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
arXiv Detail & Related papers (2025-04-13T11:49:53Z) - Partial Blind Quantum Computation: A Framework for Selective Circuit Protection [0.5755004576310334]
Universal Blind Quantum Computation protocols enable clients with limited quantum resources to delegate computations while concealing both inputs and circuit details.<n>Applying UBQC uniformly to an entire quantum circuit incurs additional quantum resources and computational overhead.<n>We propose a selective application of UBQC that targets only the critical components of quantum circuits.
arXiv Detail & Related papers (2025-03-13T03:31:12Z) - Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
arXiv Detail & Related papers (2024-10-17T02:37:40Z) - QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
arXiv Detail & Related papers (2024-10-10T14:24:30Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - 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) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field.
We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem.
We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
arXiv Detail & Related papers (2020-06-17T18:14:30Z)
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.