{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:55Z","timestamp":1760202655107},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_24","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"334-348","source":"Crossref","is-referenced-by-count":15,"title":["Reachability Probabilities of Quantum Markov Chains"],"prefix":"10.1007","author":[{"given":"Shenggang","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nengkun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingsheng","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum Walks and Their Algorithmic Applications. Int. J. Quantum Inform.\u00a01, 507\u2013518 (2003)","journal-title":"Int. J. Quantum Inform."},{"key":"24_CR2","volume-title":"Principles of Model Checking","author":"C. Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"24_CR3","unstructured":"Burgarth, D., Chiribella, G., Giovannetti, V., Perinotti, P., Yuasa, K.: Ergodic and Mixing Quantum Channels in Finite Dimensions: arXiv:1210.5625v1"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1038\/nphys2275","volume":"8","author":"J.I. Cirac","year":"2012","unstructured":"Cirac, J.I., Zoller, P.: Goals and Opportunities in Quantum Simulation. Nat. Phys.\u00a08, 264\u2013266 (2012)","journal-title":"Nat. Phys."},{"key":"24_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)"},{"key":"24_CR6","unstructured":"Davidson, T.A.S.: Formal Verification Techniques using Quantum Process Calculus. Ph.D. thesis, University of Warwick (2011)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0960129506005251","volume":"16","author":"E. D\u2019Hondt","year":"2006","unstructured":"D\u2019Hondt, E., Panangaden, P.: Quantum Weakest Preconditions. Math. Struct. Comp. Sci.\u00a016, 429\u2013451 (2006)","journal-title":"Math. Struct. Comp. Sci."},{"key":"24_CR8","first-page":"523","volume-title":"Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","author":"Y. Feng","year":"2011","unstructured":"Feng, Y., Duan, R.Y., Ying, M.S.: Bisimulation for Quantum Processes. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 523\u2013534. ACM, New York (2011)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Feng, Y., Duan, R.Y., Ying, M.S.: Bisimulation for Quantum Processes. ACM T. Progr. Lang. Sys.\u00a034, art. no:17 (2012)","DOI":"10.1145\/2400676.2400680"},{"key":"24_CR10","volume-title":"Quantum Noise: A Handbook of Markovian and Non-Markovian Stochastic Methods with Applications to Quantum Optics","author":"C. Gardiner","year":"2004","unstructured":"Gardiner, C., Zoller, P.: Quantum Noise: A Handbook of Markovian and Non-Markovian Stochastic Methods with Applications to Quantum Optics. Springer, Heidelberg (2004)"},{"key":"24_CR11","first-page":"145","volume-title":"Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL)","author":"S.J. Gay","year":"2005","unstructured":"Gay, S.J., Nagarajan, R.: Communicating Quantum Processes. In: Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL), pp. 145\u2013157. ACM, New York (2005)"},{"key":"24_CR12","first-page":"414","volume-title":"Semantic Techniques in Quantum Computation","author":"S.J. Gay","year":"2010","unstructured":"Gay, S.J., Papanikolaou, N., Nagarajan, R.: Specification and Verification of Quantum Protocols. In: Semantic Techniques in Quantum Computation, pp. 414\u2013472. Cambridge University Press, Cambridge (2010)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-70545-1_51","volume-title":"Computer Aided Verification","author":"S.J. Gay","year":"2008","unstructured":"Gay, S.J., Nagarajan, R., Papanikolaou, N.: QMC: A Model Checker for Quantum Systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 543\u2013547. Springer, Heidelberg (2008)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S. Hart","year":"1983","unstructured":"Hart, S., Sharir, M., Pnueli, A.: Termination of Probabilistic Concurrent Programs. ACM T. Progr. Lang. Sys.\u00a05, 356\u2013380 (1983)","journal-title":"ACM T. Progr. Lang. Sys."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/977091.977108","volume-title":"Proceedings of the First ACM Conference on Computing Frontiers","author":"P. Jorrand","year":"2004","unstructured":"Jorrand, P., Lalire, M.: Toward a Quantum Process Algebra. In: Proceedings of the First ACM Conference on Computing Frontiers, pp. 111\u2013119. ACM, New York (2004)"},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomised Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomised Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"24_CR17","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1016\/j.laa.2012.04.050","volume":"437","author":"A. Rosmanis","year":"2012","unstructured":"Rosmanis, A.: Fixed Space of Positive Trace-Preserving Super-Operators. Linear Algebra Appl.\u00a0437, 1704\u20131721 (2012)","journal-title":"Linear Algebra Appl."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"8551","DOI":"10.1088\/0305-4470\/35\/40\/313","volume":"35","author":"S.G. Schirmer","year":"2002","unstructured":"Schirmer, S.G., Solomon, A.I., Leahy, J.V.: Criteria for Reachability of Quantum States. J. Phys. A: Math. Gen.\u00a035, 8551\u20138562 (2002)","journal-title":"J. Phys. A: Math. Gen."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P. Selinger","year":"2004","unstructured":"Selinger, P.: Towards a Quantum Programming Language. Math. Struct. Comp. Sci.\u00a014, 527\u2013586 (2004)","journal-title":"Math. Struct. Comp. Sci."},{"key":"24_CR21","unstructured":"Wolf, M.M.: Quantum Channels and Operators: Guided Tour (unpublished)"},{"key":"24_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/298514.298576","volume-title":"Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"M. Yannakakis","year":"1990","unstructured":"Yannakakis, M.: Graph-Theoretic Methods in Database Theory. In: Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 230\u2013242. ACM, New York (1990)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Ying, M.S.: Floyd-Hoare Logic for Quantum Programs. ACM T. Progr. Lang. Sys.\u00a033, art. no:19 (2011)","DOI":"10.1145\/2049706.2049708"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-32940-1_7","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"N. Yu","year":"2012","unstructured":"Yu, N., Ying, M.: Reachability and Termination Analysis of Concurrent Quantum Programs. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 69\u201383. Springer, Heidelberg (2012)"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Ying, M.S., Yu, N.K., Feng, Y., Duan, R.Y.: Verification of Quantum Programs. Sci. Comput. Program (accepted, 2013) (also see: arXiv:1106.4063)","DOI":"10.1016\/j.scico.2013.03.016"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:49:43Z","timestamp":1557974983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}