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

Alexandria Engineering Journal

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

Mohammed Zidan, Mohamed N. El-Qersh, Mahmoud Abdel‐Aty, Montasir Qasymeh, Hichem Eleuch

Published Nov 8, 2024• 4 citations
Publisher

Abstract

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.

DOI
10.1016/j.aej.2024.10.068

Related papers

Implementation and measurement of quantum entanglement using IBM quantum platforms

Naser Karimi, Seyed Navid Elyasi, Marziyeh Yahyavi

Abstract The use of quantum entanglement has garnered increasing attention among researchers in recent years due to its wide range of applications, not only revolutionizing the field of information processing but also enhancing quantum-safe communications. Identifying the degree of entanglement present in quantum states is a crucial focus, and designing an algorithm capable of feasibly measuring entanglement is imperative. While theoretical calculations hold high regard, the ease of implementing these algorithms in a laboratory setting is essential to gauge their efficiency.In this context, IBM quantum computers stand out as discrete value NISQ (Noisy Intermediate-Scale Quantum) platforms These platforms are based on superconducting qubits, providing an opportunity to test our algorithms without the need for extravagant laboratory equipment. This paper proposes an algorithm designed to measure entanglement in a bipartite system. We will execute the algorithm on IBM’s 127-qubit backends to compare our calculations with real-world results. Furthermore, we aim to address and mitigate errors inherent in these devices by utilizing local mitigation technique available in the IBM Experiments Python package, aiming for more accurate and reliable outcomes.

Physica Scripta•Mar 18, 2024•8 citations

A Quantum Algorithm for Evaluating the Hamming Distance

Sohail Khan, Mohammad Nauman, Suleiman Ali Alsaif +2 more

We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary qubits. In particular, we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model structure. This model uses one of two techniques to retrieve the solution of a quantum computing problem at hand. In the first technique, the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or not. In the second, the solution of the quantum computing problem is obtained as a function in the concurrence value, and the number of states that can be generated from the Boolean variables. The proposed algorithm receives two oracles, each oracle represents an unknown Boolean function, then it measures the hamming distance between these two oracles. The hamming distance is evaluated based on the second technique. It is shown that the proposed algorithm provides exponential speedup compared with the classical counterpart for Boolean functions that have large numbers of Boolean variables. The proposed algorithm is explained via a case study. Finally, employing recently developed experimental techniques, the proposed algorithm has been verified using IBM's quantum computer simulator.

Computers, materials & continua/Computers, materials & continua (Print)•Nov 3, 2021•17 citations

Discriminating mixed qubit states with collective measurements

Lorcán O. Conlon, Falk X. Eilenberger, Ping Koy Lam +1 more

Abstract It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. In general, the optimal measurement for distinguishing such states is a collective measurement. However, to the best our knowledge, collective measurements have not been used to enhance quantum state discrimination to date. One of the main reasons for this is the fact that, in the usual state discrimination setting with equal prior probabilities, at least three copies of a quantum state are required to be measured collectively to outperform separable measurements. This is very challenging experimentally. In this work, by considering unequal prior probabilities, we propose and experimentally demonstrate a protocol for distinguishing two copies of single qubit states using collective measurements which achieves a lower probability of error than can be achieved by any non-entangling measurement. Additionally, we implemented collective measurements on three and four copies of the unknown state and found they performed poorly.

arXiv:2302.08882•Communications Physics•Nov 22, 2023•16 citations

Controlling Remote Robots Based on Zidan’s Quantum Computing Model

Biswaranjan Panda, Nitin Kumar Tripathy, Shibashankar Sahu +2 more

