Superiority of exact quantum automata for promise problems (Q413305): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q45 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6030969 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
exact quantum computation | |||
| Property / zbMATH Keywords: exact quantum computation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
promise problems | |||
| Property / zbMATH Keywords: promise problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
succinctness | |||
| Property / zbMATH Keywords: succinctness / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
quantum finite automaton | |||
| Property / zbMATH Keywords: quantum finite automaton / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
classical finite automaton | |||
| Property / zbMATH Keywords: classical finite automaton / rank | |||
Normal rank | |||
Revision as of 20:03, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superiority of exact quantum automata for promise problems |
scientific article |
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
