Superiority of exact quantum automata for promise problems (Q413305)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Superiority of exact quantum automata for promise problems |
scientific article; zbMATH DE number 6030969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superiority of exact quantum automata for promise problems |
scientific article; zbMATH DE number 6030969 |
Statements
Superiority of exact quantum automata for promise problems (English)
0 references
4 May 2012
0 references
computational complexity
0 references
exact quantum computation
0 references
promise problems
0 references
succinctness
0 references
quantum finite automaton
0 references
classical finite automaton
0 references
0.9207809
0 references
0.91247255
0 references
0.90851235
0 references
0.8921378
0 references
0.8921378
0 references
0.8861257
0 references
0.8750186
0 references
0.87497926
0 references
