{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:24:58Z","timestamp":1743571498509,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/151111\/2021","10.54499\/PTDC\/CCI-COM\/4280\/2021"],"award-info":[{"award-number":["SFRH\/BD\/151111\/2021","10.54499\/PTDC\/CCI-COM\/4280\/2021"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100030861","name":"COMPETE 2020","doi-asserted-by":"publisher","award":["SFRH\/BD\/151111\/2021"],"award-info":[{"award-number":["SFRH\/BD\/151111\/2021"]}],"id":[{"id":"10.13039\/100030861","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"Fundo Social Europeu","doi-asserted-by":"crossref","award":["SFRH\/BD\/151111\/2021"],"award-info":[{"award-number":["SFRH\/BD\/151111\/2021"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["SFRH\/BD\/151111\/2021"],"award-info":[{"award-number":["SFRH\/BD\/151111\/2021"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"name":"QuantaGenomics","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"European Union\u2019s Horizon 2020","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Research Agency \u2013 AEI","award":["QuantERA\/0001\/2021"],"award-info":[{"award-number":["QuantERA\/0001\/2021"]}]},{"name":"I.P.","award":["10.54499\/PTDC\/CCI-COM\/4280\/2021"],"award-info":[{"award-number":["10.54499\/PTDC\/CCI-COM\/4280\/2021"]}]},{"DOI":"10.13039\/100007689","name":"Universidade de Aveiro","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100007689","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Secure multiparty computation (SMC) provides collaboration among multiple parties, ensuring the confidentiality of their private information. However, classical SMC implementations encounter significant security and efficiency challenges. Resorting to the entangled Greenberger\u2013Horne\u2013Zeilinger (GHZ) state, we propose a quantum-based two-party protocol to compute binary Boolean functions, with the help of a third party. We exploit a technique in which a random Z-phase rotation on the GHZ state is performed to achieve higher security. The security and complexity analyses demonstrate the feasibility and improved security of our scheme compared to other SMC Boolean function computation methods. Additionally, we implemented the proposed protocol on the IBM QisKit and found consistent outcomes that validate the protocol\u2019s correctness.\n<\/jats:p>","DOI":"10.1007\/s11128-024-04433-7","type":"journal-article","created":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T08:01:46Z","timestamp":1717228906000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secure two-party computation via measurement-based quantum computing"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6357-4923","authenticated-orcid":false,"given":"Zeinab","family":"Rahmani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2101-5896","authenticated-orcid":false,"given":"Armando Humberto Moreira Nolasco","family":"Pinto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5037-2588","authenticated-orcid":false,"given":"Luis Manuel Dias Coelho Soares","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,1]]},"reference":[{"issue":"3","key":"4433_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1049\/qtc2.12059","volume":"4","author":"Z Rahmani","year":"2023","unstructured":"Rahmani, Z., Barbosa, L.S., Pinto, A.N.: Quantum privacy-preserving service for secure lane change in vehicular networks. IET Quantum Commun. 4(3), 103\u2013111 (2023). https:\/\/doi.org\/10.1049\/qtc2.12059","journal-title":"IET Quantum Commun."},{"key":"4433_CR2","doi-asserted-by":"publisher","unstructured":"Rahmani, Z., Barbosa, L., Pinto, A.N.: Collision warning in vehicular networks based on quantum secure multiparty computation. In: II Workshop de Comunica\u00e7\u00e3o e Computa\u00e7\u00e3o Qu\u00e2ntica WQuantum, pp. 1\u20136 (2022). https:\/\/doi.org\/10.5753\/wquantum.2022.223569","DOI":"10.5753\/wquantum.2022.223569"},{"key":"4433_CR3","doi-asserted-by":"publisher","first-page":"38065","DOI":"10.1109\/ACCESS.2022.3158416","volume":"10","author":"MB Santos","year":"2022","unstructured":"Santos, M.B., Gomes, A.C., Pinto, A.N., Mateus, P.: Private computation of phylogenetic trees based on quantum technologies. IEEE Access 10, 38065\u201338088 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3158416","journal-title":"IEEE Access"},{"key":"4433_CR4","doi-asserted-by":"publisher","unstructured":"Jingzhong, W., Yue, Z., Haibin, L.: Electronic voting protocol based on ring signature and secure multi-party computing. In: 2020 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), pp. 50\u201355 (2020). IEEE. https:\/\/doi.org\/10.1109\/CyberC49757.2020.00018","DOI":"10.1109\/CyberC49757.2020.00018"},{"issue":"2","key":"4433_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999). https:\/\/doi.org\/10.1137\/S0036144598347011","journal-title":"SIAM Rev."},{"key":"4433_CR6","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp. 160\u2013164 (1982). IEEE. https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"4433_CR7","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. STOC \u201990, pp. 503\u2013513. Association for Computing Machinery, New York (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"4433_CR8","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation, pp. 351\u2013371. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3335741.3335756","DOI":"10.1145\/3335741.3335756"},{"key":"4433_CR9","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) Advances in cryptology\u2014EUROCRYPT 2011. Lecture Notes in Computer Science, vol. 6632, pp. 169\u2013188. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"4433_CR10","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology\u2014CRYPTO 2012. Lecture Notes in Computer Science, vol. 7417, pp. 643\u2013662. Springer, Berlin, Heidelberg (2012).https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"4433_CR11","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority\u2014or: breaking the spdz limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) Computer Security\u2014ESORICS 2013. Lecture Notes in Computer Science, vol. 8134, pp. 1\u201318. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"4433_CR12","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: Mascot: Faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916, pp. 830\u2013842. Association for Computing Machinery, New York (2016).https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"4433_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theoret. Comput. Sci. 560, 7\u201311 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.05.025","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4433_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s11128-021-03078-0","volume":"20","author":"T Attema","year":"2021","unstructured":"Attema, T., Bosman, J.W., Neumann, N.M.: Optimizing the decoy-state bb84 qkd protocol parameters. Quantum Inf. Process. 20(4), 154 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03078-0","journal-title":"Quantum Inf. Process."},{"key":"4433_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.062317","volume":"96","author":"M Clementi","year":"2017","unstructured":"Clementi, M., Pappa, A., Eckstein, A., Walmsley, I.A., Kashefi, E., Barz, S.: Classical multiparty computation using quantum resources. Phys. Rev. A 96, 062317 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.96.062317","journal-title":"Phys. Rev. A"},{"issue":"5","key":"4433_CR16","doi-asserted-by":"publisher","DOI":"10.1088\/0256-307X\/37\/5\/050303","volume":"37","author":"H Cao","year":"2020","unstructured":"Cao, H., Ma, W., Liu, G., L\u00fc, L., Xue, Z.-Y.: Quantum secure multiparty computation with symmetric boolean functions*. Chin. Phys. Lett. 37(5), 050303 (2020). https:\/\/doi.org\/10.1088\/0256-307X\/37\/5\/050303","journal-title":"Chin. Phys. Lett."},{"issue":"8","key":"4433_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab9aea","volume":"54","author":"C Lu","year":"2021","unstructured":"Lu, C., Miao, F., Hou, J., Su, Z., Xiong, Y.: Secure multi-party computation with a quantum manner. J. Phys. A: Math. Theor. 54(8), 085301 (2021). https:\/\/doi.org\/10.1088\/1751-8121\/ab9aea","journal-title":"J. Phys. A: Math. Theor."},{"issue":"6","key":"4433_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11128-018-1890-1","volume":"17","author":"H-Y Yang","year":"2018","unstructured":"Yang, H.-Y., Ye, T.-Y.: Secure multi-party quantum summation based on quantum Fourier transform. Quantum Inf. Process. 17(6), 129 (2018). https:\/\/doi.org\/10.1007\/s11128-018-1890-1","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"4433_CR19","doi-asserted-by":"publisher","first-page":"19655","DOI":"10.1038\/srep19655","volume":"6","author":"R-H Shi","year":"2016","unstructured":"Shi, R.-H., Mu, Y., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep. 6(1), 19655 (2016). https:\/\/doi.org\/10.1038\/srep19655","journal-title":"Sci. Rep."},{"key":"4433_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-2141-1","volume":"18","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Zhang, H., Wang, H., Wu, F., Jia, J., Wu, W.: Quantum protocols for secure multi-party summation. Quantum Inf. Process. 18, 1\u201319 (2019). https:\/\/doi.org\/10.1007\/s11128-018-2141-1","journal-title":"Quantum Inf. Process."},{"issue":"8","key":"4433_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s11128-022-03638-y","volume":"21","author":"X-Q Cai","year":"2022","unstructured":"Cai, X.-Q., Wang, T.-Y., Wei, C.-Y., Gao, F.: Cryptanalysis of secure multiparty quantum summation. Quantum Inf. Process. 21(8), 285 (2022). https:\/\/doi.org\/10.1007\/s11128-022-03638-y","journal-title":"Quantum Inf. Process."},{"key":"4433_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.48550\/arXiv.quant-ph\/0508124","volume":"199","author":"R Jozsa","year":"2006","unstructured":"Jozsa, R.: An introduction to measurement based quantum computation. NATO Sci. Ser., III: Comput. Syst. Sci. Quantum Inf. Process.-From Theory Exp. 199, 137\u2013158 (2006). https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/0508124","journal-title":"NATO Sci. Ser., III: Comput. Syst. Sci. Quantum Inf. Process.-From Theory Exp."},{"issue":"1","key":"4433_CR23","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., Nest, M.V.: Measurement-based quantum computation. Nat. Phys. 5(1), 19\u201326 (2009). https:\/\/doi.org\/10.1038\/nphys1157","journal-title":"Nat. Phys."},{"issue":"3","key":"4433_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11128-023-03870-0","volume":"22","author":"W Li","year":"2023","unstructured":"Li, W., Ma, X., Lee, Y.-H., Zhang, Y., Gu, Y.: Finding new multipartite entangled resources for measurement-based quantum computation. Quantum Inf. Process. 22(3), 130 (2023). https:\/\/doi.org\/10.1007\/s11128-023-03870-0","journal-title":"Quantum Inf. Process."},{"key":"4433_CR25","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R Raussendorf","year":"2001","unstructured":"Raussendorf, R., Briegel, H.J.: A one-way quantum computer. Phys. Rev. Lett. 86, 5188\u20135191 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.86.5188","journal-title":"Phys. Rev. Lett."},{"key":"4433_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.042323","volume":"71","author":"MA Nielsen","year":"2005","unstructured":"Nielsen, M.A., Dawson, C.M.: Fault-tolerant quantum computation with cluster states. Phys. Rev. A 71, 042323 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.71.042323","journal-title":"Phys. Rev. A"},{"key":"4433_CR27","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1103\/PhysRevLett.86.910","volume":"86","author":"HJ Briegel","year":"2001","unstructured":"Briegel, H.J., Raussendorf, R.: Persistent entanglement in arrays of interacting particles. Phys. Rev. Lett. 86, 910\u2013913 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.86.910","journal-title":"Phys. Rev. Lett."},{"issue":"2\u20133","key":"4433_CR28","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/S0375-9601(02)01803-0","volume":"308","author":"MA Nielsen","year":"2003","unstructured":"Nielsen, M.A.: Quantum computation by measurement and quantum memory. Phys. Lett. A 308(2\u20133), 96\u2013100 (2003). https:\/\/doi.org\/10.1016\/S0375-9601(02)01803-0","journal-title":"Phys. Lett. A"},{"key":"4433_CR29","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 517\u2013526 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.36","DOI":"10.1109\/FOCS.2009.36"},{"key":"4433_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003). https:\/\/doi.org\/10.1103\/PhysRevA.68.022312","journal-title":"Phys. Rev. A"},{"key":"4433_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.81.062336","volume":"81","author":"K Loukopoulos","year":"2010","unstructured":"Loukopoulos, K., Browne, D.E.: Secure multiparty computation with a dishonest majority via quantum means. Phys. Rev. A 81, 062336 (2010). https:\/\/doi.org\/10.1103\/PhysRevA.81.062336","journal-title":"Phys. Rev. A"},{"key":"4433_CR32","doi-asserted-by":"publisher","unstructured":"Li, Y.-B., Wen, Q.-Y., Qin, S.-j.: Comment on \u201csecure multiparty computation with a dishonest majority via quantum means\u201d. Phys. Rev. A 84, 016301 (2011). https:\/\/doi.org\/10.1103\/PhysRevA.84.016301","DOI":"10.1103\/PhysRevA.84.016301"},{"key":"4433_CR33","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10773-012-1319-z","volume":"52","author":"Y-B Li","year":"2013","unstructured":"Li, Y.-B., Wen, Q.-Y., Qin, S.-J.: Improved secure multiparty computation with a dishonest majority via quantum means. Int. J. Theor. Phys. 52, 199\u2013205 (2013). https:\/\/doi.org\/10.1007\/s10773-012-1319-z","journal-title":"Int. J. Theor. Phys."},{"key":"4433_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.102.050502","volume":"102","author":"J Anders","year":"2009","unstructured":"Anders, J., Browne, D.E.: Computational power of correlations. Phys. Rev. Lett. 102, 050502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.102.050502","journal-title":"Phys. Rev. Lett."},{"issue":"8","key":"4433_CR35","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1119\/1.16503","volume":"58","author":"ND Mermin","year":"1990","unstructured":"Mermin, N.D.: Quantum mysteries revisited. Am. J. Phys. 58(8), 731\u2013734 (1990). https:\/\/doi.org\/10.1119\/1.16503","journal-title":"Am. J. Phys."},{"issue":"1\u20132","key":"4433_CR36","doi-asserted-by":"publisher","first-page":"61","DOI":"10.26421\/QIC16.1-2-5","volume":"16","author":"V Dunjko","year":"2016","unstructured":"Dunjko, V., Kapourniotis, T., Kashefi, E.: Quantum-enhanced secure delegated classical computing. Quantum Inf. Comput. 16(1\u20132), 61\u201386 (2016). https:\/\/doi.org\/10.26421\/QIC16.1-2-5","journal-title":"Quantum Inf. Comput."},{"issue":"1","key":"4433_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s11047-012-9353-6","volume":"12","author":"W Dam","year":"2012","unstructured":"Dam, W.: Implausible consequences of superstrong nonlocality. Nat. Comput. 12(1), 9\u201312 (2012). https:\/\/doi.org\/10.1007\/s11047-012-9353-6","journal-title":"Nat. Comput."},{"key":"4433_CR38","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","volume":"56","author":"H-K Lo","year":"1997","unstructured":"Lo, H.-K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154\u20131162 (1997). https:\/\/doi.org\/10.1103\/PhysRevA.56.1154","journal-title":"Phys. Rev. A"},{"key":"4433_CR39","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/2438\/1\/012148","author":"MS Anis","year":"2021","unstructured":"Anis, M.S., Abraham, H., AduOffei, R.A., Agliardi, G., Aharoni, M., Akhalwaya, I.Y., Aleksandrowicz, G., Alexander, T., Amy, M., Anagolum, S.: Qiskit: an open-source framework for quantum computing. Qiskit\/qiskit (2021). https:\/\/doi.org\/10.1088\/1742-6596\/2438\/1\/012148","journal-title":"Qiskit\/qiskit"},{"key":"4433_CR40","unstructured":"Paddle Quantum (2020). https:\/\/github.com\/PaddlePaddle\/Quantum"},{"key":"4433_CR41","doi-asserted-by":"publisher","unstructured":"Kashif, M., Al-Kuwari, S.: Qiskit as a simulation platform for measurement-based quantum computation. In: 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), pp. 152\u2013159 (2022). https:\/\/doi.org\/10.1109\/ICSA-C54293.2022.00037","DOI":"10.1109\/ICSA-C54293.2022.00037"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04433-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04433-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04433-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T11:23:19Z","timestamp":1720005799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04433-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,1]]},"references-count":41,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["4433"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04433-7","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2024,6,1]]},"assertion":[{"value":"15 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2024","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 that they have no Conflict of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"221"}}