From e394d6c45bcc1e5650bcbeff5a3246316f6842f0 Mon Sep 17 00:00:00 2001 From: Prefetch Date: Sat, 1 May 2021 17:23:45 +0200 Subject: Expand knowledge base --- .../deutsch-jozsa-circuit.png | Bin 18613 -> 19180 bytes .../know/concept/deutsch-jozsa-algorithm/index.pdc | 4 ++-- 2 files changed, 2 insertions(+), 2 deletions(-) (limited to 'content/know/concept/deutsch-jozsa-algorithm') diff --git a/content/know/concept/deutsch-jozsa-algorithm/deutsch-jozsa-circuit.png b/content/know/concept/deutsch-jozsa-algorithm/deutsch-jozsa-circuit.png index a43ae6a..70bdf3e 100644 Binary files a/content/know/concept/deutsch-jozsa-algorithm/deutsch-jozsa-circuit.png and b/content/know/concept/deutsch-jozsa-algorithm/deutsch-jozsa-circuit.png differ diff --git a/content/know/concept/deutsch-jozsa-algorithm/index.pdc b/content/know/concept/deutsch-jozsa-algorithm/index.pdc index a891dd1..a3acaf4 100644 --- a/content/know/concept/deutsch-jozsa-algorithm/index.pdc +++ b/content/know/concept/deutsch-jozsa-algorithm/index.pdc @@ -46,7 +46,7 @@ To do this, we use the following quantum circuit, where $U_f$ is the oracle we query: - + Due to unitarity constraints, @@ -147,7 +147,7 @@ other possibilities are assumed to be impossible. This algorithm is then implemented by the following quantum circuit: - + There are $N$ qubits in initial state $\ket{0}$, and one in $\ket{1}$. -- cgit v1.2.3