Pages that link to "Item:Q1015813"
From MaRDI portal
The following pages link to An application of quantum finite automata to interactive proof systems (Q1015813):
Displaying 14 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- One-way reversible and quantum finite automata with advice (Q476173) (← links)
- Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Modeling of RNA secondary structures using two-way quantum finite automata (Q2201368) (← links)
- Constant-space quantum interactive proofs against multiple provers (Q2252642) (← 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)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- (Q4988166) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
