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

International Journal of Quantum Information

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

Li Fei Deng, Ai-Xi Chen, Xu Yan-Qiu, Suyun Zhou

Published Apr 1, 2009• 0 citations
Publisher

Abstract

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.

DOI
10.1142/s0219749909005341

Related papers

Implementation of Deutsch-Jozsa algorithm and determination of value of function via Rydberg blockade

Aixi Chen

We propose an efficient scheme in which the Deutsch-Jozsa algorithm can be realized via Rydberg blockade interaction. Deutsch-Jozsa algorithm can fast determine whether function is constant or balanced, but this algorithm does not give the concrete value of function. Using the Rydberg blockade, value of function may be determined in our scheme. According to the quantitative calculation of Rydberg blockade, we discuss the experimental feasibility of our scheme.

Optics Express•Jan 19, 2011•18 citations

Generalized Deutsch-Jozsa Algorithm for Applications in Data Classification, Logistic Regression, and Quantum Key Distribution

M. Ghadimi, V. Salari, S. Bakrani +4 more

We present a generalized Deutsch-Jozsa (DJ) quantum algorithm that not only determines both the global type of an unknown Boolean function (constant or balanced) but also determines explicit output values of the function in a single oracle query. Unlike the original DJ algorithm, which identifies only whether a function is constant or balanced, our generalization retrieves actual function output values at the same time with using a Bell state as ancilla. This makes a richer function characterization with minimal queries to have practical quantum advantages, e.g. data classification, logistic regression, and quantum cryptography.

quant-pharXiv:2512.00715•Physical Review A•Dec 2, 2025•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

A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic

Yale Fan

We generalize the binary Deutsch-Jozsa algorithm to n- valued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced Boolean functions in a single query, but can also find closed expressions for classes of affine functions in quantum oracles, accurate to a constant term.

arXiv:0809.0932•IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2007•26 citations

Deutsch-Jozsa Algorithm for Three Fermions System

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

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.

World Scientific News•Jan 1, 2016•0 citations

Leveraging modular values in quantum algorithms: the Deutsch-Jozsa

Lorena Ballesteros Ferraz, Timotéo Carletti, Yves Caudano

We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given function acting on a set of binary values is constant (uniformly yielding outputs of either all 0 or all 1), or balanced (a situation wherein half of the outputs are 0 and the other half are 1). Such problem can be solved by relying on the Deutsch-Jozsa algorithm. The proposed method, relying on the use of modular values, provides a high number of degrees of freedom for optimizing the new algorithm inspired from the Deutsch-Jozsa one. In particular, we explore meticulously the choices of the pre- and post-selected states. We eventually test the novel theoretical algorithm on a quantum computing platform. While the outcomes are currently not on par with the conventional approach, they nevertheless shed light on potential for future improvements, especially with less-optimized algorithms. We are thus confidend that the proposed proof of concept could prove its validity in bridging quantum algorithms and modular values research fields.

arXiv:2406.06803•Jun 10, 2024•0 citations
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.
We present a generalized Deutsch-Jozsa (DJ) quantum algorithm that not only determines both the global type of an unknown Boolean function (constant or balanced) but also determines explicit output values of the function in a single oracle query. Unlike the original DJ algorithm, which identifies only whether a function is constant or balanced, our generalization retrieves actual function output values at the same time with using a Bell state as ancilla. This makes a richer function characterization with minimal queries to have practical quantum advantages, e.g. data classification, logistic regression, and quantum cryptography.
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.
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.
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given function acting on a set of binary values is constant (uniformly yielding outputs of either all 0 or all 1), or balanced (a situation wherein half of the outputs are 0 and the other half are 1). Such problem can be solved by relying on the Deutsch-Jozsa algorithm. The proposed method, relying on the use of modular values, provides a high number of degrees of freedom for optimizing the new algorithm inspired from the Deutsch-Jozsa one. In particular, we explore meticulously the choices of the pre- and post-selected states. We eventually test the novel theoretical algorithm on a quantum computing platform. While the outcomes are currently not on par with the conventional approach, they nevertheless shed light on potential for future improvements, especially with less-optimized algorithms. We are thus confidend that the proposed proof of concept could prove its validity in bridging quantum algorithms and modular values research fields.