Pages that link to "Item:Q5858921"
From MaRDI portal
The following pages link to A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921):
Displayed 3 items.
- Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
- A programming language characterizing quantum polynomial time (Q6091186) (← links)
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability (Q6102995) (← links)