{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T19:47:45Z","timestamp":1782589665359,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3657337","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Design of a Quantum Walk Circuit to Solve the Subset-Sum Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0405-6073","authenticated-orcid":false,"given":"Giacomo","family":"Lancellotti","sequence":"first","affiliation":[{"name":"Politecnico di Milano, Milano, Lombardia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-7252","authenticated-orcid":false,"given":"Simone","family":"Perriello","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0840-6358","authenticated-orcid":false,"given":"Alessandro","family":"Barenghi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano - DEIB, Milano, Lombardia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3812-5429","authenticated-orcid":false,"given":"Gerardo","family":"Pelosi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Lombardia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.54"},{"key":"e_1_3_2_1_3_1","volume-title":"FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings (LNCS). Leszek Antoni Gasieniec, Jesper Jansson, and Christos Levcopoulos, (Eds.)","volume":"11651","author":"B\u00e4rtschi Andreas","unstructured":"Andreas B\u00e4rtschi and Stephan J. Eidenbenz. 2019. Deterministic preparation of dicke states. In Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings (LNCS). Leszek Antoni Gasieniec, Jesper Jansson, and Christos Levcopoulos, (Eds.) Vol. 11651. Springer."},{"key":"e_1_3_2_1_4_1","volume-title":"PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings (LNCS). Philippe Gaborit, (Ed.)","volume":"7932","author":"Bernstein Daniel J.","year":"2013","unstructured":"Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, and Alexander Meurer. 2013. Quantum algorithms for the subset-sum problem. In Post-Quantum Cryptography - 5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings (LNCS). Philippe Gaborit, (Ed.) Vol. 7932. Springer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"P. Oscar Boykin Tal Mor Matthew Pulver Vwani P. Roychowdhury and Farrokh Vatan. 2000. A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75.","DOI":"10.1016\/S0020-0190(00)00084-3"},{"key":"e_1_3_2_1_7_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Vlad Gheorghiu Michele Mosca and Priyanka Mukhopadhyay. 2022. T-count and t-depth of any multi-qubit unitary. npj Quantum Information 8.","DOI":"10.1038\/s41534-022-00651-y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_10_1","volume-title":"13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018","volume":"111","author":"Helm Alexander","year":"2018","unstructured":"Alexander Helm and Alexander May. 2018. Subset sum quantumly in 1.17n. In 13th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2018, July 16-18, 2018, Sydney, Australia (LIPIcs). Stacey Jeffery, (Ed.) Vol. 111. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_11_1","volume-title":"30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings (LNCS). Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger, (Eds.)","volume":"2719","author":"H\u00f8yer Peter","year":"2003","unstructured":"Peter H\u00f8yer, Michele Mosca, and Ronald de Wolf. 2003. Quantum search on bounded-error inputs. In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings (LNCS). Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger, (Eds.) Vol. 2719. Springer."},{"key":"e_1_3_2_1_12_1","volume-title":"USA","volume":"11692","author":"Jaques Samuel","year":"2019","unstructured":"Samuel Jaques and John M. Schanck. 2019. Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE. In Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I (LNCS). Alexandra Boldyreva and Daniele Micciancio, (Eds.) Vol. 11692. Springer."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_23"},{"key":"e_1_3_2_1_15_1","series-title":"SIAM J. Comput., 40","volume-title":"Search via quantum walk","author":"Magniez Fr\u00e9d\u00e9ric","unstructured":"Fr\u00e9d\u00e9ric Magniez, Ashwin Nayak, J\u00e9r\u00e9mie Roland, and Miklos Santha. 2011. Search via quantum walk. SIAM J. Comput., 40."},{"key":"e_1_3_2_1_16_1","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen Michael A","unstructured":"Michael A Nielsen and Isaac L Chuang. 2010. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_3_2_1_17_1","volume-title":"Cambridge Series in Statistical and Probabilistic Mathematics","author":"Norris J. R.","unstructured":"J. R. Norris. 1997. Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00056"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Simone Perriello Alessandro Barenghi and Gerardo Pelosi. 2023. Improving the efficiency of quantum circuits for information set decoding. ACM Transactions on Quantum Computing.","DOI":"10.1145\/3607256"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Neil Shenvi Julia Kempe and K. Birgitta Whaley. 2003. Quantum random-walk search algorithm. Phys. Rev. A 67 11 pages 5.","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.53"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yasuhiro Takahashi Seiichiro Tani and Noboru Kunihiro. 2010. Quantum addition circuits and unbounded fan-out. Quantum Inf. & Comp. 10.","DOI":"10.26421\/QIC10.9-10-12"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Seiichiro Tani. 2009. Claw finding algorithms using quantum walk. Theoretical Compututer Science 410.","DOI":"10.1016\/j.tcs.2009.08.030"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657337","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3657337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:00Z","timestamp":1750295880000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":23,"alternative-id":["10.1145\/3649329.3657337","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3657337","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}