Computing power of Turing machines in the framework of unsharp quantum logic

DOI10.1016/J.TCS.2014.12.015MaRDI QIDQ496026zbMATH OpenOpenAlexFDO

Authors Yun Shang, Xian Lu, Ruqian 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

zbMATH Keywords

computational powerTuring machinesunsharp quantum logic

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum logic (03G12) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 7339588
• A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• An unsharp logic from quantum computation
• Automata theory based on unsharp quantum logic

Cites work

• scientific article; zbMATH DE number 1688754 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1930741 (Why is no real title available?)
• scientific article; zbMATH DE number 3804225 (Why is no real title available?)
• scientific article; zbMATH DE number 2206366 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A theory of computation based on quantum logic. I
• A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
• Algebraic Analysis of Many Valued Logics
• Automata theory based on quantum logic. I
• Automata theory based on quantum logic. II.
• Automata theory based on quantum logic: Some characterizations
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Automata theory based on unsharp quantum logic
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• Classically controlled quantum computation
• Effect algebras and unsharp quantum logics.
• Generalization of blocks for \(D\)-lattices and lattice-ordered effect algebras
• Lattice Automata
• Lattices of quantum automata
• Notes on automata theory based on quantum logic
• Partial observation of quantum Turing machines and a weaker well-formedness condition
• Quantum Complexity Theory
• Quantum MV algebras
• Quantum MV-algebras and commutativity
• Quantum automata and quantum grammars
• Quantum finite automata
• Quantum logic and automata theory
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Reasoning in quantum theory. Sharp and unsharp quantum logics.

Cited in

(3)

• scientific article; zbMATH DE number 7339588 (Why is no real title available?)
• scientific article; zbMATH DE number 7228448 (Why is no real title available?)
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability

This page was built for publication: Computing power of Turing machines in the framework of unsharp quantum logic

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