The following pages link to ANALYSIS OF QUANTUM FUNCTIONS (Q5696940):
Displaying 7 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- (Q4988166) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016) (← links)
