vault backup: 2026-08-06 20:31:26
@@ -4,39 +4,17 @@
|
||||
"type": "split",
|
||||
"children": [
|
||||
{
|
||||
"id": "fd9f21d5268b584f",
|
||||
"id": "df9e53798dda0491",
|
||||
"type": "tabs",
|
||||
"children": [
|
||||
{
|
||||
"id": "25f5b25d5eca7203",
|
||||
"id": "7044dbc4e64a95f3",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "markdown",
|
||||
"state": {
|
||||
"file": "SS2026/Quantum Computing/19. Quantum Complexity/Quantum Complexity.md",
|
||||
"mode": "source",
|
||||
"source": false
|
||||
},
|
||||
"type": "empty",
|
||||
"state": {},
|
||||
"icon": "lucide-file",
|
||||
"title": "Quantum Complexity"
|
||||
}
|
||||
}
|
||||
]
|
||||
},
|
||||
{
|
||||
"id": "321a27ba88bc7ef2",
|
||||
"type": "tabs",
|
||||
"children": [
|
||||
{
|
||||
"id": "644429833dab1cca",
|
||||
"type": "leaf",
|
||||
"state": {
|
||||
"type": "pdf",
|
||||
"state": {
|
||||
"file": "SS2026/Quantum Computing/Anhänge/Introduction-to-Quantum-Computing.pdf"
|
||||
},
|
||||
"icon": "lucide-file-text",
|
||||
"title": "Introduction-to-Quantum-Computing"
|
||||
"title": "Neuer Tab"
|
||||
}
|
||||
}
|
||||
]
|
||||
@@ -216,25 +194,26 @@
|
||||
"obsidian-git:Open Git source control": false
|
||||
}
|
||||
},
|
||||
"active": "25f5b25d5eca7203",
|
||||
"active": "edfc392d0dca0b06",
|
||||
"lastOpenFiles": [
|
||||
"SS2026/Quantum Computing/Introduction to Quantum Computing.md",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Quantum Complexity.md",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806203055.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806203005.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202829.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202822.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202815.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202805.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202735.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202558.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge/Pasted image 20260806202511.png",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity/Anhänge",
|
||||
"SS2026/Quantum Computing/Introduction to Quantum Computing.md",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Fault-Tolerant Computation.md",
|
||||
"SS2026/Quantum Computing/19. Quantum Complexity",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806140650.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806140639.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806140629.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806140514.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806140451.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806135610.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge/Pasted image 20260806135601.png",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation/Anhänge",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction/Quantum Error Correction.md",
|
||||
"SS2026/Quantum Computing/18. Fault-torerant computation",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction/Anhänge/Pasted image 20260806113212.png",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction/Anhänge/Pasted image 20260806113154.png",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction/Anhänge/Pasted image 20260806113147.png",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction/Anhänge",
|
||||
"SS2026/Quantum Computing/16. Universal set of gates/Universal Set of Gates.md",
|
||||
"SS2026/Quantum Computing/17. Quantum Error Correction",
|
||||
@@ -244,7 +223,6 @@
|
||||
"SS2026/Quantum Computing/15. Ion-based/Anhänge",
|
||||
"SS2026/Quantum Computing/14. Quantum Computer/From Quantum Physics to Quantum Computers.md",
|
||||
"SS2026/Quantum Computing/15. Ion-based",
|
||||
"SS2026/Quantum Computing/14. Quantum Computer/Anhänge",
|
||||
"SS2026/Quantum Computing/13. Quantum Physics/Quantum Physics.md",
|
||||
"SS2026/Quantum Computing/12. Grover's Algorithm/Grover's Algorithm.md",
|
||||
"SS2026/Klausurplan.canvas",
|
||||
@@ -263,7 +241,6 @@
|
||||
"SS2026/Datenbanken und Informationssysteme/Datenbanken und Informationssysteme.md",
|
||||
"SS2026/Datenbanken und Informationssysteme/5. Relationale Anfragebearbeitung/Relationale Anfragebearbeitung.md",
|
||||
"SS2026/Datenbanken und Informationssysteme/9. RDF und Semantic Web/Resource Description Framework und Wissensgraphen.md",
|
||||
"SS2026/Datenbanken und Informationssysteme/6. Relationale Entwurfstheorie/Relationale Entwurfstheorie.md",
|
||||
"SS2026/Datenbanken und Informationssysteme/7. Transaktionsverwaltung/Transaktionsverwaltung.md"
|
||||
"SS2026/Datenbanken und Informationssysteme/6. Relationale Entwurfstheorie/Relationale Entwurfstheorie.md"
|
||||
]
|
||||
}
|
||||
|
After Width: | Height: | Size: 13 KiB |
|
After Width: | Height: | Size: 12 KiB |
|
After Width: | Height: | Size: 55 KiB |
|
After Width: | Height: | Size: 38 KiB |
|
After Width: | Height: | Size: 41 KiB |
|
After Width: | Height: | Size: 61 KiB |
|
After Width: | Height: | Size: 27 KiB |
|
After Width: | Height: | Size: 14 KiB |
|
After Width: | Height: | Size: 31 KiB |
@@ -0,0 +1,29 @@
|
||||
We start with the common class NP (Non-deterministic polynomial time)
|
||||
|
||||
![[Pasted image 20260806202511.png]]
|
||||
*Some details omitted
|
||||
|
||||
![[Pasted image 20260806202558.png]]
|
||||
|
||||
Question: can quantum computers solve SAT in polynomial time? (and by that, all problems in NP?)
|
||||
|
||||
|
||||
## Oracle lower bound
|
||||
|
||||
![[Pasted image 20260806202735.png]]
|
||||
|
||||
![[Pasted image 20260806202805.png]]
|
||||
![[Pasted image 20260806202815.png]]
|
||||
![[Pasted image 20260806202822.png]]![[Pasted image 20260806202829.png]]
|
||||
|
||||
## Quantum Merlin Arthur
|
||||
|
||||
Is there a "quantum NP"?
|
||||
|
||||
We define the class QMA (Quantum Merlin Arthur):
|
||||
|
||||
![[Pasted image 20260806203005.png]]
|
||||
|
||||
Example of a QMA Problem: Local Hamiltonian Problem
|
||||
|
||||
![[Pasted image 20260806203055.png]]
|
||||