{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:09Z","timestamp":1740137229318,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["140897\/2020-8","308923\/2019-7"],"award-info":[{"award-number":["140897\/2020-8","308923\/2019-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["409552\/2022-4"],"award-info":[{"award-number":["409552\/2022-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004586","name":"Faperj","doi-asserted-by":"crossref","award":["E-26\/202.351\/2022","E-26\/200.954\/2022"],"award-info":[{"award-number":["E-26\/202.351\/2022","E-26\/200.954\/2022"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-024-04355-4","type":"journal-article","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T09:01:52Z","timestamp":1712307712000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum search by continuous-time quantum walk on t-designs"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2316-445X","authenticated-orcid":false,"given":"Pedro H. G.","family":"Lug\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0894-4279","authenticated-orcid":false,"given":"Renato","family":"Portugal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"4355_CR1","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915\u2013928 (1998)","journal-title":"Phys. Rev. A"},{"key":"4355_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.022314","volume":"70","author":"AM Childs","year":"2004","unstructured":"Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70, 022314 (2004)","journal-title":"Phys. Rev. A"},{"key":"4355_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023302","volume":"2","author":"S Marsh","year":"2020","unstructured":"Marsh, S., Wang, J.B.: Combinatorial optimization via highly efficient quantum walks. Phys. Rev. Res. 2, 023302 (2020)","journal-title":"Phys. Rev. Res."},{"key":"4355_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100419","volume":"41","author":"K Kadian","year":"2021","unstructured":"Kadian, K., Garhwal, S., Kumar, A.: Quantum walk and its application domains: a systematic review. Comput. Sci. Rev. 41, 100419 (2021)","journal-title":"Comput. Sci. Rev."},{"key":"4355_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-97813-0","volume-title":"Quantum Walks and Search Algorithms","author":"R Portugal","year":"2018","unstructured":"Portugal, R.: Quantum Walks and Search Algorithms, 2nd edn. Springer, Cham (2018)","edition":"2"},{"issue":"2","key":"4355_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"4355_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.032305","volume":"93","author":"P Philipp","year":"2016","unstructured":"Philipp, P., Tarrataca, L., Boettcher, S.: Continuous-time quantum search on balanced trees. Phys. Rev. A 93, 032305 (2016)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"4355_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s11128-022-03417-9","volume":"21","author":"H Tanaka","year":"2022","unstructured":"Tanaka, H., Sabri, M., Portugal, R.: Spatial search on Johnson graphs by continuous-time quantum walk. Quantum Inf. Process. 21(2), 74 (2022)","journal-title":"Quantum Inf. Process."},{"key":"4355_CR9","volume-title":"Combinatorial Designs: Constructions and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson, D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2004)"},{"key":"4355_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 1, 2nd edn. Cambridge University Press, Cambridge (1999)","edition":"2"},{"issue":"3","key":"4355_CR11","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"OS Rothaus","year":"1976","unstructured":"Rothaus, O.S.: On \u201cbent\u2019\u2019 functions. J. Comb. Theory Ser. A 20(3), 300\u2013305 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"4355_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.012304","volume":"80","author":"C Dankert","year":"2009","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80, 012304 (2009)","journal-title":"Phys. Rev. A"},{"key":"4355_CR13","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Emerson, J.: Quantum t-designs: t-wise independence in the quantum world. In: Twenty-second annual IEEE conference on computational complexity (CCC\u201907), pp. 129\u2013140 (2007)","DOI":"10.1109\/CCC.2007.26"},{"issue":"10","key":"4355_CR14","doi-asserted-by":"publisher","first-page":"S347","DOI":"10.1088\/1464-4266\/7\/10\/021","volume":"7","author":"J Emerson","year":"2005","unstructured":"Emerson, J., Alicki, R., \u017byczkowski, K.: Scalable noise estimation with random unitary operators. J. Opt. B Quantum Semiclassical Opt. 7(10), S347 (2005)","journal-title":"J. Opt. B Quantum Semiclassical Opt."},{"key":"4355_CR15","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.F.: Algebraic Graph Theory, volume 207 of Graduate Texts in Mathematics. Springer, New York (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"issue":"5","key":"4355_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Phys. Rev. A 67(5), 052307 (2003)","journal-title":"Phys. Rev. A"},{"issue":"11","key":"4355_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.110503","volume":"114","author":"DA Meyer","year":"2015","unstructured":"Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. Phys. Rev. Lett. 114(11), 110503 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"4355_CR18","doi-asserted-by":"publisher","first-page":"9793071","DOI":"10.34133\/2021\/9793071","volume":"2021","author":"N Pan","year":"2021","unstructured":"Pan, N., Chen, T., Sun, H., Zhang, X.: Electric-circuit realization of fast quantum search. Research 2021, 9793071 (2021)","journal-title":"Research"},{"issue":"5","key":"4355_CR19","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s11128-022-03519-4","volume":"21","author":"T Ji","year":"2022","unstructured":"Ji, T., Pan, N., Chen, T., Zhang, X.: Fast quantum search of multiple vertices based on electric circuits. Quantum Inf. Process. 21(5), 172 (2022)","journal-title":"Quantum Inf. Process."},{"issue":"7","key":"4355_CR20","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/ac5241","volume":"31","author":"T Ji","year":"2022","unstructured":"Ji, T., Pan, N., Chen, T., Zhang, X.: Quantum search of many vertices on the joined complete graph. Chin. Phys. B 31(7), 070504 (2022)","journal-title":"Chin. Phys. B"},{"issue":"4","key":"4355_CR21","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1007\/s11128-015-1239-y","volume":"15","author":"TG Wong","year":"2016","unstructured":"Wong, T.G.: Spatial search by continuous-time quantum walk with multiple marked vertices. Quantum Inf. Process. 15(4), 1411\u20131443 (2016)","journal-title":"Quantum Inf. Process."},{"key":"4355_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.062202","volume":"103","author":"GA Bezerra","year":"2021","unstructured":"Bezerra, G.A., Lug\u00e3o, P.H.G., Portugal, R.: Quantum-walk-based search algorithms with multiple marked vertices. Phys. Rev. A 103, 062202 (2021)","journal-title":"Phys. Rev. A"},{"key":"4355_CR23","unstructured":"Lug\u00e3o, P.H.G., Portugal, R., Sabri, M., Tanaka, H.: Multimarked spatial search by continuous-time quantum walk. arXiv:2203.14384 (2022)"},{"key":"4355_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.160502","volume":"129","author":"S Apers","year":"2022","unstructured":"Apers, S., Chakraborty, S., Novo, L., Roland, J.: Quadratic speedup for spatial search by continuous-time quantum walk. Phys. Rev. Lett. 129, 160502 (2022)","journal-title":"Phys. Rev. Lett."},{"key":"4355_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.033021","volume":"5","author":"M Roget","year":"2023","unstructured":"Roget, M., Kadri, H., Di Molfetta, G.: Optimality conditions for spatial search with multiple marked vertices. Phys. Rev. Res. 5, 033021 (2023)","journal-title":"Phys. Rev. Res."},{"key":"4355_CR26","volume-title":"Handbook of Combinatorial Designs","author":"C Colbourne","year":"2007","unstructured":"Colbourne, C., Dinitz, J.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007)"},{"key":"4355_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.032214","volume":"102","author":"S Chakraborty","year":"2020","unstructured":"Chakraborty, S., Novo, L., Roland, J.: Optimality of spatial search via continuous-time quantum walks. Phys. Rev. A 102, 032214 (2020)","journal-title":"Phys. Rev. A"},{"issue":"13 &14","key":"4355_CR28","first-page":"1110","volume":"22","author":"A Chan","year":"2022","unstructured":"Chan, A., Godsil, C.D., Tamon, C., Xie, W.: Of shadows and gaps in spatial search. Quantum Inf. Comput. 22(13 &14), 1110\u20131131 (2022)","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"4355_CR29","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11128-023-03842-4","volume":"22","author":"CF Teixeira da Silva","year":"2023","unstructured":"Teixeira da Silva, C.F., Posner, D., Portugal, R.: Walking on vertices and edges by continuous-time quantum walk. Quantum Inf. Process. 22(2), 93 (2023)","journal-title":"Quantum Inf. Process."},{"key":"4355_CR30","unstructured":"Portugal, R., Moqadam, J.K.: Implementation of continuous-time quantum walks on quantum computers. arXiv:2212.08889 (2022)"},{"key":"4355_CR31","unstructured":"Chen, Q.: PhD thesis, University of Waterloo, in preparation"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04355-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04355-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T19:07:15Z","timestamp":1714763235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04355-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,5]]},"references-count":31,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["4355"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04355-4","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2024,4,5]]},"assertion":[{"value":"21 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 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 there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"140"}}