Decomposition of quantum Markov chains and its applications

被引:13
|
作者
Guan, Ji [1 ]
Feng, Yuan [1 ]
Ying, Mingsheng [1 ,2 ,3 ]
机构
[1] Univ Technol Sydney, Ctr Quantum Software & Informat, Sydney, NSW 2007, Australia
[2] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China
[3] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
基金
澳大利亚研究理事会;
关键词
Quantum Markov chains; Irreducibility; Periodicity; Limiting states; Noiseless subsystems; STATIONARY STATES; WALKS;
D O I
10.1016/j.jcss.2018.01.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Markov chains have been widely employed as a fundamental model in the studies of probabilistic and stochastic communicating and concurrent systems. It is well-understood that decomposition techniques play a key role in reachability analysis and model-checking of Markov chains. (Discrete-time) quantum Markov chains have been introduced as a model of quantum communicating systems [1] and also a semantic model of quantum programs [2]. The BSCC (Bottom Strongly Connected Component) and stationary coherence decompositions of quantum Markov chains were introduced in [3-5]. This paper presents a new decomposition technique, namely periodic decomposition, for quantum Markov chains. We further establish a limit theorem for them. As an application, an algorithm to find a maximum dimensional noiseless subsystem of a quantum communicating system is given using decomposition techniques of quantum Markov chains. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:55 / 68
页数:14
相关论文
共 50 条