# Questions tagged [deutsch-jozsa-algorithm]

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)

50 questions
Filter by
Sorted by
Tagged with
846 views

### Where is the parallelism in Deutsch-Jozsa algorithm?

I am newbie on Quantum Computing. Actually I am a software engineer but I want to understand how quantum computers work. So my question may be absurd. Sorry about that. I tried to understand Deutsch-...
52 views

### How to solve this Deutsch Jozsa variant?

You are given a function $f : \{0,1\}^n \to \{0,1\}$ and a quantum circuit, $C$, computing the signed implementation of $f$. Let $I_0$ be the input bit-strings of length $n$ where the first bit is $0$,...
54 views

### BQP and PH separation

I was reading the Quanta article here which shows that there exists a problem which achieves "oracle separation between BQP and PH". In simple terms, there exists a problem which a quantum ...
45 views

### Deutsch-Jozsa Misunderstanding

I fail to understand Deutsch-Jozsa algorithm. As wikipedia suggests: $f\colon \{0,1\}^{n}\rightarrow \{0,1\}$. The function takes n-digit binary values as input and produces either a 0 ...
49 views