Regular languages accepted by quantum automata
type: Item
instance of: scholarly article
title: Regular languages accepted by quantum automata
zbMATH Open document ID: 1003.68061
author: M. Carpentieri
author: Alberto Bertoni
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 1853164
MaRDI profile type: Publication
OpenAlex ID: W2053216403
cites work: Quantum mechanical Hamiltonian models of Turing machines
cites work: Logical Reversibility of Computation
cites work: Quantum complexity theory
cites work: Q3994777
cites work: Analogies and differences between quantum and stochastic automata
cites work: Characterizations of 1-Way Quantum Finite Automata
cites work: An introduction to Hilbert space and quantum logic
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Quantum computational networks
cites work: Rapid solution of problems by quantum computation
cites work: Quantum Computation
cites work: Q5614773
cites work: Q5592246
cites work: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
cites work: Q5643915
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Realizable Universal Quantum Logic Gates
DOI: 10.1006/INCO.2000.2911
description: scientific article; zbMATH DE number 1853164