A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921)
From MaRDI portal
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
