Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-28T10:44:11.680Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  14 January 2021

Mingsheng Ying  and
Yuan Feng
Mingsheng Ying
Affiliation:
University of Technology, Sydney
Yuan Feng
Affiliation:
University of Technology, Sydney
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Model Checking Quantum Systems
Principles and Algorithms
 , pp. 201 - 207
Publisher: Cambridge University Press
Print publication year: 2021

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Adao, P. and Mateus, P.. A process algebra for reasoning about quantum security. Electronic Notes in Theoretical Computer Science, 170:3–21, 2007.CrossRefGoogle Scholar
[2] Aho, A. V. and Hopcroft, J. E.. The Design and Analysis of Computer Algorithms, 1st ed. Addison-Wesley Longman, 1974.Google Scholar
[3] Albert, V. V.. Asymptotics of quantum channels: Conserved quantities, an adiabatic limit, and matrix product states. Quantum, 3:151, 2019.Google Scholar
[4] Ambainis, A. and Yakaryılmaz, A.. Automata and quantum computing. arXiv:1507.01988, 2015.Google Scholar
[5] Ardeshir-Larijani, E., Gay, S. J. and Nagarajan, R.. Equivalence checking of quantum protocols. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 478–92. Springer, 2013.Google Scholar
[6] Ardeshir-Larijani, E., Gay, S. J. and Nagarajan, R.. Verification of concurrent quantum protocols by equivalence checking. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 500–14. Springer, 2014.Google Scholar
[7] Baier, C. and Katoen, J.-P.. Principles of Model Checking. MIT Press, 2008.Google Scholar
[8] Baltazar, P., Chadha, R. and Mateus, P.. Quantum computation tree logic: Model checking and complete calculus. International Journal of Quantum Information, 6(02):219–36, 2008.Google Scholar
[9] Baltazar, P., Chadha, R., Mateus, P. and Sernadas, A.. Towards model-checking quantum security protocols. In 2007 First International Conference on Quantum, Nano, and Micro Technologies (ICQNM’07), p. 14. IEEE, 2007.Google Scholar
[10] Barry, J., Barry, D. T. and Aaronson, S.. Quantum partially observable Markov decision processes. Physical Review A, 90(3):032311, 2014.CrossRefGoogle Scholar
[11] Barthe, G., Grégoire, B. and Zanella Béguelin, S.. Formal certification of code-based cryptographic proofs. In Proceedings of POPL, vol. 44, pp. 90–101. ACM, 2009.Google Scholar
[12] Barthe, G., Hsu, J., Ying, M., Yu, N. and Zhou, L.. Relational reasoning for quantum programs. In Proceedings of POPL. ACM, 2020.Google Scholar
[13] Basin, D., Cremers, C. and Meadows, C.. Model checking security protocols. In E. M. Clarke, T. A. Henzinger, H. Veith, and B. Bloem, eds., Handbook of Model Checking, pp. 727–62. Springer, 2011.Google Scholar
[14] Baumgartner, B. and Narnhofer, H.. The structures of state space concerning quantum dynamical semigroups. Reviews in Mathematical Physics, 24(2):1250001, 2012.CrossRefGoogle Scholar
[15] Bennett, C. H. and Brassard, G.. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, pp. 175–79, 1984.Google Scholar
[16] Benton, N.. Simple relational correctness proofs for static analyses and program transformations. In Proceedings of POPL, vol. 39, pp. 14–25. ACM, 2004.Google Scholar
[17] Berry, D. W., Ahokas, G., Cleve, R. and Sanders, B. C.. Efficient quantum algorithms for simulating sparse hamiltonians. Communications in Mathematical Physics, 270(2):359–71, 2007.CrossRefGoogle Scholar
[18] Berstel, J. and Mignotte, M.. Deux propriétés décidables des suites récurrentes linéaires. Bulletin de la Société Mathématique de France, 104:175–84, 1976.Google Scholar
[19] Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., Zhu, Y., et al. Bounded model checking. Advances in Computers, 58(11):117–48, 2003.Google Scholar
[20] Birkhoff, G. and Von Neumann, J.. The logic of quantum mechanics. Annals of Mathematics, pp. 823–43, 1936.Google Scholar
[21] Blondel, V. D., Jeandel, E., Koiran, P. and Portier, N.. Decidable and undecidable problems about quantum automata. SIAM Journal on Computing, 34(6):1464–73, 2005.Google Scholar
[22] Breuer, H.-P. and Petruccione, F.. The Theory of Open Quantum Systems. Oxford University Press on Demand, 2002.Google Scholar
[23] Brun, T. A.. A simple model of quantum trajectories. American Journal of Physics, 70(7):719–37, 2002.Google Scholar
[24] Bruns, G. and Harding, J.. Algebraic aspects of orthomodular lattices. In B. Coecke, D. Moore, and A. Wilce, eds., Current Research in Operational Quantum Logic, pp. 37–65. Springer, 2000.Google Scholar
[25] Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L. and Hwang, L.-J.. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142– 70, 1992.Google Scholar
[26] Burgarth, D., Chiribella, G., Giovannetti, V., Perinotti, P. and Yuasa, K.. Ergodic and mixing quantum channels in finite dimensions. New Journal of Physics, 15(7):073045, 2013.Google Scholar
[27] Carbone, R. and Pautrat, Y.. Irreducible decompositions and stationary states of quantum channels. Reports on Mathematical Physics, 77(3):293–313, 2016.Google Scholar
[28] Carbone, R. and Pautrat, Y.. Open quantum random walks: reducibility, period, ergodic properties. In Annales Henri Poincaré, vol. 17, pp. 99–135. Springer, 2016.Google Scholar
[29] Cassaigne, J. and Karhumäki, J.. Examples of undecidable problems for 2-generator matrix semigroups. Theoretical Computer Science, 204(1-2):29–34, 1998.CrossRefGoogle Scholar
[30] Chatterjee, K. and Henzinger, T.. Probabilistic automata on infinite words: Decidability and undecidability results. In A. Bouajjani and W.-N. Chin, eds., Automated Technology for Verification and Analysis, vol. 6252 of Lecture Notes in Computer Science, pp. 1–16. Springer, 2010.Google Scholar
[31] Childs, A. M.. On the relationship between continuous-and discrete-time quantum walk. Communications in Mathematical Physics, 294(2):581–603, 2010.CrossRefGoogle Scholar
[32] Cirac, J. I. and Zoller, P.. Goals and opportunities in quantum simulation. Nature Physics, 8(4):264, 2012.Google Scholar
[33] Clarke, E. M. and Emerson, E. A.. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logic of Programs, pp. 52–71. Springer, 1981.Google Scholar
[34] Clarke, E. M., Henzinger, T. A., Veith, H. and Bloem, R.. Handbook of Model Checking, vol. 10. Springer, 2018.Google Scholar
[35] Clarke, E. M. Jr, Grumberg, O., Kroening, D., Peled, D. and Veith, H.. Model Checking. MIT Press, 2018.Google Scholar
[36] Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C.. Introduction to Algorithms. MIT Press, 2009.Google Scholar
[37] Davidson, T., Gay, S., Nagarajan, R. and Puthoor, I.. Analysis of a quantum error correcting code using quantum process calculus. Electronic Proceedings in Theoretical Computer Science, 95:67–80, 2012.CrossRefGoogle Scholar
[38] Davidson, T. A.. Formal Verification Techniques Using Quantum Process Calculus. PhD thesis, University of Warwick, 2012.Google Scholar
[39] Davidson, T. A., Gay, S. J., Mlnarik, H., Nagarajan, R. and Papanikolaou, N.. Model checking for communicating quantum processes. IJUC, 8(1):73–98, 2012.Google Scholar
[40] Diestel, J. and Uhl, J.. Vector Measures. American Mathematical Society, 1977.Google Scholar
[41] Dowling, J. P. and Milburn, G. J.. Quantum technology: The second quantum revolution. Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 361(1809):1655–74, 2003.Google Scholar
[42] Eisner, C. and Fisman, D.. Functional specification of hardware via temporal logic. In Handbook of Model Checking, pp. 795–829. Springer, 2018.Google Scholar
[43] Emerson, E. A.. Temporal and modal logic. In Formal Models and Semantics, pp. 995–1072. Elsevier, 1990.Google Scholar
[44] Engesser, K., Gabbay, D. M. and Lehmann, D.. Handbook of Quantum Logic and Quantum Structures: Quantum Structures. Elsevier, 2007.Google Scholar
[45] Esparza, J. and Schwoon, S.. A bdd-based model checker for recursive programs. In International Conference on Computer Aided Verification, pp. 324–36. Springer, 2001.Google Scholar
[46] Etessami, K. and Yannakakis, M.. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM (JACM), 56(1):1, 2009.Google Scholar
[47] Fagnola, F. and Rebolledo, R.. On the existence of stationary states for quantum dynamical semigroups. Journal of Mathematical Physics, 42(3):1296–1308, 2001.CrossRefGoogle Scholar
[48] Feng, Y., Hahn, E. M., Turrini, A., and Ying, S.. Model checking omega-regular properties for quantum markov chains. In 28th International Conference on Concurrency Theory (CONCUR 2017), pp. 35:1–35:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.Google Scholar
[49] Feng, Y., Hahn, E. M., Turrini, A. and Zhang, L.. Qpmc: A model checker for quantum programs and protocols. In International Symposium on Formal Methods, pp. 265– 72. Springer, 2015.Google Scholar
[50] Feng, Y. and Ying, M.. Toward automatic verification of quantum cryptographic protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015), pp. 441–55, 2015.Google Scholar
[51] Feng, Y., Yu, N. and Ying, M.. Model checking quantum markov chains. Journal of Computer and System Sciences, 79(7):1181–98, 2013.Google Scholar
[52] Feng, Y., Yu, N. and Ying, M.. Reachability analysis of recursive quantum Markov chains. In International Symposium on Mathematical Foundations of Computer Science, pp. 385–96. Springer, 2013.Google Scholar
[53] Feynman, R. P.. Simulating physics with computers. International Journal of Theoretical Physics, 21(6):467–88, 1982.Google Scholar
[54] Gay, S., Nagarajan, R. and Papanikolaou, N.. Probabilistic model–checking of quantum protocols. arXiv preprint quant-ph/0504007, 2005.Google Scholar
[55] Gay, S., Nagarajan, R. and Papanikolaou, N.. Specification and verification of quantum protocols. In I. Mackie and S. Gay, eds., Semantic Techniques in Quantum Computation, pp. 414–72. Cambridge University Press, 2010.Google Scholar
[56] Gay, S. J. and Nagarajan, R.. Communicating quantum processes. In Proceedings of the 32Nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL’05, pp. 145–57. ACM, 2005.Google Scholar
[57] Gay, S. J., Nagarajan, R. and Papanikolaou, N.. Qmc: A model checker for quantum systems. In International Conference on Computer Aided Verification, pp. 543–47. Springer, 2008.Google Scholar
[58] Golovkins, M.. Quantum pushdown automata. In International Conference on Current Trends in Theory and Practice of Computer Science, pp. 336–46. Springer, 2000.Google Scholar
[59] Gottesman, D. E.. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology, 1997.Google Scholar
[60] Griffiths, R. B.. Consistent histories and quantum reasoning. Physical Review A, 54(4):2759, 1996.Google Scholar
[61] Guan, J., Feng, Y. and Ying, M.. Decomposition of quantum Markov chains and its applications. Journal of Computer and System Sciences, 95:55–68, 2018.CrossRefGoogle Scholar
[62] Gudder, S.. Quantum Markov chains. Journal of Mathematical Physics, 49(7):072105, 2008.Google Scholar
[63] Halava, V.. Decidable and undecidable problems in matrix theory. Technical Report, Turku Centre for Computer Science, 1997.Google Scholar
[64] Halava, V., Harju, T., Hirvensalo, M. and Karhumäki, J.. Skolem’s problem: On the border between decidability and undecidability. Technical Report 683, Turku Centre for Computer Science, 2005.Google Scholar
[65] Hansson, H. and Jonsson, B.. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512–35, 1994.Google Scholar
[66] Harrow, A. W., Hassidim, A. and Lloyd, S.. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15):150502, 2009.CrossRefGoogle ScholarPubMed
[67] Hart, S., Sharir, M. and Pnueli, A.. Termination of probabilistic concurrent programs. In Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, pp. 1–6. ACM, 1982.Google Scholar
[68] Heath, J., Kwiatkowska, M., Norman, G., Parker, D. and Tymchyshyn, O.. Probabilistic model checking of complex biological pathways. In International Conference on Computational Methods in Systems Biology, pp. 32–47. Springer, 2006.Google Scholar
[69] Huang, Y. and Martonosi, M.. Statistical assertions for validating patterns and finding bugs in quantum programs. In Proceedings of the 46th International Symposium on Computer Architecture, pp. 541–53. ACM, 2019.Google Scholar
[70] Isham, C. J. and Linden, N.. Quantum temporal logic and decoherence functionals in the histories approach to generalized quantum theory. Journal of Mathematical Physics, 35(10):5452–476, 1994.Google Scholar
[71] Kalmbach, G.. Orthomodular Lattices. Academic Press, 1983.Google Scholar
[72] Kondacs, A. and Watrous, J.. On the power of quantum finite state automata. In Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 66– 75. IEEE, 1997.Google Scholar
[73] Kubota, T., Kakutani, Y., Kato, G., Kawano, Y. and Sakurada, H.. Semi-automated verification of security proofs of quantum cryptographic protocols. Journal of Symbolic Computation, 73:192–220, 2016.Google Scholar
[74] Kurshan, R. P.. Transfer of model checking to industrial practice. In Handbook of Model Checking, pp. 763–93. Springer, 2018.Google Scholar
[75] Kwiatkowska, M., Norman, G. and Parker, D.. Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer, 6(2):128–42, 2004.Google Scholar
[76] Kwiatkowska, M., Norman, G. and Parker, D.. Stochastic model checking. In International School on Formal Methods for the Design of Computer, Communication and Software Systems, pp. 220–70. Springer, 2007.Google Scholar
[77] Lech, C.. A note on recurring series. Arkiv för Matematik, 2(5):417–21, 1953.CrossRefGoogle Scholar
[78] Li, G., Zhou, L., Yu, N., Ding, Y., Ying, M. and Xie, Y.. Poq: Projection-based runtime assertions for debugging on a quantum computer. arXiv preprint arXiv:1911.12855, 2019.Google Scholar
[79] Li, L. and Qiu, D.. Determination of equivalence between quantum sequential machines. Theoretical Computer Science, 358(1):65–74, 2006.Google Scholar
[80] Li, L. and Qiu, D.. Determining the equivalence for one-way quantum finite automata. Theoretical Computer Science, 403(1):42–51, 2008.CrossRefGoogle Scholar
[81] Li, Y. and Unruh, D.. Quantum relational hoare logic with expectations. arXiv:1903.08357, 2019.Google Scholar
[82] Li, Y. and Ying, M.. (Un)decidable problems about reachability of quantum systems. In International Conference on Concurrency Theory, pp. 482–96. Springer, 2014.Google Scholar
[83] Li, Y., Yu, N. and Ying, M.. Termination of nondeterministic quantum programs. Acta informatica, 51(1):1–24, 2014.Google Scholar
[84] Liu, J., Byrd, G. and Zhou, H.. Quantum circuits for dynamic runtime assertions in quantum computation. In 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2020). ACM, 2020.Google Scholar
[85] Lloyd, S.. Universal quantum simulators. Science, 273(5278):1073–78, 1996.Google Scholar
[86] Mahler, K.. Eine arithmetische Eigenschaft der Taylor-koeffizienten rationaler Funktionen. Noord-Hollandsche Uitgevers Mij, 1935.Google Scholar
[87] Mateus, P., Ramos, J., Sernadas, A. and Sernadas, C.. Temporal logics for reasoning about quantum systems. In I. Mackie and S. Gay, eds., Semantic Techniques in quantum computation, pp. 389–413. Cambridge University Press, 2010.Google Scholar
[88] Mateus, P. and Sernadas, A.. Weakly complete axiomatization of exogenous quantum propositional logic. Information and Computation, 204(5):771–94, 2006.Google Scholar
[89] Minsky, M. L.. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.Google Scholar
[90] Miranskyy, A. and Zhang, L.. On testing quantum programs. In 2019 IEEE/ACM 41st International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER), pp. 57–60. IEEE, 2019.Google Scholar
[91] Molitor, P. and Mohnke, J.. Equivalence Checking of Digital Circuits: Fundamentals, Principles, Methods. Springer Science+Business Media, 2007.Google Scholar
[92] Moore, C. and Crutchfield, J. P.. Quantum automata and quantum grammars. Theoretical Computer Science, 237(1-2):275–306, 2000.Google Scholar
[93] Nielsen, M. A. and Chuang, I.. Quantum Computation and Quantum Information. Cambridge University Press, 2000.Google Scholar
[94] Orús, R.. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics, 349:117–58, 2014.Google Scholar
[95] Ouaknine, J. and Worrell, J.. Decision problems for linear recurrence sequences. In International Workshop on Reachability Problems, pp. 21–8. Springer, 2012.Google Scholar
[96] Papanikolaou, N. K.. Model Checking Quantum Protocols. PhD thesis, University of Warwick, 2009.Google Scholar
[97] Paz, A.. Introduction to Probabilistic Automata. Academic Press, 2014.Google Scholar
[98] Piterman, N.. From nondeterministic Büchi and Streett automata to deterministic parity automata. In 21st Annual IEEE Symposium on Logic in Computer Science (LICS’06), pp. 255–64. IEEE, 2006.Google Scholar
[99] Post, E. L.. A variant of a recursively unsolvable problem. Journal of Symbolic Logic, 12(2):55–6, 1947.Google Scholar
[100] Qiu, D., Li, L., Zou, X., Mateus, P. and Gruska, J.. Multi-letter quantum finite automata: Decidability of the equivalence and minimization of states. Acta Informatica, 48(5-6):271, 2011.Google Scholar
[101] Queille, J.-P. and Sifakis, J.. Specification and verification of concurrent systems in cesar. In International Symposium on programming, pp. 337–51. Springer, 1982.Google Scholar
[102] Safra, S.. On the complexity of omega-automata. In 29th Annual Symposium on Foundations of Computer Science, pp. 319–27. IEEE, 1988.Google Scholar
[103] Salomaa, A. and Soittola, M.. Automata-theoretic aspects of formal power series. Bulletin of the American Mathematical Society, 1:675–78, 1979.Google Scholar
[104] Schewe, S.. Tighter bounds for the determinisation of Büchi automata. In International Conference on Foundations of Software Science and Computational Structures, pp. 167–81. Springer, 2009.Google Scholar
[105] Sharir, M., Pnueli, A. and Hart, S.. Verification of probabilistic programs. SIAM Journal on Computing, 13(2):292–314, 1984.Google Scholar
[106] Skolem, T.. Ein Verfahren zur Behandlung gewisser exponentialer Gleichungen und diophantischer Gleichungen. In Proceedings of the 8th Congress of Scandinavian Mathematicians, pp. 163–88. Stockholm, 1934.Google Scholar
[107] Umanità, V.. Classification and decomposition of quantum Markov semigroups. Probability Theory and Related Fields, 134(4):603–23, 2006.Google Scholar
[108] Unruh, D.. Quantum relational hoare logic. In Proceedings of POPL, vol. 33, pp. 1–31. ACM, 2019.Google Scholar
[109] Vardi, M. Y.. Automatic verification of probabilistic concurrent finite state programs. In 26th Annual Symposium on Foundations of Computer Science, pp. 327–38. IEEE, 1985.Google Scholar
[110] Vardi, M. Y. and Wolper, P.. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pp. 322–31. IEEE Computer Society, 1986.Google Scholar
[111] Viamontes, G. F., Markov, I. L. and Hayes, J. P.. Checking equivalence of quantum circuits and states. In 2007 IEEE/ACM International Conference on Computer-Aided Design, pp. 69–74. IEEE, 2007.Google Scholar
[112] Vigano, L., Volpe, M. and Zorzi, M.. A branching distributed temporal logic for reasoning about entanglement-free quantum state transformations. Information and Computation, 255:311–33, 2017.Google Scholar
[113] Wang, Q., Liu, J. and Ying, M.. Equivalence checking of quantum finite-state machines. arXiv preprint arXiv:1901.02173, 2019.Google Scholar
[114] Wang, Q. and Ying, M.. Equivalence checking of sequential quantum circuits. arXiv preprint arXiv:1811.07722, 2018.Google Scholar
[115] Wolf, M. M.. Quantum channels & operations: Guided tour. Lecture notes available at www-m5.ma.tum.de/foswiki/pub/M5/Allgemeines/MichaelWolf/QChannelLecture.pdf, 5, 2012.Google Scholar
[116] Yamashita, S. and Markov, I. L.. Fast equivalence-checking for quantum circuits. In Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures, pp. 23–8. IEEE Press, 2010.Google Scholar
[117] Ying, M.. Foundations of Quantum Programming. Morgan Kaufmann, 2016.Google Scholar
[118] Ying, M. and Feng, Y.. Quantum loop programs. Acta Informatica, 47(4):221–50, 2010.Google Scholar
[119] Ying, M., Li, Y., Yu, N. and Feng, Y.. Model-checking linear-time properties of quantum systems. ACM Transactions on Computational Logic (TOCL), 15(3):22, 2014.Google Scholar
[120] Ying, S., Feng, Y., Yu, N. and Ying, M.. Reachability probabilities of quantum markov chains. In International Conference on Concurrency Theory, pp. 334–48. Springer, 2013.Google Scholar
[121] Ying, S. and Ying, M.. Reachability analysis of quantum Markov decision processes. Information and Computation, 263:31–51, 2018.Google Scholar
[122] Yu, N.. Quantum temporal logic. arXiv preprint arXiv:1908.00158, 2019.Google Scholar
[123] Yu, N. and Ying, M.. Reachability and termination analysis of concurrent quantum programs. In M. Koutny and I. Ulidowski, eds., CONCUR 2012: Concurrency Theory, vol. 7454 of Lecture Notes in Computer Science, pp. 69–83. Springer, 2012.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Mingsheng Ying, University of Technology, Sydney, Yuan Feng, University of Technology, Sydney
  • Book: Model Checking Quantum Systems
  • Online publication: 14 January 2021
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Mingsheng Ying, University of Technology, Sydney, Yuan Feng, University of Technology, Sydney
  • Book: Model Checking Quantum Systems
  • Online publication: 14 January 2021
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Mingsheng Ying, University of Technology, Sydney, Yuan Feng, University of Technology, Sydney
  • Book: Model Checking Quantum Systems
  • Online publication: 14 January 2021
Available formats
×