In this paper, we propose a novel algorithm based on Zidan’s quantum computing model for remotely controlling the direction of a quantum-controlled mobile robot equipped with n-movements. The proposed algorithm is based on the measurement of concurrence value for the different movements of the robot. Consider a faraway robot that moves in the deep space (e.g., moves toward a galaxy), and it is required to control the direction of this robot from a ground station by some person Alice. She sends an unknown qubit α |0⟩ + β |1⟩ via the teleportation protocol to the robot. Then, the proposed algorithm decodes the received unknown qubit into an angle θ, that determines the motion direction of the robot, based on the concurrence value. The proposed algorithm has been tested for four and eight movements. Two simulators have been tested; IBM Quantum composer and IBM’s system, The two simulators achieved the same result approximately. The motion of any part of the robot is considered, if it has a pre-existing sensor system and a locomotive system,. We can use this technique in many places like in space robots (16 directions). The results show that the proposed technique can be easily used for a huge number of movements. However, increasing the number of movements of the robot will increase the number of qubits.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2022•6 citations

Entanglement identification of arbitrary two-qubit quantum channels and the capabilities to realise quantum teleportation

Lila Yuwana, Agus Purwanto, Endarko Endarko +1 more

Objectives: To identify the entanglements of arbitrary two-qubit quantum channels and the capabilities to realise quantum teleportation. Methods: The implementation of Schmidt de composition and measurements of quantum system state are equiped in this research. Findings: By constructing the general form of an arbitrary two qubit and measurement state, we able to determine an entanglement of an arbitrary two qubit by utilising Schmidt decomposition. Next, a capability of an arbitrary two qubit entangled state to realise teleportation can be identified by formulating measurement state and unitary operator. Improvement: The methods used in this paper have relatively simple calculations and very beneficial to be implement before developing quantum teleportation system experimentally. Keywords: Entangled States, Quantum Channels, Qubit (Quantum Bit), Quantum Teleportation

Indian Journal of Science and Technology•Nov 1, 2017•3 citations

Estimating quantum relative entropies on quantum computers

Yuchen Lu, Kun Fang

Quantum relative entropy serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science. Despite its importance, efficiently estimating quantum relative entropy between two quantum states on quantum computers remains a significant challenge. In this work, we propose a quantum algorithm for directly estimating quantum relative entropy and Petz Rényi divergence from two unknown quantum states on quantum computers. The circuit size of our algorithm is at most 2n + 1 with n being the number of qubits in the quantum states and it is directly applicable to distributed scenarios, where quantum states to be compared are hosted on cross-platform devices. We validate the effectiveness of our method through numerical experiments and observe the absence of the barren plateau phenomenon. As an application, we employ our algorithm to investigate the superadditivity of quantum channel capacity. Numerical simulations reveal new examples of qubit channels exhibiting strict superadditivity of coherent information, highlighting the potential of quantum machine learning to address quantum-native problems. Quantum relative entropy is a central measure of distinguishability between quantum states, yet its estimation on quantum computers remains challenging. Here, the authors propose a variational quantum algorithm that directly evaluates it from unknown states and works across distributed quantum devices.

