{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:49:24Z","timestamp":1773190164681,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031442445","type":"print"},{"value":"9783031442452","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:00:00Z","timestamp":1698105600000},"content-version":"vor","delay-in-days":296,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A quantum circuit is often executed on the initial state where each qubit is in the zero state. Therefore, we propose to perform a symbolic execution of the circuit. Our approach simulates groups of entangled qubits exactly up to a given complexity. Here, the complexity corresponds to the number of basis states expressing the quantum state of one entanglement group. By doing that, the groups need neither be determined upfront nor be bound by the number of involved qubits. Still, we ensure that the simulation runs in polynomial time - opposed to exponential time as required for the simulation of the entire circuit. The information made available at gates is exploited to remove superfluous controls and gates. We implemented our approach in the tool quantum constant propagation (QCP) and evaluated it on the circuits in the benchmark suite MQTBench. By applying our tool, only the work that cannot be carried out efficiently on a classical computer is left for the quantum computer, hence exploiting the strengths of both worlds.<\/jats:p>","DOI":"10.1007\/978-3-031-44245-2_9","type":"book-chapter","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T15:02:30Z","timestamp":1698073350000},"page":"164-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Constant Propagation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1123-1432","authenticated-orcid":false,"given":"Yanbin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5785-2528","authenticated-orcid":false,"given":"Yannick","family":"Stade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Chen, L.: Complexity-Theoretic Foundations of Quantum Supremacy Experiments (2016). https:\/\/doi.org\/10.48550\/ARXIV.1612.05903","DOI":"10.48550\/ARXIV.1612.05903"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab9359","volume":"5","author":"M Amy","year":"2020","unstructured":"Amy, M., Gheorghiu, V.: Staq - a full-stack quantum processing toolkit. Quantum Sci. Technol. 5(3), 034016 (2020). https:\/\/doi.org\/10.1088\/2058-9565\/ab9359","journal-title":"Quantum Sci. Technol."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-031-27481-7_12","volume-title":"Formal Methods","author":"F Bauer-Marquart","year":"2023","unstructured":"Bauer-Marquart, F., Leue, S., Schilling, C.: symQV: automated symbolic verification of quantum programs. In: Chechik, M., Katoen, J.P., Leucker, M. (eds.) FM 2023. LNCS, vol. 14000, pp. 181\u2013198. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_12"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Chen, Y., Stade, Y.: Artifact for Quantum Constant Propagation (2023). https:\/\/doi.org\/10.5281\/zenodo.8033829","DOI":"10.5281\/zenodo.8033829"},{"key":"9_CR5","unstructured":"Chow, J., Dial, O., Gambetta, J.: IBM Quantum breaks the 100-qubit processor barrier (2021). https:\/\/research.ibm.com\/blog\/127-qubit-quantum-processor-eagle"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505636","volume":"3","author":"AW Cross","year":"2022","unstructured":"Cross, A.W., et al.: OpenQASM 3: a broader and deeper quantum assembly language. ACM Trans. Quantum Comput. 3(3), 1\u201350 (2022). https:\/\/doi.org\/10.1145\/3505636","journal-title":"ACM Trans. Quantum Comput."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3474224","volume":"18","author":"ECR Da Rosa","year":"2022","unstructured":"Da Rosa, E.C.R., De Santiago, R.: Ket quantum programming. J. Emerg. Technol. Comput. Syst. 18(1), 1\u201325 (2022). https:\/\/doi.org\/10.1145\/3474224","journal-title":"J. Emerg. Technol. Comput. Syst."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Zhou, L.: The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size. Quantum 6, 759 (2022). https:\/\/doi.org\/10.22331\/q-2022-07-07-759","DOI":"10.22331\/q-2022-07-07-759"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21(6), 467\u2013488 (1982). https:\/\/doi.org\/10.1007\/BF02650179","journal-title":"Int. J. Theor. Phys."},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings Twenty-Eighth Annual ACM Symposium Theory Computing, STOC 1996, Philadelphia, Pennsylvania, USA, pp. 212\u2013219. ACM Press (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"25","key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.250501","volume":"125","author":"J Haferkamp","year":"2020","unstructured":"Haferkamp, J., Hangleiter, D., Bouland, A., Fefferman, B., Eisert, J., Bermejo-Vega, J.: Closing gaps of a quantum advantage with short-time Hamiltonian dynamics. Phys. Rev. Lett. 125(25), 250501 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.125.250501","journal-title":"Phys. Rev. Lett."},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-83274-2","volume-title":"Quantum Computing: An Applied Approach","author":"JD Hidary","year":"2021","unstructured":"Hidary, J.D.: Quantum Computing: An Applied Approach. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83274-2"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"798","DOI":"10.22331\/q-2022-09-08-798","volume":"6","author":"W Jang","year":"2022","unstructured":"Jang, W., et al.: Initial-state dependent optimization of controlled gate operations with quantum computer. Quantum 6, 798 (2022). https:\/\/doi.org\/10.22331\/q-2022-09-08-798","journal-title":"Quantum"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.4204\/EPTCS.318.14","volume":"318","author":"A Kissinger","year":"2020","unstructured":"Kissinger, A., van de Wetering, J.: PyZX: large scale automated diagrammatic reasoning. Electron. Proc. Theor. Comput. Sci. 318, 229\u2013241 (2020). https:\/\/doi.org\/10.4204\/EPTCS.318.14","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"issue":"7029","key":"9_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1038\/nature03350","volume":"434","author":"E Knill","year":"2005","unstructured":"Knill, E.: Quantum computing with very noisy devices. Nature 434(7029), 39\u201344 (2005). https:\/\/doi.org\/10.1038\/nature03350","journal-title":"Nature"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Liu, J., Bello, L., Zhou, H.: Relaxed peephole optimization: a novel compiler optimization for quantum circuits. In: 2021 IEEE\/ACM International Symposium on Code Generation and Optimization, CGO, Seoul, Korea (South), pp. 301\u2013314. IEEE (2021). https:\/\/doi.org\/10.1109\/CGO51591.2021.9370310","DOI":"10.1109\/CGO51591.2021.9370310"},{"key":"9_CR17","unstructured":"Markov, I.L., Saeedi, M.: Constant-Optimized Quantum Circuits for Modular Multiplication and Exponentiation (2015)"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 1st edn. Cambridge University Press (2012). https:\/\/doi.org\/10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo, A., et al.: A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5(1), 4213 (2014). https:\/\/doi.org\/10.1038\/ncomms5213","journal-title":"Nat. Commun."},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Qiskit contributors: Qiskit: an open-source framework for quantum computing (2023). https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Quetschlich, N., Burgholzer, L., Wille, R.: MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.13719","DOI":"10.48550\/arXiv.2204.13719"},{"key":"9_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17548-0","volume-title":"Compiler Design: Analysis and Transformation","author":"H Seidl","year":"2012","unstructured":"Seidl, H., Wilhelm, R., Hack, S.: Compiler Design: Analysis and Transformation. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-17548-0"},{"key":"9_CR23","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, Santa Fe, NM, USA, pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., Duncan, R.: T\\$$$|$$\\$ket\\$$$\\backslash $$rangle\\$: a retargetable compiler for NISQ devices. Quantum Sci. Technol. 6(1), 014003 (2021). https:\/\/doi.org\/10.1088\/2058-9565\/ab8e92","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"9_CR25","unstructured":"Tucci, R.R.: An Introduction to Cartan\u2019s KAK Decomposition for QC Programmers (2005)"},{"issue":"6866","key":"9_CR26","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"LMK Vandersypen","year":"2001","unstructured":"Vandersypen, L.M.K., Steffen, M., Breyta, G., Yannoni, C.S., Sherwood, M.H., Chuang, I.L.: Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance. Nature 414(6866), 883\u2013887 (2001). https:\/\/doi.org\/10.1038\/414883a","journal-title":"Nature"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Wu, X.C., Davis, M.G., Chong, F.T., Iancu, C.: QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis (2020). https:\/\/doi.org\/10.48550\/ARXIV.2012.09835","DOI":"10.48550\/ARXIV.2012.09835"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Yu, N., Palsberg, J.: Quantum abstract interpretation. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 542\u2013558. ACM, Virtual Canada (2021). https:\/\/doi.org\/10.1145\/3453483.3454061","DOI":"10.1145\/3453483.3454061"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44245-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T08:16:42Z","timestamp":1707380202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44245-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442445","9783031442452"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44245-2_9","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":"24 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"22 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/sas-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}