Reachability probabilities of quantum Markov chains

Ying, S; Feng, Y; Yu, N; Ying, M

Reachability probabilities of quantum Markov chains

Ying, S Feng, Y

Yu, N

Ying, M

Permalink

Publication Type:: Conference Proceeding
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8052 LNCS pp. 334 - 348
Issue Date:: 2013-08-28

Closed Access

	Filename	Description	Size
	2013002063OK.pdf		281.14 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Ying, S	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.contributor.author	Yu, N https://orcid.org/0000-0003-1188-3032	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2013-08-28	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8052 LNCS pp. 334 - 348	en_US
dc.identifier.isbn	9783642401831	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/32422
dc.identifier.uri	http://hdl.handle.net/10453/27154
dc.description.abstract	This paper studies three kinds of long-term behaviour, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed. © 2013 Springer-Verlag.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP110103473
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-642-40184-8_24	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Reachability probabilities of quantum Markov chains	en_US
dc.type	Conference Proceeding
utslib.citation.volume	8052 LNCS	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
dc.location.activity	University of Buenos Aires, Argentina	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
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	8052 LNCS	en_US

Abstract:

This paper studies three kinds of long-term behaviour, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed. © 2013 Springer-Verlag.

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

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