{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:21:49Z","timestamp":1742966509207,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031720437"},{"type":"electronic","value":"9783031720444"}],"license":[{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-72044-4_7","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:41Z","timestamp":1725897761000},"page":"127-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model-Based Testing of\u00a0Quantum Computations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8404-753X","authenticated-orcid":false,"given":"Malte","family":"Lochau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7153-761X","authenticated-orcid":false,"given":"Ina","family":"Schaefer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Ali, S., Arcaini, P., Wang, X., Yue, T.: Assessing the effectiveness of input and output coverage criteria for testing quantum programs. In: 2021 14th IEEE Conference on Software Testing, Verification and Validation (ICST), pp. 13\u201323 (2021). https:\/\/doi.org\/10.1109\/ICST49551.2021.00014","DOI":"10.1109\/ICST49551.2021.00014"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.287.1","volume":"287","author":"M Amy","year":"2019","unstructured":"Amy, M.: Towards large-scale functional verification of universal quantum circuits. Electron. Proc. Theor. Comput. Sci. 287, 1\u201321 (2019). https:\/\/doi.org\/10.4204\/EPTCS.287.1","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Garc\u00eda de\u00a0la Barrera, A., Garc\u00eda-Rodr\u00edguez\u00a0de Guzm\u00e1n, I., Polo, M., Piattini, M.: Quantum software testing: State of the art. J. Softw. Evol. Process 35(4), e2419 (2023). https:\/\/doi.org\/10.1002\/smr.2419","DOI":"10.1002\/smr.2419"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1991.0040","author":"G Bernot","year":"1991","unstructured":"Bernot, G., Gaudel, M.C., Marre, B.: Software testing based on formal specifications: a theory and a tool. Softw. Eng. J. (1991). https:\/\/doi.org\/10.1049\/sej.1991.0040","journal-title":"Softw. Eng. J."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Biamonte, J., Perkowski, M.: Testing a quantum computer, October 2004. https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0409023","DOI":"10.48550\/arXiv.quant-ph\/0409023"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1038\/nphys1157","volume":"5","author":"HJ Briegel","year":"2009","unstructured":"Briegel, H.J., Browne, D.E., D\u00fcr, W., Raussendorf, R., Van den Nest, M.: Measurement-based quantum computation. Nat. Phys. 5(1), 19\u201326 (2009). https:\/\/doi.org\/10.1038\/nphys1157","journal-title":"Nat. Phys."},{"issue":"9","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1109\/TCAD.2020.3032630","volume":"40","author":"L Burgholzer","year":"2021","unstructured":"Burgholzer, L., Wille, R.: Advanced equivalence checking for quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(9), 1810\u20131824 (2021). https:\/\/doi.org\/10.1109\/TCAD.2020.3032630","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Campos, J., Souto, A.: QBugs: a collection of reproducible bugs in quantum algorithms and a supporting infrastructure to enable controlled quantum software testing and debugging experiments (2021). https:\/\/doi.org\/10.48550\/arXiv.2103.16968","DOI":"10.48550\/arXiv.2103.16968"},{"issue":"9","key":"7_CR9","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo, M., et al.: Variational quantum algorithms. Nat. Rev. Phys. 3(9), 625\u2013644 (2021). https:\/\/doi.org\/10.1038\/s42254-021-00348-9","journal-title":"Nat. Rev. Phys."},{"key":"7_CR10","unstructured":"Chareton, C., Bardin, S., Lee, D., Valiron, B., Vilmart, R., Xu, Z.: Formal methods for quantum programs: a survey (2021). https:\/\/arxiv.org\/abs\/2109.06493"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0039056","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"I Christoff","year":"1990","unstructured":"Christoff, I.: Testing equivalences and fully abstract models for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 126\u2013138. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039056"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Cramer, M., et al.: Efficient quantum state tomography. Nat. Commun. 1(1) (2010). https:\/\/doi.org\/10.1038\/ncomms1147","DOI":"10.1038\/ncomms1147"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci. 34(1), 83\u2013133 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90113-0","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Dey, N., Ghosh, M., kundu, S.S., Chakrabarti, A.: QDLC \u2013 the quantum development life Cycle (2020). https:\/\/doi.org\/10.48550\/arXiv.2010.08053","DOI":"10.48550\/arXiv.2010.08053"},{"issue":"7","key":"7_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1038\/s42254-020-0186-4","volume":"2","author":"J Eisert","year":"2020","unstructured":"Eisert, J., et al.: Quantum certification and benchmarking. Nat. Rev. Phys. 2(7), 382\u2013390 (2020). https:\/\/doi.org\/10.1038\/s42254-020-0186-4","journal-title":"Nat. Rev. Phys."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1038\/s42254-022-00535-2","volume":"5","author":"A Elben","year":"2022","unstructured":"Elben, A., et al.: The Randomized Measurement Toolbox. Nat. Rev. Phys. 5(1), 9\u201324 (2022). https:\/\/doi.org\/10.1038\/s42254-022-00535-2","journal-title":"Nat. Rev. Phys."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Farhi, E., Harrow, A.W.: Quantum supremacy through the quantum approximate optimization algorithm (2019). https:\/\/doi.org\/10.48550\/arXiv.1602.07674","DOI":"10.48550\/arXiv.1602.07674"},{"issue":"11","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1016\/j.ic.2007.08.001","volume":"205","author":"Y Feng","year":"2007","unstructured":"Feng, Y., Duan, R., Ji, Z., Ying, M.: Probabilistic bisimulations for quantum processes. Inf. Comput. 205(11), 1608\u20131639 (2007). https:\/\/doi.org\/10.1016\/j.ic.2007.08.001","journal-title":"Inf. Comput."},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Feng, Y., Duan, R., Ying, M.: Bisimulation for Quantum processes. ACM Trans. Program. Lang. Syst. 34(4) (2012). https:\/\/doi.org\/10.1145\/2400676.2400680","DOI":"10.1145\/2400676.2400680"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.4204\/EPTCS.180.2","volume":"180","author":"M Gerhold","year":"2015","unstructured":"Gerhold, M., Stoelinga, M.: IOCO theory for probabilistic automata. Electron. Proc. Theor. Comput. Sci. 180, 23\u201340 (2015). https:\/\/doi.org\/10.4204\/EPTCS.180.2","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Gerhold, M., Stoelinga, M.: Model-based testing of probabilistic systems. In: Stevens, P., Wasowski, A. (eds.) Fundamental Approaches to Software Engineering. pp. 251\u2013268. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-49665-7_15","DOI":"10.1007\/978-3-662-49665-7_15"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 212-219. ACM, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Honarvar, S., Mousavi, M.R., Nagarajan, R.: Property-based testing of quantum programs in Q#. In: Proceedings of the IEEE\/ACM 42nd International Conference on Software Engineering Workshops, ICSEW 2020, pp. 430-435. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3387940.3391459","DOI":"10.1145\/3387940.3391459"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Huang, Y., Martonosi, M.: QDB: from quantum algorithms towards correct quantum programs. In: Barik, T., Sunshine, J., Chasins, S. (eds.) 9th Workshop on Evaluation and Usability of Programming Languages and Tools (PLATEAU 2018), vol.\u00a067, pp. 4:1\u20134:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/OASIcs.PLATEAU.2018.4","DOI":"10.4230\/OASIcs.PLATEAU.2018.4"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Huang, Y., 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-553. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3307650.3322213","DOI":"10.1145\/3307650.3322213"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Hynninen, T., Kasurinen, J., Knutas, A., Taipale, O.: Software testing: survey of the industry practices. In: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pp. 1449\u20131454 (2018). https:\/\/doi.org\/10.23919\/MIPRO.2018.8400261","DOI":"10.23919\/MIPRO.2018.8400261"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Javadi-Abhari, A., et al.: Quantum computing with Qiskit (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.08810","DOI":"10.48550\/arXiv.2405.08810"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Knill, E.: Conventions for quantum pseudocode (2022). https:\/\/doi.org\/10.48550\/arXiv.2211.02559","DOI":"10.48550\/arXiv.2211.02559"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Liu, J., Byrd, G.T., Zhou, H.: Quantum circuits for dynamic runtime assertions in quantum computation. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2020, pp 1017-1030. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.36227\/techrxiv.11319929","DOI":"10.36227\/techrxiv.11319929"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-57666-4_5","volume-title":"Formal Aspects of Component Software","author":"L Luthmann","year":"2017","unstructured":"Luthmann, L., Mennicke, S., Lochau, M.: Compositionality, decompositionality and refinement in input\/output conformance testing. In: Kouchnarenko, O., Khosravi, R. (eds.) FACS 2016. LNCS, vol. 10231, pp. 54\u201372. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57666-4_5"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Mendiluze, E., Ali, S., Arcaini, P., Yue, T.: Muskit: a mutation analysis tool for quantum software testing. In: 2021 36th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 1266\u20131270 (2021). https:\/\/doi.org\/10.1109\/ASE51524.2021.967856","DOI":"10.1109\/ASE51524.2021.967856"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Miranskyy, A., 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\u201360 (2019). https:\/\/doi.org\/10.1109\/ICSE-NIER.2019.00023","DOI":"10.1109\/ICSE-NIER.2019.00023"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Miranskyy, A., Zhang, L., Doliskani, J.: On testing and debugging quantum software (2021). https:\/\/doi.org\/10.48550\/arXiv.2103.09172","DOI":"10.48550\/arXiv.2103.09172"},{"issue":"1","key":"7_CR35","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237(1), 275\u2013306 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00191-1","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR36","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"issue":"3","key":"7_CR37","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/JETCAS.2022.3202204","volume":"12","author":"T Peham","year":"2022","unstructured":"Peham, T., Burgholzer, L., Wille, R.: Equivalence checking of quantum circuits with the ZX-calculus. IEEE J. Emerg. Sel. Top. Circ. Syst. 12(3), 662\u2013675 (2022). https:\/\/doi.org\/10.1109\/JETCAS.2022.3202204","journal-title":"IEEE J. Emerg. Sel. Top. Circ. Syst."},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","DOI":"10.22331\/q-2018-08-06-79"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-61604-7_62","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R Segala","year":"1996","unstructured":"Segala, R.: Testing probabilistic automata. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 299\u2013314. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_62"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11417170_26","volume-title":"Typed Lambda Calculi and Applications","author":"P Selinger","year":"2005","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 354\u2013368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11417170_26"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"7_CR42","unstructured":"Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Softw. Concepts Tools 17(3), 103\u2013120 (1996), https:\/\/api.semanticscholar.org\/CorpusID:8056400"},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"Wang, J., Gao, M., Jiang, Y., Lou, J., Gao, Y., Zhang, D., Sun, J.: QuanFuzz: fuzz testing of quantum program (2018). https:\/\/doi.org\/10.48550\/arXiv.1810.10310","DOI":"10.48550\/arXiv.1810.10310"},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2020.08.004","volume":"116","author":"Q Wang","year":"2021","unstructured":"Wang, Q., Liu, J., Ying, M.: Equivalence checking of quantum finite-state machines. J. Comput. Syst. Sci. 116, 1\u201321 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.08.004","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR45","doi-asserted-by":"publisher","unstructured":"Wang, X., Arcaini, P., Yue, T., Ali, S.: Application of combinatorial testing to quantum programs. In: 2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS), pp. 179\u2013188 (2021). https:\/\/doi.org\/10.1109\/QRS54544.2021.00029","DOI":"10.1109\/QRS54544.2021.00029"},{"key":"7_CR46","doi-asserted-by":"publisher","unstructured":"Ying, M., Feng, Y.: Model checking quantum systems \u2014 a survey (2018). https:\/\/doi.org\/10.48550\/arXiv.1807.09466","DOI":"10.48550\/arXiv.1807.09466"},{"key":"7_CR47","unstructured":"Zhao, J.: Quantum software engineering: landscapes and horizons. CoRR abs\/2007.07047 (2020)"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72044-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:05:43Z","timestamp":1725897943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72044-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"ISBN":["9783031720437","9783031720444"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72044-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,10]]},"assertion":[{"value":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tap2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}