Pages that link to "Item:Q2343133"
From MaRDI portal
The following pages link to Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133):
Displaying 16 items.
- 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)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- On the power of quantum, one round, two prover interactive proof systems (Q2467210) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Generalized quantum Arthur-Merlin games (Q4601844) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- Debates with small transparent quantum verifiers (Q5890816) (← links)
- Classically time-controlled quantum automata (Q6049068) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
