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

Applied Mathematics & Information Sciences Letters

Solving Deutsch’s Problem using Entanglement Measurement Algorithm

Mohammed Zidan, Abdel‐Haleem Abdel‐Aty, Ahmed S.A. Mohamed, Ibrahim Elkhayat, Mahmoud Abdel‐Aty

Published Sep 1, 2018• 1 citation
Publisher
DOI
10.18576/amisl/060302

Related papers

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

He-Liang Huang, Ashutosh Goswami, Wan‐Su Bao +1 more

Science China Physics Mechanics and Astronomy•Mar 7, 2018•22 citations

A quantum algorithm based on entanglement measure for classifying Boolean multivariate function into novel hidden classes

Mohammed Zidan, Abdel‐Haleem Abdel‐Aty, Duc Manh Nguyen +4 more

In this paper, we propose a novel algorithm that solves a generalized version of the Deutsch-Jozsa problem. The proposed algorithm has the potential to classify an oracle U F , that represents an unknown Boolean function on n Boolean variables, to one of 2 n different classes instead of only two classes which are constant and balanced classes in the case of Deutsch-Jozsa algorithm. The proposed algorithm is based on the use of entanglement measure to explore 2 n - 2 additional classes compared to the standard Deutsch-Jozsa algorithm. In addition, the comparison between the proposed quantum algorithm and the classical one is investigated in details. The comparison shows that the proposed algorithm is faster when the number of Boolean variables exceed 14 variables.

Results in Physics•Aug 9, 2019•58 citations

Getting the measure of entanglement

S. L. Rolston

Nature•Dec 1, 2015•4 citations

AN OBSERVER-BASED DE-QUANTISATION OF DEUTSCH'S ALGORITHM

Cristian S. Calude, Matteo Cavaliere, Radu Mardare

Deutsch's problem is the simplest and most frequently examined example of computational problem used to demonstrate the superiority of quantum computing over classical computing. Deutsch's quantum algorithm has been claimed to be faster than any classical ones solving the same problem, only to be discovered later that this was not the case. Various de-quantised solutions for Deutsch's quantum algorithm—classical solutions which are as efficient as the quantum one—have been proposed in the literature. These solutions are based on the possibility of classically simulating "superpositions", a key ingredient of quantum algorithms, in particular, Deutsch's algorithm. The de-quantisation proposed in this note is based on a classical simulation of the quantum measurement achieved with a model of observed system. As in some previous de-quantisations of Deutsch's quantum algorithm, the resulting de-quantised algorithm is deterministic. Finally, we classify observers (as finite state automata) that can solve the problem in terms of their "observational power".

International Journal of Foundations of Computer Science•Jan 1, 2011•1 citation

Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level on an NMR quantum-information processor

Kavita Dorai, Arvind, Anil Kumar

We describe the NMR implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits. The algorithm solves a generalization of the Deutsch problem, and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and Grover's search algorithm for two bits.

arXiv:quant-ph/0006103•Physical Review A•Feb 9, 2001•26 citations

The Deutsch–Jozsa problem: de-quantisation and entanglement

Alastair A. Abbott

arXiv:0910.1990•Natural Computing•Aug 23, 2011•18 citations
In this paper, we propose a novel algorithm that solves a generalized version of the Deutsch-Jozsa problem. The proposed algorithm has the potential to classify an oracle U F , that represents an unknown Boolean function on n Boolean variables, to one of 2 n different classes instead of only two classes which are constant and balanced classes in the case of Deutsch-Jozsa algorithm. The proposed algorithm is based on the use of entanglement measure to explore 2 n - 2 additional classes compared to the standard Deutsch-Jozsa algorithm. In addition, the comparison between the proposed quantum algorithm and the classical one is investigated in details. The comparison shows that the proposed algorithm is faster when the number of Boolean variables exceed 14 variables.
Deutsch's problem is the simplest and most frequently examined example of computational problem used to demonstrate the superiority of quantum computing over classical computing. Deutsch's quantum algorithm has been claimed to be faster than any classical ones solving the same problem, only to be discovered later that this was not the case. Various de-quantised solutions for Deutsch's quantum algorithm—classical solutions which are as efficient as the quantum one—have been proposed in the literature. These solutions are based on the possibility of classically simulating "superpositions", a key ingredient of quantum algorithms, in particular, Deutsch's algorithm. The de-quantisation proposed in this note is based on a classical simulation of the quantum measurement achieved with a model of observed system. As in some previous de-quantisations of Deutsch's quantum algorithm, the resulting de-quantised algorithm is deterministic. Finally, we classify observers (as finite state automata) that can solve the problem in terms of their "observational power".