Computing power of Turing machines in the framework of unsharp quantum logic
From MaRDI portal
Publication:496026
DOI10.1016/j.tcs.2014.12.015zbMath1329.68114MaRDI QIDQ496026
Xian Lu, Yun Shang, Ru-qian Lu
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.015
03G12: Quantum logic
03D10: Turing machines and related notions
68Q12: Quantum algorithms and complexity in the theory of computing
Cites Work
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- Effect algebras and unsharp quantum logics.
- Automata theory based on quantum logic: Some characterizations
- Quantum MV-algebras and commutativity
- Lattices of quantum automata
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Quantum automata and quantum grammars
- Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras
- Automata theory based on quantum logic. I
- Reasoning in quantum theory. Sharp and unsharp quantum logics.
- Quantum MV algebras
- Notes on automata theory based on quantum logic
- Automata theory based on quantum logic: reversibilities and pushdown automata
- A theory of computation based on quantum logic. I
- Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition
- Algebraic Analysis of Many Valued Logics
- Automata theory based on unsharp quantum logic
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Lattice Automata
- Classically controlled quantum computation
- Automata theory based on quantum logic. II.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item