vault backup: 2026-07-30 18:51:09

This commit is contained in:
Benjamin Neumann
2026-07-30 18:51:09 +02:00
parent 1fd76ac637
commit a49e9361e6
3 changed files with 7 additions and 1 deletions
+1 -1
View File
@@ -216,6 +216,7 @@
},
"active": "25f5b25d5eca7203",
"lastOpenFiles": [
"SS2026/Quantum Computing/10. Discrete Fourier Transformation/Anhänge/Pasted image 20260730185053.png",
"SS2026/Quantum Computing/10. Discrete Fourier Transformation/Anhänge/Pasted image 20260730183145.png",
"SS2026/Quantum Computing/10. Discrete Fourier Transformation/Anhänge/Pasted image 20260730183136.png",
"SS2026/Quantum Computing/10. Discrete Fourier Transformation/Anhänge/Pasted image 20260730182117.png",
@@ -235,7 +236,6 @@
"SS2026/Quantum Computing/9. Bernstein-Vazirani/Anhänge",
"SS2026/Quantum Computing/8. Ket Notation/Ket Notation.md",
"SS2026/Quantum Computing/9. Bernstein-Vazirani",
"SS2026/Quantum Computing/8. Ket Notation/Anhänge/Pasted image 20260730103836.png",
"SS2026/Quantum Computing/7. Quantum Circuits/Quantum Circuits.md",
"SS2026/Quantum Computing/8. Ket Notation/Anhänge",
"SS2026/Quantum Computing/8. Ket Notation",
Binary file not shown.

After

Width:  |  Height:  |  Size: 28 KiB

@@ -18,3 +18,9 @@ For this we only look at N = $2^n$, DFT applied on n qubits.
Let us look at an example DFT for n = 3:
![[Pasted image 20260730183136.png]]
![[Pasted image 20260730183145.png]]
The more general approach works as follows:
![[Pasted image 20260730185053.png]]