PostBQP (Q7233606)
Jump to navigation
Jump to search
complexity class of decision problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PostBQP |
complexity class of decision problems solvable in polynomial time on a quantum Turing machine with postselection and bounded error |
Statements
Identifiers
Sitelinks
Wikipedia(3 entries)
- cawiki PostBQP (Complexitat)
- enwiki PostBQP
- ptwiki PostBQP