Quantum complexity theory
Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
- Comment
- enQuantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
- Depiction
- Has abstract
- enQuantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
- Hypernym
- Part
- Is primary topic of
- Quantum complexity theory
- Label
- enQuantum complexity theory
- Link from a Wikipage to an external page
- link.springer.com/referencework/10.1007/978-0-387-30440-3
- archive.org/details/computationalcom00aror
- ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-845-quantum-complexity-theory-fall-2010/
- archive.org/details/computationalcom00aror/page/n226
- Link from a Wikipage to another Wikipage
- Adjacency list
- Adjacency matrix
- Asymptotic notation
- Asymptotic optimality
- Big O notation
- Black box
- Bounded-error probabilistic polynomial
- BPP (complexity)
- BQP
- Bra–ket notation
- Category:Computational complexity theory
- Category:Quantum complexity theory
- Category:Theoretical computer science
- Church–Turing thesis
- Complexity class
- Complexity classes
- Computational complexity theory
- Computational model
- Computational problem
- Connectivity (graph theory)
- Deterministic algorithm
- Directed graph
- Discrete logarithm problem
- Euclidean vector
- File:BQP complexity class diagram.svg
- Grover's algorithm
- Integer factorization
- Linear combination
- Linear search
- Logic gate
- Minimum spanning tree
- NP (complexity)
- NP-complete
- NP-hard
- Oracle machine
- P (complexity)
- Polynomial hierarchy
- Polynomial time
- Polynomial-time algorithm
- PP (complexity)
- Probabilistic Turing machine
- PSPACE
- PSPACE (complexity)
- QMA
- Quantum circuit
- Quantum computer
- Quantum computers
- Quantum computing
- Quantum mechanics
- Quantum Turing machine
- Scott Aaronson
- Sharp-P
- Shortest path problem
- Spanning tree
- Sparse matrix
- Strongly connected component
- Turing machine
- Other
- enyes
- Quantum
- enyes
- SameAs
- 4tkdz
- m.080cql7
- Q7269023
- Quantum complexity theory
- Teoría de la complejidad cuántica
- Теория квантовой сложности
- نظریه پیچیدگی کوانتومی
- 量子复杂性理论
- SeeAlso
- Computational complexity
- Subject
- Category:Computational complexity theory
- Category:Quantum complexity theory
- Category:Theoretical computer science
- Thumbnail
- WasDerivedFrom
- Quantum complexity theory?oldid=1101079412&ns=0
- WikiPageLength
- 25302
- Wikipage page ID
- 24092190
- Wikipage revision ID
- 1101079412
- WikiPageUsesTemplate
- Template:=
- Template:Cite arXiv
- Template:Cite book
- Template:Diagonal split header
- Template:Emerging technologies
- Template:Main
- Template:More footnotes
- Template:No
- Template:Quantum computing
- Template:Quantum mechanics topics
- Template:Reflist
- Template:See also
- Template:Short description
- Template:Tmath
- Template:Use American English
- Template:Yes
