A representative framework for implementing quantum finite automata on real devices

DOI10.1007/978-3-031-63742-1_12MaRDI QIDQ7013617zbMATH OpenFDO

Authors Aliya Khadieva, Özlem Salehi, Abuzer Yakaryılmaz

Publication date 12 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63742-1_12

zbMATH Keywords

circuit decompositionquantum automata implementationquantum finite automaton

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• 1-way quantum finite automata: strengths, weaknesses and generalizations
• Automata and quantum computing
• GAPs for Shallow Implementation of Quantum Finite Automata
• Improved constructions of quantum automata
• Quantum automata and quantum grammars
• Quantum online streaming algorithms with logarithmic memory
• Reordering method and hierarchies for quantum and classical ordered binary decision diagrams
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Very narrow quantum OBDDs and width hierarchies for classical OBDDs

This page was built for publication: A representative framework for implementing quantum finite automata on real devices

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