Skip to main content
The 2026 Annual Developer Survey is live— take the Survey today!.

Questions tagged [deutsch-jozsa-algorithm]

Ask Question

The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992. Although of little practical use, it is one of the first examples of a quantum algorithm that is exponentially faster than any possible deterministic classical algorithm. It is also a deterministic algorithm, meaning that it always produces an answer, and that answer is always correct. (Wikipedia)

114 questions
Newest Active Bountied Unanswered
2 votes
2 answers
54 views

I'm learning Deutsch's algorithm and I want to check whether I'm understanding the query complexity claim correctly. The standard story I keep seeing is: Deutsch's problem needs 2 queries classically ...
0 votes
0 answers
49 views

I've been exploring my idea Of using Hadamard then applying f(1)=1 always. Combined with unknown function. And then Hadamard again as output. Formaly: Suppose I have a classical Boolean function f: {0,...
0 votes
1 answer
90 views

I am studying Deutsch-Josza Algorithm. Here's what I get for 2-qubit case. $$ \begin{aligned} |\psi_0\rangle &= |0\rangle\otimes |0\rangle \\ |\psi_1\rangle & = H|0\rangle \otimes H|0\rangle \\...
1 vote
1 answer
163 views

I am learning Q# and am trying to create Deutsch's algorithm. My code seems to have an issue since I'm still learning. The code recognizes that line 3 contains an error. Can someone tell me what I am ...
1 vote
2 answers
295 views

Deutsch-Josza algorithm, as a demonstration of the parallel computing power of quantum computing, calculates in one operation both values of a $(0,1) \mapsto (0,1)$ function $f(x)$. But it only ...
0 votes
1 answer
126 views

I am new to quantum computing and Python. I tried to make a quantum simulation with qiskit, but I have some import issues that I can't solve, and I decided to ask it here. I tried to import ...
2 votes
2 answers
154 views

I'm trying to conceptualise how one would implement an oracle function of f(x) = x in the context of the Deutsch-Josza Algorithm. So far I understand the basic idea of implementing trivial constant ...
0 votes
1 answer
83 views

I don't understand, why the X-Gate represents a constant function. It flips 0 to 1 and 1 to 0, which represents a balanced function. I don't understand this explanation from my professor:
-1 votes
1 answer
185 views

This seems to me a fine quantum oracle for the balanced one bit function $f(x)=x$, but putting it in Deutsch's algorithm circuit will give the result $|0\rangle$, i.e. the function is evaluated as ...
3 votes
3 answers
305 views

The general formula for Hadamard Gate $H$, is $$H|x\rangle = \Sigma_z(-1)^{xz}|z\rangle/\sqrt{2}\tag{1}\label{1}$$ for n gates in parallel $$H^{\otimes n}|x\rangle = \Sigma_z(-1)^{x.z}|z\rangle/\sqrt{...
3 votes
0 answers
78 views

I am wondering whether anyone has investigated if there is a notion of a continuous oracle. My starting off point is to consider the Deutsch-Josza problem, in which the oracle acts on the state in a ...
0 votes
1 answer
218 views

In the quantum computation circuit for the Deutsch-Jozsa algorithm, it is said that $U_f$ oracle will affect certain specific operations on the qubits using $f(x)$ and finally will give the answer in ...
3 votes
2 answers
214 views

The Deustch algorithm use an oracle, the quantum gate $U_f$ The first question is can we count the complexity of $U_f$ as one if it is used once. I mean since one computation of $U_f$ can't be ...
1 vote
0 answers
77 views

I was wondering if anyone could help me with this question, I'm kind of new to quantum computing in general. I understand the Deutsch Josza Algorithm, but I'm not really sure where to even begin with ...
1 vote
2 answers
272 views

I have some doubts about the phase kickback trick when used in some algorithm. Consider a quantum system with two qubits, and suppose we have a boolean oracle $U_f$. We know that if we put the second ...

15 30 50 per page
1
2 3 4 5
…
8