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:1803.06311

Experimental Demonstration of Non-Destructive Discrimination of Arbitrary Set of Orthogonal Quantum States Using 5-qubit IBM Quantum Computer on Cloud

Ayan Majumder, Anil Kumar

Published Mar 16, 2018• 1 citation
arXivHTMLPDF

Abstract

A protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we set up experiments for arbitrary one-qubit and two-qubit orthogonal quantum states. The experiment confirmed that the arbitrary orthogonal quantum states can be discriminate in a nondestructive manner with a high fidelity. We compare the outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors. Here, we also show the state tomography for the single qubit experiments.

DOI
10.48550/arxiv.1803.06311

Related papers

Non-Destructive Discrimination of arbitrary set of orthogonal quantum states by NMR using Quantum Phase Estimation

Manu Veliparambil Subrahmanian, Anil Kumar, Dipankar Home +2 more

An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation.

arXiv:1105.2186•AIP conference proceedings•Jan 1, 2011•8 citations

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

Ayan Majumder, Santanu Mohapatra, Anil Kumar

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.

arXiv:1707.07460•Jul 24, 2017•23 citations

A quantum entanglement-based algorithm for discriminating non-orthogonal qubits

Mohammed Zidan, Mohamed N. El-Qersh, Mahmoud Abdel‐Aty +2 more

Distinguishing unknown non-orthogonal qubits is an essential requirement for addressing various challenges in quantum computation , including quantum machine learning, quantum communications , and quantum technologies . For instance, while quantum teleportation enables the transfer of unknown individual qubits between distant parties, an algorithm is necessary to define the associated state of a teleported qubit at the receiving end. In this paper, we propose a novel quantum algorithm designed to effectively determine the state of a given unknown qubit and distinguish a subset of non-orthogonal qubits. The proposed algorithm can efficiently identify the state of an unknown qubit in the form cos θ 2 | 0 〉 + sin θ 2 | 1 〉 using the M z operator. By estimating the angle θ through the measurement of entanglement degree, the proposed algorithm can identify the state of an unknown qubit. Experimental validation of the proposed algorithm is conducted using the IBM quantum computer simulator chip ibmqx2. Furthermore, a t-test is conducted to compare the proposed algorithm with the direct measurement approach. The results indicate a significant difference between the two methods, demonstrating the superior performance of the proposed algorithm.

Alexandria Engineering Journal•Nov 8, 2024•4 citations

Automated error correction in superdense coding, with implementation on superconducting quantum computer

Kumar Nilesh, Piyush Joshi, Prasanta Kumar Panigrahi

Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of the algorithms, thereby decreasing any quantum advantage. Here we present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. At its core, it is based on non-destructive discrimination method of Bell states involving measurements on ancilla qubits (phase and parity ancilla). The algorithm is shown to be distributable and can be distributed to any set of parties sharing orthogonal states. Automated refers to experimentally implementing the algorithm in a quantum computer by utilizing unitary operators with no measurements in between and thus without the need for outside intervention. We also experimentally realize our automated error correction technique for three different types of superdense coding algorithm on a 7-qubit superconducting IBM quantum computer and also on a 27-qubit quantum simulator in the presence of noise. Probability histograms are generated to show the high fidelity of our experimental results. Quantum state tomography is also carried out with the quantum computer to explicate the efficacy of our method.

arXiv:2210.15161•Oct 27, 2022•1 citation

Masking of Quantum Information into Restricted Set of states

Tamal Ghosh, Sarkar, Soumya, Bikash K. Behera +1 more

Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it's impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their masking through both the theoretical calculation as well as verification in the quantum computer. By quantum state tomography, it is concluded that the experimental results are collected with high fidelity and hence the possibility of masking is realized.

arXiv:1910.00938•Oct 1, 2019•5 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 protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we set up experiments for arbitrary one-qubit and two-qubit orthogonal quantum states. The experiment confirmed that the arbitrary orthogonal quantum states can be discriminate in a nondestructive manner with a high fidelity. We compare the outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors. Here, we also show the state tomography for the single qubit experiments.
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.
Distinguishing unknown non-orthogonal qubits is an essential requirement for addressing various challenges in quantum computation , including quantum machine learning, quantum communications , and quantum technologies . For instance, while quantum teleportation enables the transfer of unknown individual qubits between distant parties, an algorithm is necessary to define the associated state of a teleported qubit at the receiving end. In this paper, we propose a novel quantum algorithm designed to effectively determine the state of a given unknown qubit and distinguish a subset of non-orthogonal qubits. The proposed algorithm can efficiently identify the state of an unknown qubit in the form cos θ 2 | 0 〉 + sin θ 2 | 1 〉 using the M z operator. By estimating the angle θ through the measurement of entanglement degree, the proposed algorithm can identify the state of an unknown qubit. Experimental validation of the proposed algorithm is conducted using the IBM quantum computer simulator chip ibmqx2. Furthermore, a t-test is conducted to compare the proposed algorithm with the direct measurement approach. The results indicate a significant difference between the two methods, demonstrating the superior performance of the proposed algorithm.
Construction of a fault-tolerant quantum computer remains a challenging problem due to unavoidable noise in quantum states and the fragility of quantum entanglement. However, most of the error-correcting codes increases the complexity of the algorithms, thereby decreasing any quantum advantage. Here we present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. At its core, it is based on non-destructive discrimination method of Bell states involving measurements on ancilla qubits (phase and parity ancilla). The algorithm is shown to be distributable and can be distributed to any set of parties sharing orthogonal states. Automated refers to experimentally implementing the algorithm in a quantum computer by utilizing unitary operators with no measurements in between and thus without the need for outside intervention. We also experimentally realize our automated error correction technique for three different types of superdense coding algorithm on a 7-qubit superconducting IBM quantum computer and also on a 27-qubit quantum simulator in the presence of noise. Probability histograms are generated to show the high fidelity of our experimental results. Quantum state tomography is also carried out with the quantum computer to explicate the efficacy of our method.
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it's impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their masking through both the theoretical calculation as well as verification in the quantum computer. By quantum state tomography, it is concluded that the experimental results are collected with high fidelity and hence the possibility of masking is realized.
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.