Decomposition of quantum Markov chains and its applications

Guan, J; Feng, Y; Ying, M

Decomposition of quantum Markov chains and its applications

Guan, J

Feng, Y

Ying, M

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computer and System Sciences, 2018, 95 pp. 55 - 68
Issue Date:: 2018-08-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (267.02 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Guan, J https://orcid.org/0000-0002-3490-0029	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.available	2020-08-01T19:04:33Z
dc.date.issued	2018-08-01	en_US
dc.identifier.citation	Journal of Computer and System Sciences, 2018, 95 pp. 55 - 68	en_US
dc.identifier.issn	0022-0000	en_US
dc.identifier.uri	http://hdl.handle.net/10453/131366
dc.description.abstract	© 2018 Elsevier Inc. 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP180100691
dc.relation.ispartof	Journal of Computer and System Sciences	en_US
dc.relation.isbasedon	10.1016/j.jcss.2018.01.005	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Decomposition of quantum Markov chains and its applications	en_US
dc.type	Journal Article
utslib.citation.volume	95	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0806 Information Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
pubs.organisational-group	/University of Technology Sydney/Students
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US
pubs.volume	95	en_US

Abstract:

© 2018 Elsevier Inc. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/131366