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

World Scientific News

Deutsch-Jozsa Algorithm for Three Fermions System

Mezher B. Saleh, Loay Edwar George, Kadhum J. Kadhum

Published Jan 1, 2016• 0 citations
OpenAlex

Abstract

One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2 n /2 + 1 = 5) evaluations.

Related papers

Implementing quantum algorithms using classical electrical circuits: Deutsch, Deutsch-Jozsa and Grover

Charles Dyson

We develop the means to implement Deutsch's algorithm, the Deutsch-Jozsa algorithm and Grover's algorithm using electronic circuits, and review previous attempts to implement quantum algorithms classically. We attempt to demonstrate that these are not fundamentally quantum algorithms, but merely algorithms that scale exceptionally well on quantum computers. Finally, we discuss a prototype design for an electrical Hadamard gate and report experimental results.

•Mar 1, 2011•4 citations

Quantum Algorithms in IBMQ Experience: Deutsch-Jozsa algorithm

Antônio Nonato de Oliveira, Estêvão V. B. de Oliveira, Alan C. Santos +1 more

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have become a reality. In this article we didactically present basic elements of the latest version of IBM's quantum computer and its main tools. We also present in detail the Deutsch-Jozsa algorithm used to differentiate constant functions from balanced functions, also, including a discussion of its efficiency against classical algorithms for the same task. The experimental implementation of the algorithm in a 4-qbit system is presented. Our article paves the way for a series of didactic investigations into the IBM system as well as the best known quantum algorithms.

arXiv:2109.07910•Sep 15, 2021•2 citations

Quantum Computing Concepts with Deutsch Jozsa Algorithm

Poornima Aradyamath, N. M. Naghabhushana, Rohitha Ujjinimatad

In this paper, we briefly review the basic concepts of quantum computation, entanglement, quantum cryptography and quantum fourier transform. Quantum algorithms like Deutsch Jozsa, Shor’s factorization and Grover’s data search are developed using fourier transform and quantum computation concepts to build quantum computers. Researchers are finding a way to build quantum computer that works more efficiently than classical computer. Among the standard well known algorithms in the field of quantum computation and communication we describe mathematically Deutsch Jozsa algorithm in detail for 2 and 3 qubits. Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.

JOIV International Journal on Informatics Visualization•Jan 10, 2019•6 citations

EXTRACTION OF VALUE OF FUNCTION f(x) IN DEUTSCH ALGORITHM AND DEUTSCH–JOZSA ALGORITHM

Li Fei Deng, Ai-Xi Chen, Xu Yan-Qiu +1 more

Deutsch algorithm or Deutsch–Jozsa algorithm only needs one query to determine whether the function f(x) is constant or balanced. That is, the global property of the function f(x) is rapidly known. But these algorithms do not give the concrete value of function f(x). For the f(x), its value is also of interest. Here we propose a scheme in which the value of function f(x) can be determined. We use an entangled state as the input state and send it into quantum black box. Through performing measurement on the output state, we can exactly determine the value of f(x). Its value plus its global property enables us to thoroughly understand elementary information of f(x). Based on these informations, we can determine unitary transformations on the input state walking through quantum black box. The quantum black box becomes quantum white box to a certain extent.

International Journal of Quantum Information•Apr 1, 2009•0 citations

More advanced quantum algorithms

Jonathan A. Jones, Dieter Jaksch

Deutsch's algorithm and Grover's quantum search are theoretically interesting, but it is not obvious that these two algorithms are actually useful for anything important. We next consider a selection of more advanced algorithms, several of which may have real-life applications. Some of these will be too complicated to explain fully, and their properties will only be sketched briefly. The Deutsch–Jozsa algorithm Deutsch's algorithm is simple, but important, as it shows that a quantum algorithm can find a property of an unknown function (its parity) with a smaller number of queries than any possible classical algorithm (one rather than two). For this reason we can say that quantum computing is more efficient than classical computing within the oracle model of function evaluation. (It is widely believed that quantum computing is more efficient than classical computing in general, but this is a surprisingly hard thing to prove.) The simplicity of the algorithm is also an advantage, as it can be implemented on very primitive quantum computers. Beyond this, however, Deutsch's algorithm is also important as the simplest member of a large family of quantum algorithms, including most notably Shor's quantum factoring algorithm. The second simplest algorithm in the family is the Deutsch–Jozsa algorithm, which solves a very closely related problem. Consider an unknown binary function with n input bits, giving N = 2 n possible inputs, and a single output bit.

Cambridge University Press eBooks•Jul 19, 2012•0 citations

An Extension of the Deutsch-Jozsa Algorithm to Arbitrary Qudits

Peter Marttala

