Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016)
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: Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions |
scientific article; zbMATH DE number 7951657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions |
scientific article; zbMATH DE number 7951657 |
Statements
Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (English)
0 references
29 November 2024
0 references
recursion schematic definition
0 references
quantum Turing machine
0 references
fast quantum recursion
0 references
quanum polylogarithmic-time computability
0 references
divide-and-conquer strategy
0 references
0 references
