vault backup: 2026-08-05 11:02:04

.obsidian/workspace.json

@@ -218,6 +218,7 @@
   },
   "active": "25f5b25d5eca7203",
   "lastOpenFiles": [
+    "SS2026/Quantum Computing/12. Grover's Algorithm/Anhänge/Pasted image 20260805110129.png",
     "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",
@@ -234,7 +235,6 @@
     "SS2026/Quantum Computing/11. Shor's Algorithm/Anhänge/Pasted image 20260730202055.png",
     "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",
     "SS2026/Quantum Computing/Anhänge/Introduction-to-Quantum-Computing.pdf",
     "SS2026/Quantum Computing/10. Discrete Fourier Transformation/Discrete Fourier Transformation.md",

SS2026/Quantum Computing/12. Grover's Algorithm/Grover's Algorithm.md

@@ -34,3 +34,8 @@ Now we define the unitary FLIP$_*$:
 
 ### The search algorithm:
 
+![[Pasted image 20260805110129.png]]
+
+The algorithm works as follows:
+1. $\ket{0}$ on every qubit.
+2.