{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:56:41Z","timestamp":1782925001782,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100007928","name":"Ningbo Science and Technology Bureau","doi-asserted-by":"crossref","award":["2025S114"],"award-info":[{"award-number":["2025S114"]}],"id":[{"id":"10.13039\/501100007928","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007928","name":"Ningbo Municipal Bureau of Science and Technology","doi-asserted-by":"publisher","award":["2025QL055"],"award-info":[{"award-number":["2025QL055"]}],"id":[{"id":"10.13039\/501100007928","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s42484-026-00403-7","type":"journal-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:49:50Z","timestamp":1780991390000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["StateQ: A novel framework for intuitive and accessible quantum programming"],"prefix":"10.1007","volume":"8","author":[{"given":"Jiawen","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongdong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"He","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongzhen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianxiang","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yujian","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"403_CR1","doi-asserted-by":"publisher","unstructured":"Altenkirch T, Grattage J. A functional quantum programming language. In: 20th Annual IEEE Symposium on Logic in Computer Science (LICS\u2019 05). IEEE. https:\/\/doi.org\/10.1109\/lics.2005.1","DOI":"10.1109\/lics.2005.1"},{"issue":"1","key":"403_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/LMCS-13(1:8)2017","volume":"13","author":"P Arrighi","year":"2005","unstructured":"Arrighi P, Dowek G (2005) Lineal: a linear-algebraic lambda-calculus. Logical Methods Comput Sci 13(1):1\u20138. https:\/\/doi.org\/10.23638\/LMCS-13(1:8)2017","journal-title":"Logical Methods Comput Sci"},{"issue":"9","key":"403_CR3","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/9\/093021","volume":"16","author":"M Backens","year":"2014","unstructured":"Backens M (2014) The zx-calculus is complete for stabilizer quantum mechanics. New J Phys 16(9):093021","journal-title":"New J Phys"},{"issue":"5","key":"403_CR4","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/physreva.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco A, Bennett CH, Cleve R, DiVincenzo DP, Margolus N, Shor P, Sleator T, Smolin JA, Weinfurter H (1995) Elementary gates for quantum computation. Phys Rev A 52(5):3457\u20133467. https:\/\/doi.org\/10.1103\/physreva.52.3457","journal-title":"Phys Rev A"},{"key":"403_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.4204\/eptcs.95.2","volume":"95","author":"J Barratt","year":"2012","unstructured":"Barratt J (2012) On the automation of encoding processes in the quantum IO monad. Electron Proc Theor Comput Sci 95:15\u201319. https:\/\/doi.org\/10.4204\/eptcs.95.2","journal-title":"Electron Proc Theor Comput Sci"},{"key":"403_CR6","doi-asserted-by":"crossref","unstructured":"Beauregard S (2003) Circuit for Shor\u2019s algorithm using 2n+3 qubits","DOI":"10.26421\/QIC3.2-8"},{"key":"403_CR7","doi-asserted-by":"publisher","unstructured":"Bergholm V, Vartiainen JJ, M\u00f6tt\u00f6nen M, Salomaa MM (2005) Quantum circuits with uniformly controlled one-qubit gates. Phys Rev A 71(5). https:\/\/doi.org\/10.1103\/physreva.71.052330","DOI":"10.1103\/physreva.71.052330"},{"key":"403_CR8","unstructured":"Cambier T (2024) GitHub - Quantum Computing with Silq Programming, published by Packt. https:\/\/github.com\/PacktPublishing\/Quantum-Computing-with-Silq-Programming. Accessed 05 Jan 2024"},{"key":"403_CR9","unstructured":"Community Q (2023) GitHub - qiskit-community\/qiskit-algorithms: A library of quantum algorithms for Qiskit. https:\/\/github.com\/qiskit-community\/qiskit-algorithms. Accessed 27 Nov 2023"},{"key":"403_CR11","doi-asserted-by":"publisher","unstructured":"Cross A, Javadi-Abhari A, Alexander T, Beaudrap N, Bishop LS, Heidel S, Ryan CA, Sivarajah P, Smolin JM, Gambetta JM, Johnson BR (2022) Openqasm 3: a broader and deeper quantum assembly language. ACM Transactions on Quantum Computing. https:\/\/doi.org\/10.1145\/3505636","DOI":"10.1145\/3505636"},{"key":"403_CR10","unstructured":"Cross AW, Bishop LS, Smolin JA, Gambetta JM (2017) Open quantum assembly language"},{"issue":"1907","key":"403_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch D, Jozsa R (1992) Rapid solution of problems by quantum computation. Proc R Soc Lond Ser A 439(1907):553\u2013558. https:\/\/doi.org\/10.1098\/rspa.1992.0167","journal-title":"Proc R Soc Lond Ser A"},{"key":"403_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.22331\/q-2020-06-04-279","volume":"4","author":"R Duncan","year":"2020","unstructured":"Duncan R, Kissinger A, Perdrix S, Van De Wetering J (2020) Graph-theoretic simplification of quantum circuits with the zx-calculus. Quantum 4:279","journal-title":"Quantum"},{"issue":"3","key":"403_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1103\/RevModPhys.68.733","volume":"68","author":"A Ekert","year":"1996","unstructured":"Ekert A, Jozsa R (1996) Quantum computation and shor\u2019s factoring algorithm. Rev Mod Phys 68(3):733","journal-title":"Rev Mod Phys"},{"key":"403_CR15","unstructured":"Google (2018) Cirq: a Python library for writing, manipulating, and optimizing quantum circuits and running them against quantum computers and simulators. https:\/\/github.com\/quantumlib\/Cirq"},{"key":"403_CR16","unstructured":"Google (2023) GitHub - quantumlib\/Cirq: A python framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits. https:\/\/github.com\/quantumlib\/Cirq. Accessed 27 Nov 2023"},{"issue":"6","key":"403_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/2499370.2462177","volume":"48","author":"AS Green","year":"2013","unstructured":"Green AS, Lumsdaine PL, Ross NJ, Selinger P, Valiron B (2013) Quipper: a scalable quantum programming language. ACM SIGPLAN Notices 48(6):333\u2013342. https:\/\/doi.org\/10.1145\/2499370.2462177","journal-title":"ACM SIGPLAN Notices"},{"key":"403_CR18","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search","DOI":"10.1145\/237814.237866"},{"key":"403_CR19","unstructured":"IBM (2023) GitHub - Qiskit\/qiskit: Qiskit is an open-source SDK for working with quantum computers at the level of extended quantum circuits, operators, and primitives. https:\/\/github.com\/Qiskit\/qiskit. Accessed 27 Nov 2023"},{"issue":"1969","key":"403_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1098\/rspa.1998.0163","volume":"454","author":"R Jozsa","year":"1998","unstructured":"Jozsa R (1998) Quantum algorithms and the fourier transform. Proc R Soc London Ser A Math Phys Eng Sci 454(1969):323\u2013337","journal-title":"Proc R Soc London Ser A Math Phys Eng Sci"},{"key":"403_CR21","unstructured":"Kissinger A (2020) Github - Quantomatic\/quizx: A speedy Rust port of PyZX. https:\/\/github.com\/Quantomatic\/quizx. Accessed 12 Jan 2024"},{"key":"403_CR22","unstructured":"Koch M, Lawrence A, Singhal K, Sivarajah S, Duncan R (2025) GUPPY: pythonic quantum-classical programming. arxiv:2510.12582"},{"issue":"3","key":"403_CR24","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1002\/nla.1839","volume":"20","author":"SJ Leon","year":"2013","unstructured":"Leon SJ, Bj\u00f6rck \u00c5, Gander W (2013) Gram-schmidt orthogonalization: 100 years and more. Numer Linear Algebr Appl 20(3):492\u2013532","journal-title":"Numer Linear Algebr Appl"},{"key":"403_CR23","unstructured":"Le\u00e3o T (2019) GitHub - ShorAlgQiskit. https:\/\/github.com\/ttlion\/ShorAlgQiskit\/blob\/master\/Shor_Normal_QFT.py. Accessed 26 Nov 2023"},{"key":"403_CR25","unstructured":"Microsoft (2023) GitHub - microsoft\/qsharp. https:\/\/github.com\/microsoft\/qsharp. Accessed 27 Nov 2023"},{"key":"403_CR26","doi-asserted-by":"publisher","unstructured":"Qiskit contributors (2023) Qiskit: an open-source framework for quantum computing. https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"403_CR27","doi-asserted-by":"crossref","unstructured":"Sabry A, Valiron B, Vizzotto JK (2018) From symmetric pattern-matching to quantum control (Extended Version)","DOI":"10.1007\/978-3-319-89366-2_19"},{"key":"403_CR28","unstructured":"Seidel R, Bock S, Zander R, Petri\u010d M, Steinmann N, Tcholtchev N, Hauswirth M (2024) Qrisp: a framework for compilable high-level programming of gate-based quantum computers. arxiv:2406.14792"},{"issue":"4","key":"403_CR29","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S096012950400422X","volume":"14","author":"P Selinger","year":"2004","unstructured":"Selinger P (2004) Towards a quantum programming language. Math Struct Comput Sci 14(4):527\u2013586. https:\/\/doi.org\/10.1017\/S096012950400422X","journal-title":"Math Struct Comput Sci"},{"issue":"6","key":"403_CR31","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/tcad.2005.855930","volume":"25","author":"VV Shende","year":"2006","unstructured":"Shende VV, Bullock SS, Markov IL (2006) Synthesis of quantum-logic circuits. IEEE Trans Comput Aided Des Integr Circuits Syst 25(6):1000\u20131010. https:\/\/doi.org\/10.1109\/tcad.2005.855930","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"403_CR30","doi-asserted-by":"publisher","unstructured":"Shende VV, Markov IL, Bullock SS (2004) Minimal universal two-qubit controlled-NOT-based circuits. Phys Rev A 69(6). https:\/\/doi.org\/10.1103\/physreva.69.062321","DOI":"10.1103\/physreva.69.062321"},{"issue":"5","key":"403_CR32","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/s0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484\u20131509. https:\/\/doi.org\/10.1137\/s0097539795293172","journal-title":"SIAM J Comput"},{"key":"403_CR33","unstructured":"Siddiqui S, Islam MJ, Shehab O (2014) Five quantum algorithms using quipper"},{"key":"403_CR34","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-008-9215-6","volume":"50","author":"BD Sutton","year":"2009","unstructured":"Sutton BD (2009) Computing the complete cs decomposition. Numer Algorithms 50:33\u201365","journal-title":"Numer Algorithms"},{"key":"403_CR35","first-page":"1","volume":"2018","author":"KM Svore","year":"2018","unstructured":"Svore KM, Geller A, Troyer M, Azariah J, Granade C, Heim B, Kliuchnikov V, Mykhailova M, Paz A, Roetteler M (2018) Q# enabling scalable quantum computing and development with a high-level dsl. Proc Real World Domain Spec Lang Workshop 2018:1\u201310","journal-title":"Proc Real World Domain Spec Lang Workshop"},{"issue":"4","key":"403_CR36","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389653","volume":"46","author":"C Van Loan","year":"1985","unstructured":"Van Loan C (1985) Computing the cs and the generalized singular value decompositions. Numer Math 46(4):479\u2013491","journal-title":"Numer Math"},{"issue":"5","key":"403_CR37","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1137\/S0097539703432165","volume":"33","author":"A Van Tonder","year":"2004","unstructured":"Van Tonder A (2004) A lambda calculus for quantum computation. SIAM J Comput 33(5):1109\u20131135. https:\/\/doi.org\/10.1137\/S0097539703432165","journal-title":"SIAM J Comput"},{"key":"403_CR38","doi-asserted-by":"crossref","unstructured":"Vax M, Emanuel P, Cornfeld E, Reichental I, Opher O, Roth O, Michaeli T, Preminger L, Gazit L, Naveh A, Naveh Y (2025) Qmod: expressive high-level quantum modeling. arxiv:2502.19368","DOI":"10.1109\/QSW67625.2025.00026"},{"issue":"POPL","key":"403_CR39","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/3571225","volume":"7","author":"F Voichick","year":"2023","unstructured":"Voichick F, Li L, Rand R, Hicks M (2023) Qunity: a unified language for quantum and classical computing. Proc ACM Program Lang 7(POPL):921\u2013951. https:\/\/doi.org\/10.1145\/3571225","journal-title":"Proc ACM Program Lang"},{"key":"403_CR40","unstructured":"Wetering J (2020) Zx-calculus for the working quantum computer scientist. arXiv preprint arXiv:2012.13966"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00403-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-026-00403-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-026-00403-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:37:03Z","timestamp":1782923823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-026-00403-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["403"],"URL":"https:\/\/doi.org\/10.1007\/s42484-026-00403-7","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"30 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"60"}}