Two-Way Quantum and Classical Automata with Advice for Online Minimization Problems

DOI10.1007/978-3-030-54997-8_27MaRDI QIDQ6485504zbMATH OpenFDO

Authors Kamil Khadiev, Aliya Khadieva

Publication date 7 December 2022

Published in 1509.68134 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-54997-8_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27) Quantum computation (81P68)

Recommendations

• On the complexity of minimizing probabilistic and quantum automata
• Quantum online algorithms with respect to space and advice complexity
• State succinctness of two-way finite automata with quantum and classical states
• Succinctness of two-way probabilistic and quantum finite automata
• Two-way finite automata with quantum and classical states.
• Two-tape finite automata with quantum and classical states

Cited in

(5)

• Two-way and one-way quantum and classical automata with advice for online minimization problems
• Quantum online streaming algorithms with logarithmic memory
• Time efficient implementation for online k-server problem on trees
• Quantum online algorithms with respect to space and advice complexity
• Implementation of quantum Fourier transform and quantum hashing for quantum devices with arbitrary qubit connectivity graphs

This page was built for publication: Two-Way Quantum and Classical Automata with Advice for Online Minimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485504)