正在加载图片...
Case 2: Optimizing pointer bases to achieve maximal condition entropy Quantum discord ODA (PAB)=S(PA)+min Ep s(pBlia-S(PAB) If we select the pointer bases without min, otherwise with"max?"to conditional entropy i e. max Xpis(pBla) how situation will be Generally, the evolution of mutual information is slower than above choices however the evolution of quantum discord has not easy relation, that is, max"choice doesnt meaning the slower quantum discord evolutionCase 2: Optimizing pointer bases to achieve maximal condition entropy ( ) ( )   min ( ) ( ) A i A A AB A i B A AB i QD S p S i S      = + −  Quantum discord: If we select the pointer bases without “min”, otherwise, with “max” to conditional entropy ,i.e. ,how situation will be? Generally, the evolution of mutual information is slower than above choices, however the evolution of quantum discord has not easy relation, that is , “max” choice doesn’t meaning the slower quantum discord evolution.   max ( ) A i A i B A i p S i   
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有