Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1707.07460

Experimental Realization of Secure Multiparty Quantum Summation Using Five-Qubit IBM Quantum Computer on Cloud

Ayan Majumder, Santanu Mohapatra, Anil Kumar

Published Jul 24, 2017• 23 citations
arXivHTMLPDF

Abstract

A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic summation and also simulate the proposed protocol for both cases. Experimental implementation of secure multiparty quantum summation protocol for two or more qubit secret state and the proposed protocol for square(and cubic) summation are not possible using the available 5-qubit quantum processor(ibmqx2). IBM has recently placed a 16-qubit quantum processor(ibmqx3) on the cloud but it is still not accessible for all users. We describe a simulation for two and three qubit secret state and proposed protocol for square(and cubic) summation using a simulator(Custom Topology) which is provided by IBM Corporation.

DOI
10.48550/arxiv.1707.07460

Related papers

A Generalized Quantum Protocol for Secure Multiparty Summation

Kartick Sutradhar, Hari Om

The secure multiparty quantum summation is an important primitive of quantum cryptography. The existing multiparty quantum summation protocols have (n, n) threshold approach, where n out of total n players need compute the summation protocol. In this brief, we present a generalized secure multiparty quantum summation protocol. In our protocol, the linear secret sharing (LSS) and Quantum Fourier Transform (QFT) are used to take the advantages of both classical and quantum summation. We show that the outside and participant attacks are not possible in our protocol. We simulate it using the real quantum processor released by IBM corporation on “cloud”.

IEEE Transactions on Circuits & Systems II Express Briefs•Apr 22, 2020•40 citations

An efficient simulation for quantum secure multiparty computation

Kartick Sutradhar, Hari Om

The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience.

Scientific Reports•Jan 26, 2021•36 citations

Performing quantum computing experiments in the cloud

Simon J. Devitt

Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

arXiv:1605.05709•Physical Review A•Sep 29, 2016•144 citations

A novel quantum multiparty summation protocol based on a cooperative random number mechanism

Kejia Zhang, Yu Zhang, Xue Zhang +3 more

As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to $n - 2$ participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.

EPJ Quantum Technology•May 22, 2025•1 citation

Five Experimental Tests on the 5-Qubit IBM Quantum Computer

Diego García-Martín, Germán Sierra

The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results obtained in five experimental tests performed on these computers: dense coding, quantum Fourier transforms, Bell’s inequality, Mermin’s inequalities (up to n=5) and the construction of the prime state . These results serve to assess the functioning of the IBM 5Q chips.

arXiv:1712.05642•Journal of Applied Mathematics and Physics•Jan 1, 2018•53 citations

Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication

Satish Kumar

A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and m+1-qubit GHZ-like unknown state to a receiver (Bob), has been demonstrated using two copies of the Bell state instead of a five-qubit cluster state and implemented on IBM's quantum computer for the m=1 case. Another scheme, known as quantum broadcasting where a known state is sent to two spatially separated parties (Bob and Charlie) has also been realized using two Bell states. It is shown that existing quantum broadcasting schemes can be reduced to multiparty remote state preparation. After achieving teleportation of unknown and known states, sending a quantum operator becomes the next step. A scheme for remote implementation of operators (RIO), specifically a controlled joint-RIO (CJRIO), has been proposed using a four-qubit hyper-entangled state involving spatial and polarization degrees of freedom. In this direction, two more variants, remote implementation of hidden and partially unknown operators (RIHO and RIPUO) have also been proposed. Their success probabilities are analyzed considering dissipation of an auxiliary coherent state interacting with the environment. For secure multiparty tasks like quantum voting or auction, secure multiparty quantum computation (SMQC) becomes essential. A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer. Finally, two quantum key distribution (QKD) protocols, coherent one-way (COW) and differential phase shift (DPS), are experimentally demonstrated and the key rates are analyzed as functions of post-processing parameters and detector dead times across various distances.

arXiv:2507.09532•Jul 13, 2025•0 citations
A scheme for secure multiparty quantum summation was proposed by Run-hau Shi et al.,(SCIENTIFIC REPORTS, 6:19655, DOI:10.1038/srep19655). IBM Corporation has released a superconductivity based 5-qubit quantum computer named "Quantum Experience" and placed it on "cloud". In this paper we take advantage of the online availability of this real quantum processor(ibmqx2) and carry out the above protocol that has never been experimentally demonstrated earlier. Here, we set up experiments for secure quantum summation of one-qubit secret states . Besides, we propose a protocol for square and cubic summation and also simulate the proposed protocol for both cases. Experimental implementation of secure multiparty quantum summation protocol for two or more qubit secret state and the proposed protocol for square(and cubic) summation are not possible using the available 5-qubit quantum processor(ibmqx2). IBM has recently placed a 16-qubit quantum processor(ibmqx3) on the cloud but it is still not accessible for all users. We describe a simulation for two and three qubit secret state and proposed protocol for square(and cubic) summation using a simulator(Custom Topology) which is provided by IBM Corporation.
The secure multiparty quantum summation is an important primitive of quantum cryptography. The existing multiparty quantum summation protocols have (n, n) threshold approach, where n out of total n players need compute the summation protocol. In this brief, we present a generalized secure multiparty quantum summation protocol. In our protocol, the linear secret sharing (LSS) and Quantum Fourier Transform (QFT) are used to take the advantages of both classical and quantum summation. We show that the outside and participant attacks are not possible in our protocol. We simulate it using the real quantum processor released by IBM corporation on “cloud”.
The quantum secure multiparty computation is one of the important properties of secure quantum communication. In this paper, we propose a quantum secure multiparty summation (QSMS) protocol based on (t, n) threshold approach, which can be used in many complex quantum operations. To make this protocol secure and realistic, we combine both the classical and quantum phenomena. The existing protocols have some security and efficiency issues because they use (n, n) threshold approach, where all the honest players need to perform the quantum multiparty summation protocol. We however use a (t, n) threshold approach, where only t honest players need to compute the quantum summation protocol. Compared to other protocols our proposed protocol is more cost-effective, realistic, and secure. We also simulate it using the IBM corporation's online quantum computer, or quantum experience.
Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to n−2n - 2n−2 participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.
A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and m+1-qubit GHZ-like unknown state to a receiver (Bob), has been demonstrated using two copies of the Bell state instead of a five-qubit cluster state and implemented on IBM's quantum computer for the m=1 case. Another scheme, known as quantum broadcasting where a known state is sent to two spatially separated parties (Bob and Charlie) has also been realized using two Bell states. It is shown that existing quantum broadcasting schemes can be reduced to multiparty remote state preparation. After achieving teleportation of unknown and known states, sending a quantum operator becomes the next step. A scheme for remote implementation of operators (RIO), specifically a controlled joint-RIO (CJRIO), has been proposed using a four-qubit hyper-entangled state involving spatial and polarization degrees of freedom. In this direction, two more variants, remote implementation of hidden and partially unknown operators (RIHO and RIPUO) have also been proposed. Their success probabilities are analyzed considering dissipation of an auxiliary coherent state interacting with the environment. For secure multiparty tasks like quantum voting or auction, secure multiparty quantum computation (SMQC) becomes essential. A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer. Finally, two quantum key distribution (QKD) protocols, coherent one-way (COW) and differential phase shift (DPS), are experimentally demonstrated and the key rates are analyzed as functions of post-processing parameters and detector dead times across various distances.