Pages that link to "Item:Q2353395"

The following pages link to On hybrid models of quantum finite automata (Q2353395):

Displaying 9 items.

• Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
• Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
• Application of distributed semi-quantum computing model in phase estimation (Q506164) (← links)
• Promise problems solved by quantum and classical finite automata (Q511009) (← links)
• Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
• Models in quantum computing: a systematic review (Q2687125) (← links)
• Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
• Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
• Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)