Quaternionic quantum automata
From MaRDI portal
Recommendations
Cites work
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Characterization of sequential quantum machines
- Characterizations of quantum automata
- Determination of equivalence between quantum sequential machines
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 996724 (Why is no real title available?)
- scientific article; zbMATH DE number 1306885 (Why is no real title available?)
- scientific article; zbMATH DE number 2079870 (Why is no real title available?)
- Non-anti-Hermitian quaternionic quantum mechanics
- On a Possible Generalization of Quantum Mechanics
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Potential of quantum finite automata with exact acceptance
- Quantum automata and quantum grammars
- Quantum automata: an overview.
- Quantum complexity theory
- Quantum computers.
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quaternion algebras
- Quaternionic quantum dynamics on complex Hilbert spaces
- Quaternions for computer graphics
- State succinctness of two-way finite automata with quantum and classical states
- Succinctness of two-way probabilistic and quantum finite automata
- Superiority of exact quantum automata for promise problems
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- Two-way finite automata with quantum and classical states.
- Undecidability on quantum finite automata
This page was built for publication: Quaternionic quantum automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114652)