Computation in finitary stochastic and quantum processes
From MaRDI portal
Publication:933429
DOI10.1016/j.physd.2008.01.021zbMath1140.68401arXivquant-ph/0608206WikidataQ61152857 ScholiaQ61152857MaRDI QIDQ933429
James P. Crutchfield, Karoline Wiesner
Publication date: 21 July 2008
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0608206
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
60G99: Stochastic processes
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intrinsic quantum computation
- Toward a quantitative theory of self-generated complexity
- Chaos in classical and quantum mechanics
- Turbulent pattern bases for cellular automata
- Defining quantum dynamical entropy
- Quantum automata and quantum grammars
- The calculi of emergence: Computation, dynamics and induction
- Subshifts of finite type and sofic systems
- Quantum automata: an overview.
- Predictability, Complexity, and Learning
- Information and computation: Classical and quantum aspects
- Computation in Sofic Quantum Dynamical Systems
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Grammatical complexity of unimodal maps with eventually periodic kneading sequences
- On the Digraph of a Unitary Matrix
- An Introduction to Symbolic Dynamics and Coding
- Three models for the description of language
- Probabilistic automata
- Logical Reversibility of Computation
- Regularities unseen, randomness observed: Levels of entropy convergence
- A logical calculus of the ideas immanent in nervous activity
- Quantum theory: concepts and methods
- Analogies and differences between quantum and stochastic automata
