The following pages link to (Q4536348):
Displaying 16 items.
- Size lower bounds for quantum automata (Q403023) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns (Q488191) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Improved constructions of quantum automata (Q1017403) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- One-way probabilistic reversible and quantum one-counter automata. (Q1853577) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Dense quantum coding and a lower bound for 1-way quantum automata (Q2819570) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- Lower Bounds for Generalized Quantum Finite Automata (Q3540128) (← links)
- (Q4448361) (← links)