Spatial multiplexing: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Jamessungjin.kim
 
en>Nikkimaria
dl
 
Line 1: Line 1:
Greetings. Allow me start by telling you the writer's name - Phebe. Hiring has been my profession for some time but I've already applied for an additional 1. My family lives in Minnesota and my family members enjoys it. Doing ceramics is what her family and her appreciate.<br><br>Also visit my web site - [http://Lankaclipstv.com/blog/165665 Lankaclipstv.com]
{{multiple issues|
{{Unreferenced|date=July 2009}}
{{Notability|date=August 2009}}
}}
 
In [[mathematics]], the '''quantum Markov chain''' is a reformulation of the ideas of a classical [[Markov chain]], replacing the classical definitions of probability with [[quantum probability]]. Very roughly, the theory of a quantum Markov chain resembles that of a [[Quantum_finite_automaton#Measure-many_automata|measure-many automata]], with some important substitutions: the initial state is to be replaced by a [[density matrix]], and the projection operators are to be replaced by [[POVM|positive operator valued measures]].
 
More precisely, a quantum Markov chain is a pair <math>(E,\rho)</math> with <math>\rho</math> a [[density matrix]] and <math>E</math> a [[quantum channel]] such that
 
:<math>E:\mathcal{B}\otimes\mathcal{B}\to\mathcal{B}</math>
 
is a [[completely positive trace-preserving]] map, and <math>\mathcal{B}</math> a [[C-star algebra|C<sup>*</sup>-algebra]] of bounded operators. The pair must obey the quantum Markov condition, that
:<math>\operatorname{Tr} \rho (b_1\otimes b_2) = \operatorname{Tr} \rho E(b_1, b_2)</math>
 
for all <math>b_1,b_2\in \mathcal{B}</math>.
 
{{DEFAULTSORT:Quantum Markov Chain}}
[[Category:Exotic probabilities]]
[[Category:Quantum information science]]
[[Category:Markov models]]

Latest revision as of 17:00, 25 September 2013

Template:Multiple issues

In mathematics, the quantum Markov chain is a reformulation of the ideas of a classical Markov chain, replacing the classical definitions of probability with quantum probability. Very roughly, the theory of a quantum Markov chain resembles that of a measure-many automata, with some important substitutions: the initial state is to be replaced by a density matrix, and the projection operators are to be replaced by positive operator valued measures.

More precisely, a quantum Markov chain is a pair (E,ρ) with ρ a density matrix and E a quantum channel such that

E:

is a completely positive trace-preserving map, and a C*-algebra of bounded operators. The pair must obey the quantum Markov condition, that

Trρ(b1b2)=TrρE(b1,b2)

for all b1,b2.