arXiv:2501.07292•Communications Physics•May 6, 2026•1 citation
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.
Abstract The use of quantum entanglement has garnered increasing attention among researchers in recent years due to its wide range of applications, not only revolutionizing the field of information processing but also enhancing quantum-safe communications. Identifying the degree of entanglement present in quantum states is a crucial focus, and designing an algorithm capable of feasibly measuring entanglement is imperative. While theoretical calculations hold high regard, the ease of implementing these algorithms in a laboratory setting is essential to gauge their efficiency.In this context, IBM quantum computers stand out as discrete value NISQ (Noisy Intermediate-Scale Quantum) platforms These platforms are based on superconducting qubits, providing an opportunity to test our algorithms without the need for extravagant laboratory equipment. This paper proposes an algorithm designed to measure entanglement in a bipartite system. We will execute the algorithm on IBM’s 127-qubit backends to compare our calculations with real-world results. Furthermore, we aim to address and mitigate errors inherent in these devices by utilizing local mitigation technique available in the IBM Experiments Python package, aiming for more accurate and reliable outcomes.
We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary qubits. In particular, we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model structure. This model uses one of two techniques to retrieve the solution of a quantum computing problem at hand. In the first technique, the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or not. In the second, the solution of the quantum computing problem is obtained as a function in the concurrence value, and the number of states that can be generated from the Boolean variables. The proposed algorithm receives two oracles, each oracle represents an unknown Boolean function, then it measures the hamming distance between these two oracles. The hamming distance is evaluated based on the second technique. It is shown that the proposed algorithm provides exponential speedup compared with the classical counterpart for Boolean functions that have large numbers of Boolean variables. The proposed algorithm is explained via a case study. Finally, employing recently developed experimental techniques, the proposed algorithm has been verified using IBM's quantum computer simulator.
Abstract It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. In general, the optimal measurement for distinguishing such states is a collective measurement. However, to the best our knowledge, collective measurements have not been used to enhance quantum state discrimination to date. One of the main reasons for this is the fact that, in the usual state discrimination setting with equal prior probabilities, at least three copies of a quantum state are required to be measured collectively to outperform separable measurements. This is very challenging experimentally. In this work, by considering unequal prior probabilities, we propose and experimentally demonstrate a protocol for distinguishing two copies of single qubit states using collective measurements which achieves a lower probability of error than can be achieved by any non-entangling measurement. Additionally, we implemented collective measurements on three and four copies of the unknown state and found they performed poorly.
In this paper, we propose a novel algorithm based on Zidan’s quantum computing model for remotely controlling the direction of a quantum-controlled mobile robot equipped with n-movements. The proposed algorithm is based on the measurement of concurrence value for the different movements of the robot. Consider a faraway robot that moves in the deep space (e.g., moves toward a galaxy), and it is required to control the direction of this robot from a ground station by some person Alice. She sends an unknown qubit α |0⟩ + β |1⟩ via the teleportation protocol to the robot. Then, the proposed algorithm decodes the received unknown qubit into an angle θ, that determines the motion direction of the robot, based on the concurrence value. The proposed algorithm has been tested for four and eight movements. Two simulators have been tested; IBM Quantum composer and IBM’s system, The two simulators achieved the same result approximately. The motion of any part of the robot is considered, if it has a pre-existing sensor system and a locomotive system,. We can use this technique in many places like in space robots (16 directions). The results show that the proposed technique can be easily used for a huge number of movements. However, increasing the number of movements of the robot will increase the number of qubits.
Objectives: To identify the entanglements of arbitrary two-qubit quantum channels and the capabilities to realise quantum teleportation. Methods: The implementation of Schmidt de composition and measurements of quantum system state are equiped in this research. Findings: By constructing the general form of an arbitrary two qubit and measurement state, we able to determine an entanglement of an arbitrary two qubit by utilising Schmidt decomposition. Next, a capability of an arbitrary two qubit entangled state to realise teleportation can be identified by formulating measurement state and unitary operator. Improvement: The methods used in this paper have relatively simple calculations and very beneficial to be implement before developing quantum teleportation system experimentally. Keywords: Entangled States, Quantum Channels, Qubit (Quantum Bit), Quantum Teleportation
Quantum relative entropy serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science. Despite its importance, efficiently estimating quantum relative entropy between two quantum states on quantum computers remains a significant challenge. In this work, we propose a quantum algorithm for directly estimating quantum relative entropy and Petz Rényi divergence from two unknown quantum states on quantum computers. The circuit size of our algorithm is at most 2n + 1 with n being the number of qubits in the quantum states and it is directly applicable to distributed scenarios, where quantum states to be compared are hosted on cross-platform devices. We validate the effectiveness of our method through numerical experiments and observe the absence of the barren plateau phenomenon. As an application, we employ our algorithm to investigate the superadditivity of quantum channel capacity. Numerical simulations reveal new examples of qubit channels exhibiting strict superadditivity of coherent information, highlighting the potential of quantum machine learning to address quantum-native problems. Quantum relative entropy is a central measure of distinguishability between quantum states, yet its estimation on quantum computers remains challenging. Here, the authors propose a variational quantum algorithm that directly evaluates it from unknown states and works across distributed quantum devices.