Skip to main content
SpringerLink
Log in

Reachability Probabilities of Quantum Markov Chains

  • Conference paper
CONCUR 2013 – Concurrency Theory (CONCUR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8052))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambainis, A.: Quantum Walks and Their Algorithmic Applications. Int. J. Quantum Inform. 1, 507–518 (2003)

    Article  MATH  Google Scholar 

  2. Baier, C., Katoen, J.-P.: Principles of Model Checking. The MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  3. Burgarth, D., Chiribella, G., Giovannetti, V., Perinotti, P., Yuasa, K.: Ergodic and Mixing Quantum Channels in Finite Dimensions: arXiv:1210.5625v1

    Google Scholar 

  4. Cirac, J.I., Zoller, P.: Goals and Opportunities in Quantum Simulation. Nat. Phys. 8, 264–266 (2012)

    Article  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  6. Davidson, T.A.S.: Formal Verification Techniques using Quantum Process Calculus. Ph.D. thesis, University of Warwick (2011)

    Google Scholar 

  7. D’Hondt, E., Panangaden, P.: Quantum Weakest Preconditions. Math. Struct. Comp. Sci. 16, 429–451 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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–534. ACM, New York (2011)

    Google Scholar 

  9. Feng, Y., Duan, R.Y., Ying, M.S.: Bisimulation for Quantum Processes. ACM T. Progr. Lang. Sys. 34, art. no:17 (2012)

    Google Scholar 

  10. Gardiner, C., Zoller, P.: Quantum Noise: A Handbook of Markovian and Non-Markovian Stochastic Methods with Applications to Quantum Optics. Springer, Heidelberg (2004)

    Google Scholar 

  11. Gay, S.J., Nagarajan, R.: Communicating Quantum Processes. In: Proceedings of the 32nd ACM Symposium on Principles of Programming Languages (POPL), pp. 145–157. ACM, New York (2005)

    Google Scholar 

  12. Gay, S.J., Papanikolaou, N., Nagarajan, R.: Specification and Verification of Quantum Protocols. In: Semantic Techniques in Quantum Computation, pp. 414–472. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  13. Gay, S.J., Nagarajan, R., Papanikolaou, N.: QMC: A Model Checker for Quantum Systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 543–547. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Hart, S., Sharir, M., Pnueli, A.: Termination of Probabilistic Concurrent Programs. ACM T. Progr. Lang. Sys. 5, 356–380 (1983)

    Article  MATH  Google Scholar 

  15. Jorrand, P., Lalire, M.: Toward a Quantum Process Algebra. In: Proceedings of the First ACM Conference on Computing Frontiers, pp. 111–119. ACM, New York (2004)

    Chapter  Google Scholar 

  16. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomised Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)

    Book  Google Scholar 

  17. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  18. Rosmanis, A.: Fixed Space of Positive Trace-Preserving Super-Operators. Linear Algebra Appl. 437, 1704–1721 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schirmer, S.G., Solomon, A.I., Leahy, J.V.: Criteria for Reachability of Quantum States. J. Phys. A: Math. Gen. 35, 8551–8562 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. Selinger, P.: Towards a Quantum Programming Language. Math. Struct. Comp. Sci. 14, 527–586 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wolf, M.M.: Quantum Channels and Operators: Guided Tour (unpublished)

    Google Scholar 

  22. 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–242. ACM, New York (1990)

    Chapter  Google Scholar 

  23. Ying, M.S.: Floyd-Hoare Logic for Quantum Programs. ACM T. Progr. Lang. Sys. 33, art. no:19 (2011)

    Google Scholar 

  24. Yu, N., Ying, M.: Reachability and Termination Analysis of Concurrent Quantum Programs. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 69–83. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  25. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tsinghua University, China

    Shenggang Ying, Yuan Feng, Nengkun Yu & Mingsheng Ying

  2. University of Technology, Sydney, Australia

    Shenggang Ying, Yuan Feng, Nengkun Yu & Mingsheng Ying

Authors
  1. Shenggang Ying
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuan Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nengkun Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mingsheng Ying
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Matemáticas, Astronomía y Física, Universidad Nacional de Córdoba – CONICET, Medina Allende s/n,, X5000HUA, Córdoba, Argentina

    Pedro R. D’Argenio

  2. Departamento de Computación,, Universidad de Buenos Aires - Conicet, Intendente Güirales 2160, C1428EGA, Ciudad Autónoma de Buenos Aires, Argentina

    Hernán Melgratti

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ying, S., Feng, Y., Yu, N., Ying, M. (2013). Reachability Probabilities of Quantum Markov Chains. In: D’Argenio, P.R., Melgratti, H. (eds) CONCUR 2013 – Concurrency Theory. CONCUR 2013. Lecture Notes in Computer Science, vol 8052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40184-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40184-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40183-1

  • Online ISBN: 978-3-642-40184-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation