A note on quantum sequential machines
type: Item
instance of: scholarly article
title: A note on quantum sequential machines
zbMATH Open document ID: 1172.68019
author: Lvzhou Li
author: Daowen Qiu
published in: Theoretical Computer Science
publication date: 2009-07-10T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5577395
zbMATH Keywords: quantum computing
zbMATH Keywords: stochastic sequential machines
zbMATH Keywords: quantum sequential machines
zbMATH Keywords: quantum finite automata
zbMATH Keywords: equivalence
MaRDI profile type: Publication
Wikidata QID: Q62049428
full work available at URL: j.tcs.2008.08.026
OpenAlex ID: W2072745801
cites work: Undecidability on quantum finite automata
cites work: Dense quantum coding and quantum finite automata
cites work: Regular languages accepted by quantum automata
cites work: Characterizations of 1-Way Quantum Finite Automata
cites work: Decidable and Undecidable Problems about Quantum Automata
cites work: Quantum Complexity Theory
cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Quantum computational networks
cites work: Q3849175
cites work: Q4228473
cites work: Quantum computers.
cites work: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
cites work: Q4474095
cites work: Determination of equivalence between quantum sequential machines
cites work: Determining the equivalence for one-way quantum finite automata
cites work: Quantum automata and quantum grammars
cites work: Q5643915
cites work: Characterization of sequential quantum machines
cites work: Probabilistic automata
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
cites work: Q4864428
DOI: 10.1016/J.TCS.2008.08.026
description: scientific article; zbMATH DE number 5577395