Analogies and differences between quantum and stochastic automata
From MaRDI portal
Publication:5958112
DOI10.1016/S0304-3975(00)00154-7zbMath0983.68094MaRDI QIDQ5958112
Alberto Bertoni, Marco Carpentieri
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
Related Items
Preface, Unbounded-error quantum computation with small space bounds, Computation in finitary stochastic and quantum processes, Regular languages accepted by quantum automata, Automata theory based on quantum logic: reversibilities and pushdown automata, Quantum automata and algebraic groups, Determination of equivalence between quantum sequential machines, Determining the equivalence for one-way quantum finite automata, Languages Recognized with Unbounded Error by Quantum Finite Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum mechanical Hamiltonian models of Turing machines
- An introduction to Hilbert space and quantum logic
- Quantum computational networks
- Quantum Computation
- On the definition of a family of automata
- Rapid solution of problems by quantum computation
- A method for obtaining digital signatures and public-key cryptosystems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- Oracle Quantum Computing
- Realizable Universal Quantum Logic Gates
- Probabilistic automata
- Logical Reversibility of Computation
