The class of languages recognizable by 1-way quantum finite automata is not closed under union
Maris Valdats
Abstract
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.
Create a lesson
Related papers
Generative learning of time series with holographic quantum circuit sampling
Bingzhi Zhang, Matthew W. Lee, Tom Finke et al.
Entanglement detection in dynamical quantum systems
Xingjian Zhang, Jiayi Wu, Jue Xu et al.
Partial-coherence weak measurement of polarization qubits with a temporal pointer: theory and experiment
Shane P. Gervais, Lambert Giner
A complete classification of operator controllability for closed three-level quantum systems driven by a single control
Sergey Kuznetsov, Alexander Pechen
Entanglement generation from degeneracy breaking of superradiant Liouvillian steady states by local operations
Adam Burgess, Erik M. Gauger
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour