Pages that link to "Item:Q1853472"
From MaRDI portal
The following pages link to Two-way finite automata with quantum and classical states. (Q1853472):
Displayed 50 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Lower bounds on the size of semi-quantum finite automata (Q264532) (← links)
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application (Q439940) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- The complexity of debate checking (Q493647) (← 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)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Two-tape finite automata with quantum and classical states (Q539559) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- Exact results for accepting probabilities of quantum automata. (Q1401229) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- Characterizations of quantum automata (Q1884961) (← links)
- The elusive source of quantum speedup (Q1959173) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Affine automata verifiers (Q2152088) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Interference automata (Q2518378) (← links)
- New Results on the Minimum Amount of Useful Space (Q2814840) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- Algebraic Methods in Quantum Informatics (Q3522861) (← links)
- Computation in Sofic Quantum Dynamical Systems (Q3603417) (← links)
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY (Q3606557) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- Uncountable classical and quantum complexity classes (Q5223610) (← links)