Measuring the constrained reachability in quantum Markov chains

Xu, M; Huang, CC; Feng, Y

Measuring the constrained reachability in quantum Markov chains

Xu, M Huang, CC Feng, Y

Permalink

Publisher:: Springer
Publication Type:: Journal Article
Citation:: Acta Informatica, 2021, 58, (6), pp. 653-674
Issue Date:: 2021

Closed Access

	Filename	Description	Size
	Xu2021_Article_MeasuringTheConstrainedReachab.pdf	Published version	444.36 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	Xu, M
dc.contributor.author	Huang, CC
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896
dc.date.accessioned	2022-04-12T22:03:09Z
dc.date.available	2022-04-12T22:03:09Z
dc.date.issued	2021
dc.identifier.citation	Acta Informatica, 2021, 58, (6), pp. 653-674
dc.identifier.issn	0001-5903
dc.identifier.issn	1432-0525
dc.identifier.uri	http://hdl.handle.net/10453/156146
dc.description.abstract	© 2020, Springer-Verlag GmbH Germany, part of Springer Nature. Constrained reachability is a kind of quantitative path property, which is generally specified by multiphase until formulas originated in continuous stochastic logic. In this paper, through proposing a positive operator valued measure on the set of infinite paths, we develop an exact method to solve the constrained reachability problem for quantum Markov chains. The convergence rate of the reachability is also obtained. We then analyse the complexity of the proposed method, which turns out to be in polynomial-time w.r.t. the size of the classical state space and the dimension of the accompanied Hilbert space. Finally, our method is implemented and applied to a simple quantum protocol.
dc.language	English
dc.publisher	Springer
dc.relation	http://purl.org/au-research/grants/arc/DP180100691
dc.relation.ispartof	Acta Informatica
dc.relation.isbasedon	10.1007/s00236-020-00392-5
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0802 Computation Theory and Mathematics, 0803 Computer Software, 0804 Data Format
dc.subject.classification	Computation Theory & Mathematics
dc.title	Measuring the constrained reachability in quantum Markov chains
dc.type	Journal Article
utslib.citation.volume	58
utslib.for	0802 Computation Theory and Mathematics
utslib.for	0803 Computer Software
utslib.for	0804 Data Format
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.consider-herdc	false
dc.date.updated	2022-04-12T22:03:08Z
pubs.issue	6
pubs.publication-status	Published
pubs.volume	58
utslib.citation.issue	6

Abstract:

© 2020, Springer-Verlag GmbH Germany, part of Springer Nature. Constrained reachability is a kind of quantitative path property, which is generally specified by multiphase until formulas originated in continuous stochastic logic. In this paper, through proposing a positive operator valued measure on the set of infinite paths, we develop an exact method to solve the constrained reachability problem for quantum Markov chains. The convergence rate of the reachability is also obtained. We then analyse the complexity of the proposed method, which turns out to be in polynomial-time w.r.t. the size of the classical state space and the dimension of the accompanied Hilbert space. Finally, our method is implemented and applied to a simple quantum protocol.

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

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