{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:32:54Z","timestamp":1778538774625,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071240"],"award-info":[{"award-number":["62071240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Jiangsu Higher Education Institutions of China","award":["19KJB520028"],"award-info":[{"award-number":["19KJB520028"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s12652-020-02840-z","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T07:03:14Z","timestamp":1609570994000},"page":"10425-10434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq"],"prefix":"10.1007","volume":"12","author":[{"given":"Wenjie","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingshan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaojiao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Zidan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"2840_CR1","doi-asserted-by":"crossref","unstructured":"Ali H, Zhai XJ, Liu L, Tariq UU (2018) Energy efficient heuristic algorithm for task mapping on shared-memory heterogeneous MPSoCs. In: IEEE 20th International conference on high performance computing and communications\/IEEE 16th international conference on smart city\/IEEE 4th International conference on data science and systems. IEEE, New York, pp 1099\u20131104","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2018.00183"},{"key":"2840_CR2","doi-asserted-by":"publisher","unstructured":"Ali H, Tariq UU, Hussain M, Lu L, Panneerselvam J, Zhai X (2020) ARSH-FATI a novel metaheuristic for cluster head selection in wireless sensor networks. IEEE Syst J. https:\/\/doi.org\/10.1109\/JSYST.2020.2986811","DOI":"10.1109\/JSYST.2020.2986811"},{"issue":"4","key":"2840_CR3","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1103\/PhysRevA.60.2742","volume":"60","author":"E Biham","year":"1999","unstructured":"Biham E, Biham O, Biron D, Grassl M, Lidar DA (1999) Grover\u2019s quantum search algorithm for an arbitrary initial amplitude distribution. Phys Rev A 60(4):2742\u20132745","journal-title":"Phys Rev A"},{"issue":"1","key":"2840_CR4","doi-asserted-by":"publisher","first-page":"012310","DOI":"10.1103\/PhysRevA.63.012310","volume":"63","author":"E Biham","year":"2000","unstructured":"Biham E, Biham O, Biron D, Grassl M, Lidar DA, Shapira D (2000) Analysis of generalized grover\u2019s quantum Search algorithms using recursion equations. Phys Rev A 63(1):012310","journal-title":"Phys Rev A"},{"key":"2840_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1996","unstructured":"Boyer M, Brassard G, Hoeyer P, Tapp A (1996) Tight bounds on quantum searching. Fortschr Phys 46:493\u2013505","journal-title":"Fortschr Phys"},{"key":"2840_CR6","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/BFb0055105","volume-title":"Automata, languages and programming","author":"G Brassard","year":"1998","unstructured":"Brassard G, H\u00d8yer p, Tapp A (1998) Quantum counting. In: Larsen KG, Skyum S, Winskel G (eds) Automata, languages and programming. Springer, Berlin, pp 820\u2013831"},{"key":"2840_CR7","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s10701-015-9968-4","volume":"46","author":"G Castagnoli","year":"2016","unstructured":"Castagnoli G (2016) Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics. Found Phys 46:360","journal-title":"Found Phys"},{"key":"2840_CR8","unstructured":"Christoph Durr PH (1999) A quantum algorithm for finding the minimum. arXiv doi:arXiv:quant-ph\/9607014v2"},{"key":"2840_CR9","unstructured":"Cirq (2019) A python library for NISQ circuits [online]. http:\/\/cirq.readthedocs.io\/en\/stable. [Accessed 18 November 2019]"},{"key":"2840_CR10","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: nSGA-II. IEEE T Evolut Comput 6:182\u2013197","journal-title":"IEEE T Evolut Comput"},{"issue":"4","key":"2840_CR11","doi-asserted-by":"publisher","first-page":"044301","DOI":"10.1103\/PhysRevA.82.044301","volume":"82","author":"Z Diao","year":"2010","unstructured":"Diao Z (2010) Exactness of the original grover search algorithm. Phys Rev A 82(4):044301","journal-title":"Phys Rev A"},{"key":"2840_CR12","doi-asserted-by":"crossref","unstructured":"Eberhart, Yuhui S (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 congress on evolutionary computation 1, pp. 81\u201386","DOI":"10.1109\/CEC.2001.934374"},{"issue":"1","key":"2840_CR13","doi-asserted-by":"publisher","first-page":"012303","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2012","unstructured":"Fitzsimons JF, Kashefi E (2012) Unconditionally verifiable blind computation. Phys Rev A 96(1):012303","journal-title":"Phys Rev A"},{"key":"2840_CR14","doi-asserted-by":"publisher","first-page":"70301","DOI":"10.1007\/s11433-018-9324-6","volume":"62","author":"F Gao","year":"2019","unstructured":"Gao F, Qin S, Huang W, Wen Q (2019) Quantum private query: a new kind of practical quantum cryptographic protocol. Sci China Phys Mech 62:70301","journal-title":"Sci China Phys Mech"},{"key":"2840_CR15","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, pp 212\u2013219","DOI":"10.1145\/237814.237866"},{"issue":"15","key":"2840_CR16","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"LK Grover","year":"2005","unstructured":"Grover LK (2005) Fixed-point quantum search. Phys Rev Lett 95(15):150501","journal-title":"Phys Rev Lett"},{"issue":"3","key":"2840_CR17","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1103\/PhysRevA.59.1829","volume":"59","author":"M Hillery","year":"1999","unstructured":"Hillery M, Bu\u017eek V, Berthiaume A (1999) Quantum secret sharing. Phys Rev A 59(3):1829\u20131834","journal-title":"Phys Rev A"},{"key":"2840_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10773-017-3553-x","volume":"57","author":"W-J Liu","year":"2018","unstructured":"Liu W-J, Xu Y, Yang C-N, Gao P-P, Yu W-B (2018) An efficient and secure arbitrary n-party quantum key agreement protocol using bell states. Int J Theor Phys 57:195\u2013207","journal-title":"Int J Theor Phys"},{"key":"2840_CR19","first-page":"4923590","volume":"2019","author":"W Liu","year":"2019","unstructured":"Liu W, Gao P, Liu Z, Chen H, Zhang M (2019a) A quantum-based database query scheme for privacy preservation in cloud environment. Secur Commun Netw 2019:4923590","journal-title":"Secur Commun Netw"},{"key":"2840_CR20","doi-asserted-by":"publisher","first-page":"186284","DOI":"10.1109\/ACCESS.2019.2960592","volume":"7","author":"W Liu","year":"2019","unstructured":"Liu W, Xu Y, Wang H, Lei Z (2019b) Quantum searchable encryption for cloud data based on full-blind quantum computation. IEEE Access 7:186284\u2013186295","journal-title":"IEEE Access"},{"key":"2840_CR21","doi-asserted-by":"publisher","first-page":"114374","DOI":"10.1109\/ACCESS.2019.2931073","volume":"7","author":"W Liu","year":"2019","unstructured":"Liu W, Xu Y, Zhang M, Chen J, Yang C (2019c) A novel quantum visual secret sharing scheme. IEEE Access 7:114374\u2013114384","journal-title":"IEEE Access"},{"key":"2840_CR22","first-page":"1237","volume":"60","author":"W Liu","year":"2019","unstructured":"Liu W, Yu W, Xu Y, Yang JCN, Chi L (2019d) Privacy-preserving quantum two-party geometric intersection. CMC-COMPUT MATER CON 60:1237\u20131250","journal-title":"CMC-COMPUT MATER CON"},{"key":"2840_CR23","first-page":"8216874","volume":"2020","author":"W Liu","year":"2020","unstructured":"Liu W, Chen J, Wang Y, Gao P, Lei Z, Ma X (2020) Quantum-based feature selection for multiclassification problem in complex systems with edge computing. COMPLEXITY 2020:8216874","journal-title":"COMPLEXITY"},{"issue":"2","key":"2840_CR24","doi-asserted-by":"publisher","first-page":"022307","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"GL Long","year":"2001","unstructured":"Long GL (2001) Grover algorithm with zero theoretical failure rate. Phys Rev A 64(2):022307","journal-title":"Phys Rev A"},{"issue":"1","key":"2840_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0375-9601(99)00631-3","volume":"262","author":"GL Long","year":"1999","unstructured":"Long GL, Li YS, Zhang WL, Niu L (1999) Phase matching in quantum searching. Phys Lett A 262(1):27\u201334","journal-title":"Phys Lett A"},{"issue":"3","key":"2840_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0375-9601(02)00055-5","volume":"294","author":"GL Long","year":"2002","unstructured":"Long GL, Li X, Sun Y (2002) Phase matching condition for quantum search with a generalized initial state. Phys Lett A 294(3):143\u2013152","journal-title":"Phys Lett A"},{"issue":"4","key":"2840_CR27","doi-asserted-by":"publisher","first-page":"040504","DOI":"10.1103\/PhysRevLett.122.040504","volume":"122","author":"M Schuld","year":"2018","unstructured":"Schuld M, Killoran N (2018) Quantum machine learning in feature Hilbert spaces. Phys Rev Lett 122(4):040504","journal-title":"Phys Rev Lett"},{"key":"2840_CR28","first-page":"149","volume":"59","author":"T Shang","year":"2019","unstructured":"Shang T, Liu J, Pei Z, Chen R (2019) Quantum homomorphic signature with repeatable verification. CMC-Comput Mater CON 59:149\u2013165","journal-title":"CMC-Comput Mater CON"},{"key":"2840_CR29","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring, In: Proceedings 35th Annual symposium on foundations of computer science pp 124\u2013134"},{"key":"2840_CR30","doi-asserted-by":"crossref","unstructured":"Tariq UU, Ali H, Liu L, Zhai X (2019) A novel meta-heuristic for green computing on VFI-NoC-HMPSoCs. In: 2019 IEEE SmartWorld, ubiquitous intelligence & computing, advanced & trusted computing, scalable computing & communications, cloud & big data computing, internet of people and smart city innovation pp 1545\u20131552","DOI":"10.1109\/SmartWorld-UIC-ATC-SCALCOM-IOP-SCI.2019.00278"},{"issue":"1","key":"2840_CR31","doi-asserted-by":"publisher","first-page":"15264","DOI":"10.1038\/s41598-017-15227-6","volume":"7","author":"H Wei","year":"2017","unstructured":"Wei H, Qi S, Bin L, Yuan-Hang H, Fan F, Bing-Jie X (2017) Efficient multiparty quantum key agreement with collective detection. Sci Rep-UK 7(1):15264","journal-title":"Sci Rep-UK"},{"issue":"6","key":"2840_CR32","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1142\/S0129055X00000344","volume":"12","author":"SL Woronowicz","year":"2000","unstructured":"Woronowicz SL (2000) Quantum exponential function. Rev Math Phys 12(6):873\u2013920","journal-title":"Rev Math Phys"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02840-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-020-02840-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02840-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T14:20:08Z","timestamp":1632147608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-020-02840-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2840"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-02840-z","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"30 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}