Pages that link to "Item:Q5858921"

The following pages link to A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921):

Displaying 2 items.

• Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) (Q2152096) (← links)
• Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016) (← links)