{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:07:32Z","timestamp":1742958452178,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-981-96-1093-8_18","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:36Z","timestamp":1739999916000},"page":"214-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Generalized Deutsch-Jozsa Algorithm"],"prefix":"10.1007","author":[{"given":"Hao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daowen","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"issue":"5","key":"18_CR1","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. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC\u201996, New York, USA, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"18_CR3","doi-asserted-by":"publisher","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)","journal-title":"Phys. Rev. Lett."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R de Wolf","year":"2002","unstructured":"de Wolf, R.: Quantum communication and complexity. Theor. Comput. Sci. 287(1), 337\u2013353 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR6","first-page":"1","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H Buhrman","year":"2003","unstructured":"Buhrman, H., R\u00f6hrig, H.: Distributed quantum computing. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) Mathematical Foundations of Computer Science 2003, pp. 1\u201320. Springer, Heidelberg (2003)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Beals, R., et al.: Efficient distributed quantum computing. Proc. Math. Phys. Eng. Sci. 469 (2153) (2013)","DOI":"10.1098\/rspa.2012.0686"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ipl.2016.12.002","volume":"120","author":"K Li","year":"2017","unstructured":"Li, K., Qiu, D., Li, L., Zheng, S., Rong, Z.: Application of distributed semiquantum computing model in phase estimation. Inf. Process. Lett. 120, 23\u201329 (2017)","journal-title":"Inf. Process. Lett."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Caleffi, M., Cacciapuoti, A.S., Bianchi, G.: Quantum internet: from communication to distributed computing! In: Proceedings of the 5th ACM International Conference on Nanoscale Computing and Communication, pp. 1-4. ACM, New York, USA (2018)","DOI":"10.1145\/3233188.3233224"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Le Gall, F., Magniez, F.: Sublinear-time quantum computation of the diameter in CONGEST networks. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC\u201918, New York, USA, pp. 337\u2013346. ACM (2018)","DOI":"10.1145\/3212734.3212744"},{"key":"18_CR11","unstructured":"Le Gall, F., Nishimura, H., Rosmanis, A.: Quantum advantage for the LOCAL model in distributed computing. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 126, pp. 49:1\u201349:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"18_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.104.052404","volume":"104","author":"J Avron","year":"2021","unstructured":"Avron, J., Casper, O., Rozen, I.: Quantum advantage and noise reduction in distributed quantum computing. Phys. Rev. A 104, 052404 (2021)","journal-title":"Phys. Rev. A"},{"key":"18_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114461","volume":"993","author":"D Qiu","year":"2024","unstructured":"Qiu, D., Luo, L., Xiao, L.: Distributed Grover\u2019s algorithm. Theor. Comput. Sci. 993, 114461 (2024). arXiv:2204.10487","journal-title":"Theor. Comput. Sci."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Tan, J., Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed quantum algorithm for Simon\u2019s problem. Phys. Rev. A 106, 032417 (2022). arXiv:2204.11388","DOI":"10.1103\/PhysRevA.106.032417"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed Shor\u2019s algorithm. Quantum Inf. Comput. 23, 27\u201344 (2022). arXiv:2207.05976","DOI":"10.26421\/QIC23.1-2-3"},{"key":"18_CR16","unstructured":"Xiao, L., Qiu, D., Luo, L., Mateus, P.: Distributed quantum-classical hybrid Shor\u2019s algorithm (2023). arXiv:2304.12100"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Li, H., Qiu, D., Luo, L.: Distributed exact quantum algorithms for Deutsch-Jozsa problem (2023). arXiv:2303.10663","DOI":"10.2139\/ssrn.4698889"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Li, H., Qiu, D., Luo, L.: Exact distributed quantum algorithm for generalized Simon\u2019s problem. Acta Inform. 61(1) (2024). arXiv:2307.14315","DOI":"10.1007\/s00236-024-00455-x"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"51305","DOI":"10.1007\/s11467-023-1327-x","volume":"18","author":"X Zhou","year":"2023","unstructured":"Zhou, X., Qiu, D., Luo, L.: Distributed exact Grover\u2019s algorithm. Front. Phys. 18, 51305 (2023)","journal-title":"Front. Phys."},{"key":"18_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.129209","volume":"629","author":"X Zhou","year":"2023","unstructured":"Zhou, X., Qiu, D., Luo, L.: Distributed Bernstein-Vazirani algorithm. Phys. A 629, 129209 (2023)","journal-title":"Phys. A"},{"key":"18_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.062331","volume":"97","author":"D Qiu","year":"2018","unstructured":"Qiu, D., Zheng, S.: Generalized Deutsch-Jozsa problem and the optimal quantum algorithm. Phys. Rev. A 97, 062331 (2018)","journal-title":"Phys. Rev. A"},{"key":"18_CR22","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.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 439, 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"18_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104605","volume":"275","author":"D Qiu","year":"2020","unstructured":"Qiu, D., Zheng, S.: Revisiting Deutsch-Jozsa algorithm. Inf. Comput. 275, 104605 (2020)","journal-title":"Inf. Comput."},{"issue":"3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S2010324721400014","volume":"11","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Xu, G.: Exact Quantum 1-Query Algorithms and Complexity. SPIN 11(3), 1\u201310 (2021)","journal-title":"SPIN"},{"key":"18_CR25","unstructured":"Qiu, D., Zheng, S.: Characterizations of symmetrically partial Boolean functions with exact quantum query complexity (2016). arXiv:1603.06505"},{"key":"18_CR26","unstructured":"Ambainis, A., Iraids, J., Smotrovs, J.: Exact quantum query complexity of EXACT and THRESHOLD. In: Severini, S., Brandao, F. (eds.) 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 22, pp. 263\u2013269. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013)"},{"issue":"2","key":"18_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S Even","year":"1984","unstructured":"Even, S., Selman, A.L., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Inf. Control 61(2), 159\u2013173 (1984)","journal-title":"Inf. Control"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) On Promise Problems: A Survey, pp. 254-290. Springer, Heidelberg (2006)","DOI":"10.1007\/11685654_12"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00453-013-9826-8","volume":"71","author":"A Montanaro","year":"2015","unstructured":"Montanaro, A., Jozsa, R., Mitchison, G.: On exact quantum query complexity. Algorithmica 71, 775\u2013796 (2015)","journal-title":"Algorithmica"},{"key":"18_CR30","unstructured":"Chi, D. P., Kim, J., Lee, S.: Quantum algorithm for generalized Deutsch-Jozsa problem (2000). arXiv:0005059"},{"issue":"3","key":"18_CR31","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S0960129515000158","volume":"27","author":"J Gruska","year":"2017","unstructured":"Gruska, J., Qiu, D., Zheng, S.: Generalizations of the distributed Deutsch-Jozsa promise problem. Math. Struct. Comput. Sci. 27(3), 311\u2013331 (2017)","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:46Z","timestamp":1739999926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","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":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}