Quantum secret sharing is a way to share secret messages among the clients in a group with complete security. For the first time, Hillery et al. (Phys Rev A 59:1829, 1999) proposed the quantum version of the classical secret sharing protocol using GHZ states. Here, we implement the above quantum secret sharing protocol in 'IBM Q 5 Tenerife' quantum processor and compare the experimentally obtained results with the theoretically predicted ones. Further, a new quantum binary voting protocol is proposed and implemented in the 14-qubit 'IBM Q 14 Melbourne' quantum processor. The results are analyzed through the technique of quantum state tomography, and the fidelity of states is calculated for a different number of executions made in the device.
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 sum…
The privacy of communicating participants is often of paramount importance, but in some situations it is an essential condition. A typical example is a fair (secret) voting. We analyze in detail communication privacy based on quantum resources, and we propose new quantum protocols. Possible generalizations that would lead to voting schemes are discussed.
In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the parties do not divulge in their valid measurement outcomes. The operator-qubit pair forms an integral part of the scheme determining the classical secret to be shared. The protocol is robust enough to neutralize any eavesdropping on a particular qubit of the dealer. The experimental demonstration of the scheme is done on IBM-QE cloud platform with backends \text…
An unknown unitary gates, which is secretly chosen from several known ones, can always be distinguished perfectly. In this paper, we implement such a task on IBM's quantum processor. More precisely, we experimentally demonstrate the discrimination of two qubit unitary gates, the identity gate and the $\frac{2}{3}π$-phase shift gate, using two discrimination schemes -- the parallel scheme and the sequential scheme. We program these two schemes on the \emph{ibmqx4}, a $5$-qubit superconducting quantum processor via IBM cloud, with the help of the $QSI$ modules [S. Liu et al.,~arXiv:1710.09500, 2…
The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the classical information as a marked state and shares the states' qubits between three participants. The participants combine their qubits and find the marked state as a measurement result of the three-qubit state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers. In comparison to the existing schemes, our protoc…
In this paper, we consider the secret-string-learning problem in the teacher-student setting: the teacher has a secret string $s\in {\{0,1\}^{n}}$, and the student wants to learn the secret $s$ by question-answer interactions with the teacher, where at each time, the student can ask the teacher with a pair $(x, q) \in {\{0,1\}^{n}}\times\{0,1,\cdots, n-1\}$ and the teacher returns a bit given by the oracle $f_{s}(x,q)$ that indicates whether the length of the longest common prefix of $s$ and $x$ is greater than $q$ or not. Our contributions are as follows. (i) We prove that any classical deter…
In this article, we propose an interactive protocol for one party (the verifier) holding a quantum computer to verify the quantum computation power of another party's (the prover) device via a one-way quantum channel. This protocol is referred to as the dihedral coset problem (DCP) challenge. The verifier needs to prepare quantum states encoding secrets (DCP samples) and send them to the prover. The prover is then tasked with recovering those secrets with a certain accuracy. Numerical simulation demonstrates that this accuracy is sensitive to errors in quantum hardware. Additionally, the DCP c…
Due to the immense potential of quantum computers and the significant computing overhead required in machine learning applications, the variational quantum classifier (VQC) has received a lot of interest recently for image classification. The performance of VQC is jeopardized by the noise in Noisy Intermediate-Scale Quantum (NISQ) computers, which is a significant hurdle. It is crucial to remember that large error rates occur in quantum algorithms due to quantum decoherence and imprecision of quantum gates. Previous studies have looked towards using ensemble learning in conventional computing …
United Nation (UN) security council has fifteen members, out of which five permanent members of the council can use their veto power against any unfavorable decision taken by the council. In certain situation, a member using right to veto may prefer to remain anonymous. This need leads to the requirement of the protocols for anonymous veto which can be viewed as a special type of voting. Recently, a few protocols for quantum anonymous veto have been designed which clearly show quantum advantages in ensuring anonymity of the veto. However, none of the efficient protocols for quantum anonymous v…
In this paper, we propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication. Different from the previous QSDC protocols, the present protocol uses only one orthogonal basis of single-qubit states to encode the secret message. Moreover, this is a one-time and one-way communication protocol, which uses qubits prepared in a randomly chosen arbitrary basis, to transmit the secret message. We discuss the security of the proposed protocol against some common attacks and show that no eaves-dropper can get any information from the quantum and classical ch…
Secure cryptographic protocols are indispensable for modern communication systems. It is realized through an encryption process in cryptography. In quantum cryptography, Quantum Key Distribution (QKD) is a widely popular quantum communication scheme that enables two parties to establish a shared secret key that can be used to encrypt and decrypt messages. But security loopholes still exist in this cryptographic protocol, as an eavesdropper can in principle still intercept all the ciphertext to perform cryptanalysis and the key may get leaked to the eavesdropper, although it happens very rarely…
Recently, there are more and more organizations offering quantum-cloud services, where any client can access a quantum computer remotely through the internet. In the near future, these cloud servers may claim to offer quantum computing power out of reach of classical devices. An important task is to make sure that there is a real quantum computer running, instead of a simulation by a classical device. Here we explore the applicability of a cryptographic verification scheme that avoids the need of implementing a full quantum algorithm or requiring the clients to communicate with quantum resourc…
Cryptography in the modern era is very important to prevent a cyber attack, as the world tends to be more and more digitalized. Classical cryptographic protocols mainly depend on the mathematical complicacy of encoding functions and the shared key, like RSA protocol in which security depends upon the fact that factoring a big number is a hard problem to the current computers. This means that high computing power can help you crack traditional encryption methods. Quantum machines claim to have this kind of power in many instances. Factorization of big numbers may be possible with Shor's algorit…
Real-time measurement error mitigation for one-way quantum computation
Northeastern University - London（伦敦东北大学）；Khoury College of Computer Sciences, Northeastern University（东北大学库里计算机学院）；Friedrich-Alexander-Universität Erlangen-Nürnberg（埃尔朗根-纽伦堡大学）；The Cyprus Institute（塞浦路斯研究所）；Deutsches Elektronen-Synchrotron DESY（德国电子同步加速器中心）
针对单向量子计算，提出一种实时 mitigation 单量子比特测量误差的方案，通过辅助量子比特纠缠与投票协议实现，经模拟和 IBM 量子硬件实验验证，仅需少量辅助量子比特即可显著降低测量误差。
Impact of dephased entangled states and varying measurement orientations on the reliability of cryptographic keys generated via the quantum protocol E91: A quantum simulation approach
