Computation in Finitary Stochastic and Quantum Processes

Simple item page
dc.creatorWiesner, Karoline
dc.creatorCrutchfield, James P.
dc.date2006-08-27
dc.date2008-04-28
dc.date.accessioned2026-07-07T09:35:41Z
dc.date.available2026-07-07T09:35:41Z
dc.descriptionWe 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.
dc.description25 pages, 16 figures, 1 table; http://cse.ucdavis.edu/~cmg; numerous corrections and updates
dc.identifierhttps://arxiv.org/abs/quant-ph/0608206
dc.identifierhttp://arxiv.org/abs/quant-ph/0608206
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159911
dc.subjectQuantum Physics
dc.titleComputation in Finitary Stochastic and Quantum Processes
dc.typetext

Files

Collections

arXiv