{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:32:31Z","timestamp":1770283951807,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031321566","type":"print"},{"value":"9783031321573","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32157-3_1","type":"book-chapter","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T15:11:26Z","timestamp":1682953886000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Implementation of\u00a0LIMDDs for\u00a0Quantum Circuit Simulation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8199-0901","authenticated-orcid":false,"given":"Lieuwe","family":"Vinkhuijzen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-488X","authenticated-orcid":false,"given":"Thomas","family":"Grurl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1089-3263","authenticated-orcid":false,"given":"Stefan","family":"Hillmich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7666-2794","authenticated-orcid":false,"given":"Sebastiaan","family":"Brand","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4993-7860","authenticated-orcid":false,"given":"Robert","family":"Wille","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-4174","authenticated-orcid":false,"given":"Alfons","family":"Laarman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Symposium on Theory of Computing, pp. 212\u2013219 (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2018.v014a015","volume":"14","author":"A Montanaro","year":"2018","unstructured":"Montanaro, A.: Quantum-walk speedup of backtracking algorithms. Theor. Comput. 14(1), 1\u201324 (2018)","journal-title":"Theor. Comput."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Gily\u00e9n, A., Jeffery, S., Kokainis, M.: Quadratic speedup for finding marked vertices by quantum walks. In: Symposium on Theory of Computing, pp. 412\u2013424 (2020)","DOI":"10.1145\/3357713.3384252"},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comp."},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1038\/nchem.483","volume":"2","author":"BP Lanyon","year":"2010","unstructured":"Lanyon, B.P., et al.: Towards quantum chemistry on a quantum computer. Nat. Chem. 2(2), 106 (2010)","journal-title":"Nat. Chem."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Kueng, R., Wille, R.: Random stimuli generation for the verification of quantum circuits. In: Asia and South Pacific Design Automation Conference, pp. 767\u2013772, New York, NY, USA,: Association for Computing Machinery. ISBN 9781450379991 (2021)","DOI":"10.1145\/3394885.3431590"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Burgholzer, L., Wille, R.: Advanced equivalence checking for quantum circuits. IEEE Trans. on CAD Integr. Circ. Sys., 40(9):1810\u20131824 (2021). https:\/\/doi.org\/10.1109\/TCAD.2020.3032630","DOI":"10.1109\/TCAD.2020.3032630"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Raymond, R., Wille, R.: Verifying results of the IBM Qiskit quantum circuit compilation flow. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 356\u2013365. IEEE (2020)","DOI":"10.1109\/QCE49297.2020.00051"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Carette, J., Ortiz, G., Sabry, A.: Symbolic execution of hadamard-toffoli quantum circuits. In: Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, pp. 14\u201326 (2023)","DOI":"10.1145\/3571786.3573018"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: Qaoa for max-cut requires hundreds of qubits for quantum speed-up. Scientific Reports, 9(1), 6903 (2019). ISSN 2045\u20132322. https:\/\/doi.org\/10.1038\/s41598-019-43176-9","DOI":"10.1038\/s41598-019-43176-9"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Jones, T., Brown, A., Bush, I., Benjamin, S.C.: Quest and high performance simulation of quantum computers. Scientific Reports, 9(1), 10736 (2019). ISSN 2045\u20132322. https:\/\/doi.org\/10.1038\/s41598-019-47174-9","DOI":"10.1038\/s41598-019-47174-9"},{"key":"1_CR12","unstructured":"Gottesman, D.: Stabilizer codes and quantum error correction (1997)"},{"issue":"5","key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328","volume":"70","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5), 052328 (2004)","journal-title":"Phys. Rev. A"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","volume":"57","author":"D Gottesman","year":"1998","unstructured":"Gottesman, D.: Theory of fault-tolerant quantum computation. Phys. Rev. A 57, 127\u2013137 (1998)","journal-title":"Phys. Rev. A"},{"key":"1_CR15","unstructured":"Gottesman, D.: Stabilizer codes and quantum error correction. California Institute of Technology (1997)"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Bennett, C.H., Bernstein, H.J., Popescu, S., Schumacher, B.: Concentrating partial entanglement by local operations. Phys. Rev. A, 53, (1996). https:\/\/doi.org\/10.1103\/PhysRevA.53.2046","DOI":"10.1103\/PhysRevA.53.2046"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Browne, D., Briegel, H.: One-way quantum computation. Quantum information: From foundations to quantum technology applications, pp. 449\u2013473 (2016)","DOI":"10.1002\/9783527805785.ch21"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Dijk, T.M., Wille, R., Meolic, R.: Tagged BDDs: Combining reduction rules from different decision diagram types. In: Stewart, D., Weissenbacher, G., editors, Formal Methods in CAD, 2017. https:\/\/doi.org\/10.23919\/FMCAD.2017.8102248","DOI":"10.23919\/FMCAD.2017.8102248"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinational problems. In: Design Automation Conference, pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of Boolean functions using a graphical representation. In: Design Automation Conference, pp. 688\u2013694 (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Bryant, R.E., Chen, Y.A.: Verification of arithmetic circuits with binary moment diagrams. In: Design Automation Conference, pp. 535\u2013541 (1995)","DOI":"10.21236\/ADA281028"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Drechsler, R., Sarabi, A., Theobald, M., Becker, B., Perkowski, M.A.: Efficient representation and manipulation of switching functions based on Ordered Kronecker Functional Decision Diagrams. In: Lorenzetti, M.J., editor, Design Automation Conference, pp. 415\u2013419 (1994). https:\/\/doi.org\/10.1145\/196244.196444","DOI":"10.1145\/196244.196444"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Abdollahi, A., Pedram, M.: Analysis and synthesis of quantum circuits by using quantum decision diagrams. In: Design, Automation and Test in Europe, pp. 317\u2013322 (2006)","DOI":"10.1109\/DATE.2006.244176"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Wang, S.-A., Lu, C.-Y., Tsai, I.-M., Kuo, S.-Y.: An XQDD-based verification method for quantum circuits. IEICE Trans. Fundamentals, 91-A(2), 584\u2013594 (2008)","DOI":"10.1093\/ietfec\/e91-a.2.584"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Viamontes, G.F., Markov, I.L., Hayes J.P.: Quantum Circuit Simulation. Springer (2009). ISBN 978-90-481-3064-1. https:\/\/doi.org\/10.1007\/978-90-481-3065-8","DOI":"10.1007\/978-90-481-3065-8"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Niemann, P., Wille, R., Miller, D.M., Thornton, M.A., Drechsler, R.: QMDDs: Efficient quantum function representation and manipulation. IEEE Trans. on CAD of Integr. Circ. Sys. 35(1), 86\u201399 (2016). https:\/\/doi.org\/10.1109\/TCAD.2015.2459034","DOI":"10.1109\/TCAD.2015.2459034"},{"key":"1_CR27","unstructured":"Vinkhuijzen, L., Coopmans, T., Elkouss, D., Dunjko, V., Laarman, A.: LIMDD: A decision diagram for simulation of quantum computing including stabilizer states. CoRR, abs\/2108.00931, 2021. arxiv.org\/abs\/2108.00931"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Hillmich, S., Wille, R.: How to efficiently handle complex values? Implementing decision diagrams for quantum computing. In: David Z. Pan, editor, International Conference on CAD, pp. 1\u20137, 2019. https:\/\/doi.org\/10.1109\/ICCAD45719.2019.8942057","DOI":"10.1109\/ICCAD45719.2019.8942057"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Thornton, M.A.: QMDD: A decision diagram structure for reversible and quantum circuits. In: 36th International Symposium on Multiple-Valued Logic (ISMVL\u201906), pp. 30\u201330. IEEE (2006)","DOI":"10.1109\/ISMVL.2006.35"},{"key":"1_CR30","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press (2016). ISBN 978-1-10-700217-3. www.cambridge.org\/de\/academic\/subjects\/physics\/quantum-physics-quantum-information-and-quantum-computation\/quantum-computation-and-quantum-information-10th-anniversary-edition?format=HB"},{"issue":"1969","key":"1_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1098\/rspa.1998.0163","volume":"454","author":"R Jozsa","year":"1998","unstructured":"Jozsa, R.: Quantum algorithms and the fourier transform. Royal Society London. Series A 454(1969), 323\u2013337 (1998)","journal-title":"Royal Society London. Series A"},{"key":"1_CR32","unstructured":"Kueng, R., Gross, D.: Qubit stabilizer states are complex projective 3-designs. arXiv preprint arXiv:1510.02767 (2015)"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Wille, R.: Advanced simulation of quantum computations. IEEE Trans. on CAD of Integr. Circ. and Sys. 38(5), 848\u2013859 (2019). https:\/\/doi.org\/10.1109\/TCAD.2018.2834427","DOI":"10.1109\/TCAD.2018.2834427"},{"key":"1_CR34","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 3.0.0. http:\/\/www.vlsi.colorado.edu\/~fabio\/"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2013.07.009","volume":"296","author":"T Van Dijk","year":"2013","unstructured":"Van Dijk, T., Laarman, A., Van De Pol, J.: Multi-core BDD operations for symbolic reachability. Electronic Notes Theor. Comput. Sci. 296, 127\u2013143 (2013)","journal-title":"Electronic Notes Theor. Comput. Sci."},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Lv, G., Chen, Y., Feng, Y., Chen, Q.L., Su, K.: A succinct and efficient implementation of a $$2^{32}$$ BDD package. In: Margaria, T., Qiu, Z., Yang, H., eds, International Symposium on Theoretical Aspects of Software Engineering, pp. 241\u2013244, 2012. https:\/\/doi.org\/10.1109\/TASE.2012.22","DOI":"10.1109\/TASE.2012.22"},{"key":"1_CR37","unstructured":"Herbstritt, M.: wld: A C++ library for decision diagrams. http:\/\/www.ira.informatik.uni-freiburg.de\/software\/wld\/ (2004)"},{"key":"1_CR38","unstructured":"Knuth, D.E.: The art of computer programming: Binary decision diagrams. http:\/\/www-cs-faculty.stanford.edu\/knuth\/programs.html (2011)"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: Smith, R.C., editor, Design Automation Conference, pp. 40\u201345, 1990. https:\/\/doi.org\/10.1145\/123186.123222","DOI":"10.1145\/123186.123222"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Hillmich, S., Markov, I.L., Wille, R.: Just like the real thing: Fast weak simulation of quantum computation. In: Design Automation Conference, pp. 1\u20136. IEEE (2020). https:\/\/doi.org\/10.1109\/DAC18072.2020.9218555","DOI":"10.1109\/DAC18072.2020.9218555"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Wille, R., Hillmich, S., Burgholzer, L.: JKQ: JKU tools for quantum computing. In Int\u2019l Conference on CAD, pp. 154:1\u2013154:5 (2020). https:\/\/doi.org\/10.1145\/3400302.3415746","DOI":"10.1145\/3400302.3415746"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32157-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T15:13:41Z","timestamp":1682954021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32157-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031321566","9783031321573"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32157-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Model Checking Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spin2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spin-web.github.io\/SPIN2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}