{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T11:31:31Z","timestamp":1784633491044,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,5,28]]},"DOI":"10.1145\/3719276.3725200","type":"proceedings-article","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T05:00:46Z","timestamp":1751605246000},"page":"55-63","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Circuit Design for Finding k-Cliques via Quantum Amplitude Amplification Strategies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-7252","authenticated-orcid":false,"given":"Simone","family":"Perriello","sequence":"first","affiliation":[{"name":"Department of Electronics, Information and Bioengineering (DEIB), Politecnico di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Scott Aaronson and Andris Ambainis. 2005. Quantum Search of Spatial Regions. Theory of Computing 1 1 (2005) 47\u201379. 10.4086\/TOC.2005.V001A004","DOI":"10.4086\/TOC.2005.V001A004"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Andris Ambainis. 2007. Quantum Walk Algorithm for Element Distinctness. Siam Journal On Computing 37 1 (2007) 210\u2013239. 10.1137\/S0097539705447311","DOI":"10.1137\/S0097539705447311"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00027"},{"key":"e_1_3_3_1_5_2","unstructured":"Alan Boji\u0107. 2012. Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph. Journal of Information and Organizational Sciences 36 2 (Dec. 2012) 91\u201398."},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"Michel Boyer Gilles Brassard Peter H\u00f8yer and Alain Tapp. 1998. Tight Bounds on Quantum Searching. Fortschritte der Physik: Progress of Physics 46 4\u20135 (1998) 493\u2013505. 10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"Gilles Brassard Peter H\u00f8yer Michele Mosca and Alain Tapp. 2002. Quantum Amplitude Amplification and Estimation. Quantum Computation and Information 305 (2002) 53\u201374. 10.1090\/conm\/305\/05215","DOI":"10.1090\/conm\/305\/05215"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Harry Buhrman Christoph D\u00fcrr Mark Heiligman Peter H\u00f8yer Fr\u00e9d\u00e9ric Magniez Miklos Santha and Ronald de Wolf. 2005. Quantum Algorithms for Element Distinctness. Siam Journal On Computing 34 6 (2005) 1324\u20131330. 10.1137\/S0097539702402780","DOI":"10.1137\/S0097539702402780"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3075564.3075575"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Andrew\u00a0M. Childs Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2002. Finding Cliques by Quantum Adiabatic Evolution. Quantum Information & Computation 2 3 (2002) 181\u2013191. 10.26421\/QIC2.3-1","DOI":"10.26421\/QIC2.3-1"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Diogo Cruz Romain Fournier Fabien Gremion Alix Jeannerot Kenichi Komagata Tara Tosic Jarla Thiesbrummel Chun\u00a0Lam Chan Nicolas Macris Marc-Andr\u00e9 Dupertuis et\u00a0al. 2019. Efficient Quantum Algorithms for GHZ and W States and Implementation on the IBM Quantum Computer. Advanced Quantum Technologies 2 5\u20136 (2019) 1900015. 10.1002\/qute.201900015","DOI":"10.1002\/qute.201900015"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"John\u00a0D. Eblen Charles\u00a0A. Phillips Gary\u00a0L. Rogers and Michael\u00a0A. Langston. 2012. The Maximum Clique Enumeration Problem: Algorithms Applications and Implementations. BMC Bioinformatics 13 10 (June 2012) S5. 10.1186\/1471-2105-13-S10-S5","DOI":"10.1186\/1471-2105-13-S10-S5"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Tuvi Etzion and Patric\u00a0RJ Ostergard. 1998. Greedy and Heuristic Algorithms for Codes and Colorings. IEEE Transactions on Information Theory 44 1 (1998) 382\u2013388.","DOI":"10.1109\/18.651069"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Santo Fortunato. 2010. Community Detection in Graphs. Physics reports 486 3\u20135 (2010) 75\u2013174. 10.1016\/j.physrep.2009.11.002","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.31"},{"key":"e_1_3_3_1_16_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey M.\u00a0R.","year":"1979","unstructured":"M.\u00a0R. Garey and David\u00a0S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI51109.2021.00087"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"crossref","unstructured":"Yong He Ming-Xing Luo E Zhang Hong-Ke Wang and Xiao-Feng Wang. 2017. Decompositions of N-Qubit Toffoli Gates with Linear Circuit Complexity. International Journal of Theoretical Physics 56 (2017) 2350\u20132361.","DOI":"10.1007\/s10773-017-3389-4"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"e_1_3_3_1_21_2","unstructured":"Samuel Jaques and Arthur\u00a0G. Rattew. 2023. QRAM: A Survey and Critique. arxiv:https:\/\/arXiv.org\/abs\/2305.10310\u00a0[quant-ph]"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_2"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Vadym Kliuchnikov Dmitri Maslov and Michele Mosca. 2016. Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits. IEEE Trans. Comput. 65 1 (2016) 161\u2013172. 10.1109\/TC.2015.2409842","DOI":"10.1109\/TC.2015.2409842"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3657337"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Magniez Ashwin Nayak J\u00e9r\u00e9mie Roland and Miklos Santha. 2011. Search via Quantum Walk. SIAM J. Comput. 40 1 (2011) 142\u2013164. 10.1137\/090745854","DOI":"10.1137\/090745854"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Fr\u00e9d\u00e9ric Magniez Miklos Santha and Mario Szegedy. 2007. Quantum Algorithms for the Triangle Problem. Siam Journal On Computing 37 2 (2007) 413\u2013424. 10.1137\/050643684","DOI":"10.1137\/050643684"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Sara\u00a0Ayman Metwalli Fran\u00e7ois Le\u00a0Gall and Rodney Van\u00a0Meter. 2020. Finding Small and Large k -Clique Instances on a Quantum Computer. IEEE Transactions on Quantum Engineering 1 (2020) 1\u201311. 10.1109\/TQE.2020.3045692","DOI":"10.1109\/TQE.2020.3045692"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_3_1_30_2","volume-title":"Markov Chains","author":"Norris James\u00a0R.","year":"1998","unstructured":"James\u00a0R. Norris. 1998. Markov Chains. Cambridge University Press."},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Simone Perriello Alessandro Barenghi and Gerardo Pelosi. 2023. Improving the Efficiency of Quantum Circuits for Information Set Decoding. ACM Transactions on Quantum Computing 4 4 (Aug. 2023) 1\u201340. 10.1145\/3607256","DOI":"10.1145\/3607256"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-61489-7_2"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_3"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Neil Shenvi Julia Kempe and K.\u00a0Birgitta Whaley. 2003. Quantum Random-Walk Search Algorithm. Physical Review A: Atomic Molecular and Optical Physics 67 5 (May 2003) 052307. 10.1103\/PhysRevA.67.052307","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Yasuhiro Takahashi Seiichiro Tani and Noboru Kunihiro. 2010. Quantum Addition Circuits and Unbounded Fan-Out. Quantum Information & Computation 10 9&10 (2010) 872\u2013890. 10.26421\/QIC10.9-10-12","DOI":"10.26421\/QIC10.9-10-12"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Virginia Vassilevska. 2009. Efficient Algorithms for Clique Problems. Inform. Process. Lett. 109 4 (2009) 254\u2013257. 10.1016\/J.IPL.2008.10.014","DOI":"10.1016\/J.IPL.2008.10.014"}],"event":{"name":"CF '25: 22nd ACM International Conference on Computing Frontiers","location":"Cagliari Italy","acronym":"CF '25","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 22nd ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719276.3725200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T09:49:10Z","timestamp":1753091350000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719276.3725200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,28]]},"references-count":35,"alternative-id":["10.1145\/3719276.3725200","10.1145\/3719276"],"URL":"https:\/\/doi.org\/10.1145\/3719276.3725200","relation":{},"subject":[],"published":{"date-parts":[[2025,5,28]]},"assertion":[{"value":"2025-07-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}