Computation in finitary stochastic and quantum processes
From MaRDI portal
(Redirected from Computation in finitary stochastic and quantum processes)
Abstract: We introduce stochastic and quantum finite-state transducers as computation-theoretic models of classical stochastic and quantum finitary processes. Formal process languages, representing the distribution over a process's behaviors, are recognized and generated by suitable specializations. We characterize and compare deterministic and nondeterministic versions, summarizing their relative computational power in a hierarchy of finitary process languages. Quantum finite-state transducers and generators are a first step toward a computation-theoretic analysis of individual, repeatedly measured quantum dynamical systems. They are explored via several physical systems, including an iterated beam splitter, an atom in a magnetic field, and atoms in an ion trap--a special case of which implements the Deutsch quantum algorithm. We show that these systems' behaviors, and so their information processing capacity, depends sensitively on the measurement protocol.
Recommendations
Cites work
- A logical calculus of the ideas immanent in nervous activity
- An Introduction to Symbolic Dynamics and Coding
- Analogies and differences between quantum and stochastic automata
- Asymptotic behaviour of quantum Markov processes
- Chaos in classical and quantum mechanics
- Defining quantum dynamical entropy
- Grammatical complexity of unimodal maps with eventually periodic kneading sequences
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1145843 (Why is no real title available?)
- scientific article; zbMATH DE number 1979532 (Why is no real title available?)
- scientific article; zbMATH DE number 2080922 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Information and computation: Classical and quantum aspects
- Intrinsic quantum computation
- Logical Reversibility of Computation
- On the Digraph of a Unitary Matrix
- Predictability, complexity, and learning
- Probabilistic automata
- Quantum automata and quantum grammars
- Quantum automata: an overview.
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum theory: concepts and methods
- Rapid solution of problems by quantum computation
- Regularities unseen, randomness observed: Levels of entropy convergence
- Subshifts of finite type and sofic systems
- The calculi of emergence: Computation, dynamics and induction
- Three models for the description of language
- Toward a quantitative theory of self-generated complexity
- Turbulent pattern bases for cellular automata
Cited in
(9)- Quantifying matrix product state
- Probabilistic process algebra to unifying quantum and classical computing in closed systems
- The `life machine': a quantum metaphor for living matter
- scientific article; zbMATH DE number 5989818 (Why is no real title available?)
- scientific article; zbMATH DE number 2080922 (Why is no real title available?)
- Nature computes: information processing in quantum dynamical systems
- Quantum theory in finite dimension cannot explain every general process with finite memory
- Hidden quantum Markov processes
- Braided finite automata and representation theory
This page was built for publication: Computation in finitary stochastic and quantum processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933429)