Recent advances in quantum computational science promise substantial improvements in the speed with which certain classes of problems can be computed. Various algorithms that utilize the distinctively non-classical characteristics of quantum mechanics have been formulated to take advantage of this promising new approach to computation. One such algorithm was formulated by David Deutsch and Richard Jozsa. By measuring the output of a quantum network that implements this algorithm, it is possible to determine with N – 1 measurements certain global properties of a function f(x), where N is the number of network inputs. Classically, it may not be possible to determine these same properties without evaluating f(x) a number of times that rises exponentially as N increases. Hitherto, the potential power of this algorithm has been explored in the context of qubits, the quantum computational analogue of classical bits. However, just as one can conceive of classical computation in the context of non-binary logic, such as ternary or quaternary logic, so also can one conceive of corresponding higher-order quantum computational equivalents.This thesis investigates the behaviour of the Deutsch-Jozsa algorithm in the context of these higher-order quantum computational forms of logic and explores potential applications for this algorithm. An important conclusion reached is that, not only can the Deutsch-Jozsa algorithm’s known computational advantages be formulated in more general terms, but also a new algorithmic property is revealed with potential practical applications.

•Jan 1, 2007•0 citations
One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2 n /2 + 1 = 5) evaluations.
Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have become a reality. In this article we didactically present basic elements of the latest version of IBM's quantum computer and its main tools. We also present in detail the Deutsch-Jozsa algorithm used to differentiate constant functions from balanced functions, also, including a discussion of its efficiency against classical algorithms for the same task. The experimental implementation of the algorithm in a 4-qbit system is presented. Our article paves the way for a series of didactic investigations into the IBM system as well as the best known quantum algorithms.
In this paper, we briefly review the basic concepts of quantum computation, entanglement, quantum cryptography and quantum fourier transform. Quantum algorithms like Deutsch Jozsa, Shor’s factorization and Grover’s data search are developed using fourier transform and quantum computation concepts to build quantum computers. Researchers are finding a way to build quantum computer that works more efficiently than classical computer. Among the standard well known algorithms in the field of quantum computation and communication we describe mathematically Deutsch Jozsa algorithm in detail for 2 and 3 qubits. Calculation of balanced and unbalanced states is shown in the mathematical description of the algorithm.
Deutsch algorithm or Deutsch–Jozsa algorithm only needs one query to determine whether the function f(x) is constant or balanced. That is, the global property of the function f(x) is rapidly known. But these algorithms do not give the concrete value of function f(x). For the f(x), its value is also of interest. Here we propose a scheme in which the value of function f(x) can be determined. We use an entangled state as the input state and send it into quantum black box. Through performing measurement on the output state, we can exactly determine the value of f(x). Its value plus its global property enables us to thoroughly understand elementary information of f(x). Based on these informations, we can determine unitary transformations on the input state walking through quantum black box. The quantum black box becomes quantum white box to a certain extent.
Deutsch's algorithm and Grover's quantum search are theoretically interesting, but it is not obvious that these two algorithms are actually useful for anything important. We next consider a selection of more advanced algorithms, several of which may have real-life applications. Some of these will be too complicated to explain fully, and their properties will only be sketched briefly. The Deutsch–Jozsa algorithm Deutsch's algorithm is simple, but important, as it shows that a quantum algorithm can find a property of an unknown function (its parity) with a smaller number of queries than any possible classical algorithm (one rather than two). For this reason we can say that quantum computing is more efficient than classical computing within the oracle model of function evaluation. (It is widely believed that quantum computing is more efficient than classical computing in general, but this is a surprisingly hard thing to prove.) The simplicity of the algorithm is also an advantage, as it can be implemented on very primitive quantum computers. Beyond this, however, Deutsch's algorithm is also important as the simplest member of a large family of quantum algorithms, including most notably Shor's quantum factoring algorithm. The second simplest algorithm in the family is the Deutsch–Jozsa algorithm, which solves a very closely related problem. Consider an unknown binary function with n input bits, giving N = 2 n possible inputs, and a single output bit.
Recent advances in quantum computational science promise substantial improvements in the speed with which certain classes of problems can be computed. Various algorithms that utilize the distinctively non-classical characteristics of quantum mechanics have been formulated to take advantage of this promising new approach to computation. One such algorithm was formulated by David Deutsch and Richard Jozsa. By measuring the output of a quantum network that implements this algorithm, it is possible to determine with N – 1 measurements certain global properties of a function f(x), where N is the number of network inputs. Classically, it may not be possible to determine these same properties without evaluating f(x) a number of times that rises exponentially as N increases. Hitherto, the potential power of this algorithm has been explored in the context of qubits, the quantum computational analogue of classical bits. However, just as one can conceive of classical computation in the context of non-binary logic, such as ternary or quaternary logic, so also can one conceive of corresponding higher-order quantum computational equivalents.This thesis investigates the behaviour of the Deutsch-Jozsa algorithm in the context of these higher-order quantum computational forms of logic and explores potential applications for this algorithm. An important conclusion reached is that, not only can the Deutsch-Jozsa algorithm’s known computational advantages be formulated in more general terms, but also a new algorithmic property is revealed with potential practical applications.