{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T03:19:26Z","timestamp":1783135166349,"version":"3.54.6"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["2512.22959"],"award-info":[{"award-number":["2512.22959"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["JCYJ20220818102003006"],"award-info":[{"award-number":["JCYJ20220818102003006"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2020B1515310017"],"award-info":[{"award-number":["2020B1515310017"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876195"],"award-info":[{"award-number":["61876195"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12441107"],"award-info":[{"award-number":["12441107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ins.2026.123553","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:40:46Z","timestamp":1777045246000},"page":"123553","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Revisiting finite Abelian hidden subgroup problem and its distributed exact quantum algorithm"],"prefix":"10.1016","volume":"750","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0739-0184","authenticated-orcid":false,"given":"Ziyuan","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2141-6657","authenticated-orcid":false,"given":"Xiang","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tengxun","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daowen","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123553_bib0005","author":"Kitaev"},{"key":"10.1016\/j.ins.2026.123553_bib0010","series-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2010"},{"issue":"5","key":"10.1016\/j.ins.2026.123553_bib0015","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.ins.2026.123553_bib0020","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1137\/S0097539796298637","article-title":"On the power of quantum computation","volume":"26","author":"Simon","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2026.123553_bib0025","series-title":"An Introduction to Quantum Computing","author":"Kaye","year":"2007"},{"issue":"1\u20132","key":"10.1016\/j.ins.2026.123553_bib0030","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2007.02.057","article-title":"The quantum query complexity of the abelian hidden subgroup problem","volume":"380","author":"Koiran","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ins.2026.123553_bib0035","author":"Lomont"},{"issue":"9\u201310","key":"10.1016\/j.ins.2026.123553_bib0040","first-page":"770","article-title":"An exact quantum hidden subgroup algorithm and applications to solvable groups","volume":"22","author":"Imran","year":"2022","journal-title":"Quant. Inf. Comput."},{"issue":"1","key":"10.1016\/j.ins.2026.123553_bib0045","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539703436345","article-title":"A subexponential-time quantum algorithm for the dihedral hidden subgroup problem","volume":"35","author":"Kuperberg","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ins.2026.123553_bib0050","series-title":"8th Conference on the Theory of Quantum Computation, Communication and Cryptography","first-page":"20","article-title":"Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem","author":"Kuperberg","year":"2013"},{"issue":"1","key":"10.1016\/j.ins.2026.123553_bib0055","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ipl.2004.01.024","article-title":"The quantum query complexity of the hidden subgroup problem is polynomial","volume":"91","author":"Ettinger","year":"2004","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2026.123553_bib0060","author":"Nayak"},{"key":"10.1016\/j.ins.2026.123553_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2022.104975","article-title":"Deterministic algorithms for the hidden subgroup problem","volume":"289","author":"Ye","year":"2022","journal-title":"Inf. Comput."},{"key":"10.1016\/j.ins.2026.123553_bib0070","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"10.1016\/j.ins.2026.123553_bib0075","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ipl.2016.12.002","article-title":"Application of distributed semi-quantum computing model in phase estimation","volume":"120","author":"Li","year":"2017","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2026.123553_bib0080","series-title":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","first-page":"337","article-title":"Sublinear-time quantum computation of the diameter in congest networks","author":"Le Gall","year":"2018"},{"key":"10.1016\/j.ins.2026.123553_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114461","article-title":"Distributed grover\u2019s algorithm","volume":"993","author":"Qiu","year":"2024","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.ins.2026.123553_bib0090","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.106.032417","article-title":"Distributed quantum algorithm for simon\u2019s problem","volume":"106","author":"Tan","year":"2022","journal-title":"Phys. Rev. A"},{"key":"10.1016\/j.ins.2026.123553_bib0095","series-title":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","first-page":"44","article-title":"Distributed quantum inner product estimation","author":"Anshu","year":"2022"},{"issue":"1&2","key":"10.1016\/j.ins.2026.123553_bib0100","first-page":"0027","article-title":"Distributed shor\u2019s algorithm","volume":"23","author":"Xiao","year":"2023","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123553_bib0105","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s00236-024-00455-x","article-title":"Exact distributed quantum algorithm for generalized simon\u2019s problem","volume":"61","author":"Li","year":"2024","journal-title":"Acta Inform."},{"key":"10.1016\/j.ins.2026.123553_bib0110","series-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","first-page":"1901","article-title":"No distributed quantum advantage for approximate graph coloring","author":"Coiteux-Roy","year":"2024"},{"issue":"1","key":"10.1016\/j.ins.2026.123553_bib0115","doi-asserted-by":"crossref","DOI":"10.1140\/epjqt\/s40507-025-00455-x","article-title":"Error correction for distributed quantum computing","volume":"12","author":"Qiu","year":"2025","journal-title":"EPJ Quantum Technol,"},{"issue":"4","key":"10.1016\/j.ins.2026.123553_bib0120","doi-asserted-by":"crossref","first-page":"9380","DOI":"10.3934\/math.2026389","article-title":"Probabilistic bounds on the number of elements to generate finite nilpotent groups and their applications to quantum algorithms","volume":"11","author":"Dong","year":"2026","journal-title":"AIMS Math."},{"key":"10.1016\/j.ins.2026.123553_bib0125","series-title":"Algebra","volume":"vol. 73","author":"Hungerford","year":"2012"},{"key":"10.1016\/j.ins.2026.123553_bib0130","series-title":"Theoretical Foundations of Quantum Computing","author":"Qiu","year":"2025"},{"key":"10.1016\/j.ins.2026.123553_bib0135","series-title":"Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation","first-page":"267","article-title":"Near optimal algorithms for computing smith normal forms of integer matrices","author":"Storjohann","year":"1996"},{"key":"10.1016\/j.ins.2026.123553_bib0140","first-page":"1","article-title":"Quantum amplitude amplification and estimation","volume":"305","author":"Brassard","year":"2002","journal-title":"Contemp. Math."},{"issue":"5","key":"10.1016\/j.ins.2026.123553_bib0145","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.104.052404","article-title":"Quantum advantage and noise reduction in distributed quantum computing","volume":"104","author":"Avron","year":"2021","journal-title":"Phys. Rev. A"},{"key":"10.1016\/j.ins.2026.123553_bib0150","series-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1113","article-title":"The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups","author":"Moore","year":"2004"},{"key":"10.1016\/j.ins.2026.123553_bib0155","series-title":"Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups","author":"Roetteler","year":"1998"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T02:57:21Z","timestamp":1783133841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":31,"alternative-id":["S0020025526004846"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123553","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Revisiting finite Abelian hidden subgroup problem and its distributed exact quantum algorithm","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123553","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123553"}}