vault backup: 2026-08-05 10:47:03
This commit is contained in:
Vendored
+2
-2
@@ -218,6 +218,8 @@
|
||||
},
|
||||
"active": "25f5b25d5eca7203",
|
||||
"lastOpenFiles": [
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805103706.png",
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805103650.png",
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805102717.png",
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805102659.png",
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805102605.png",
|
||||
@@ -233,8 +235,6 @@
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730202048.png",
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730202021.png",
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730202008.png",
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730201944.png",
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730201734.png",
|
||||
"SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge",
|
||||
"SS2026/Quantum Computing/Anhänge/Introduction-to-Quantum-Computing.pdf",
|
||||
"SS2026/Quantum Computing/10. Discrete Fourier Transformation/Discrete Fourier Transformation.md",
|
||||
|
||||
BIN
Binary file not shown.
|
After Width: | Height: | Size: 3.4 KiB |
BIN
Binary file not shown.
|
After Width: | Height: | Size: 5.1 KiB |
@@ -26,4 +26,11 @@ This is implemented via this circuit:
|
||||
|
||||
Z is a Pauli matrix and the empty circles denote negative control wires.
|
||||
So Z is only applied if all other wires are $\ket{0}$
|
||||
Now we define the unitary FLIP$_*$:
|
||||
|
||||
![[Pasted image 20260805103650.png]]
|
||||
|
||||
![[Pasted image 20260805103706.png]]
|
||||
|
||||
### The search algorithm:
|
||||
|
||||
|
||||
Reference in New Issue
Block a user