Homomorphic encryption experiments on IBM’s cloud quantum computing platform

  title={Homomorphic encryption experiments on IBM’s cloud quantum computing platform},
  author={Heliang Huang and You-Wei Zhao and Tan Li and Feng-Guang Li and Yunhai Du and Xiangqun Fu and Shuo Zhang and Xiang Wang and Wansu Bao},
  journal={Frontiers of Physics},
Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well… 

Cryptography in Quantum Computing

This study examines one of the very few experiments on encryption that has already been conducted and analyzes the results of the tests run on the IBM Cloud Server to recreate the sample experiment and make comprehensive adjustments for a real-world environment.

Universal blind quantum computation for hybrid system

Here, the first step is taken to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalableblind quantum computation.

Quantum Ciphertext Dimension Reduction Scheme for Homomorphic Encrypted Data

  • Changqing GongZ. DongA. GaniHan Qi
  • Computer Science
    2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
  • 2021
This work has implemented a quantum ciphertext dimensionality reduction scheme implemented in the quantum cloud, which does not require interaction and ensures safety, and carried out experimental verification on the QPCE algorithm, which shows that the algorithm can perform cipher Text dimension reduction safely and effectively.

Quantum k-means algorithm based on trusted server in quantum cloud computing

A quantum k-means algorithm based on quantum cloud computing that effectively solves the problem that the client can not afford to execute the same quantum subroutine repeatedly in the face of large training samples and improves the efficiency of the quantum homomorphic encryption scheme.

Password authentication schemes on a quantum computer

This paper shows an implementation of quantum copy-protection for password verification on IBM quantum computers, and shares its quantum computation results and analyses, as well as lessons learned.

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

A new quantum binary voting protocol is proposed and implemented in the 14-qubit ‘IBM Q 14 Melbourne’ quantum processor and the fidelity of states is calculated for different number of executions made in the device.

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

This paper discussed the designing methodology, algorithm framework and latest progress of the mathematic hard problems on which the typical cryptosystems depend, including integer factorization problem, discrete logarithmic problem and its variants, lattice problem, dihedral hidden subgroup problems and extrapolated dihedral coset problem.

Implementation of quantum compression on IBM quantum computers

This paper reports on implementations of quantum compression algorithm that can efficiently compress unknown quantum information and restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors.

Optimization of Grover's Algorithm Simulation Based on Cloud Computing

A high performance Grover algorithm simulation is proposed combining the characteristics of Grover’s algorithm and the parallelism of cloud computing, which dramatically improves the performance of the load balancing among multi-core, the utilization of memory space and the efficiency of simulation.

Measurement-based universal blind quantum computation with minor resources

This paper proposes a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process, and analyzes and proves the blindness, correctness, universality and verifiability of this protocol.



Performing Quantum Computing Experiments in the Cloud

This paper utilises the IBM chip to realise protocols in Quantum Error Correction, Quantum Arithmetic, Quantum graph theory and Fault-tolerant quantum computation, by accessing the device remotely through the cloud.

Demonstration of Blind Quantum Computing

An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.

Realization of a scalable Shor algorithm

The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.


It appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations.

A fully homomorphic encryption scheme

This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.

Unconditionally verifiable blind quantum computation

It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.

Universal Blind Quantum Computation

The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.

Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

A simple, parameter-free but predictive model of decoherence effects in the authors' system is presented, which is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work.

Quantum computation and quantum information

This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.