A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921)
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: A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY |
scientific article; zbMATH DE number 7333592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY |
scientific article; zbMATH DE number 7333592 |
Statements
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (English)
0 references
15 April 2021
0 references
quantum computing
0 references
quantum function
0 references
quantum Turing machine
0 references
quantum circuit
0 references
schematic definition
0 references
descriptional complexity
0 references
polynomial-time computability
0 references
normal form theorem
0 references
0 references
0 references
0.8850511
0 references
0.8831429
0 references
0.87912726
0 references
0.87650126
0 references
0.8746801
0 references
0.87430435
0 references
0.8722158
0 references
0.87061995
0 references
0.86575276
0 references
