{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:33Z","timestamp":1781031453991,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["DMS-2424441"],"award-info":[{"award-number":["DMS-2424441"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800731","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"101-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["No Exponential Quantum Speedup for SIS\u221e Anymore"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6114-943X","authenticated-orcid":false,"given":"Robin","family":"Kothari","sequence":"first","affiliation":[{"name":"Google Quantum AI, Los Angeles, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7608-1458","authenticated-orcid":false,"given":"Ryan","family":"O'Donnell","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5894-822X","authenticated-orcid":false,"given":"Kewen","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Symposium on the Theory of Computing. ACM","author":"Ajtai Mikl\u00f3s","year":"1996","unstructured":"Mikl\u00f3s Ajtai. 1996. Generating hard instances of lattice problems. In Symposium on the Theory of Computing. ACM, New York, 99\u2013108."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Sanjeev Arora and Rong Ge. 2011. New algorithms for learning in presence of errors. In International Colloquium on Automata Languages and Programming. 403\u2013415.","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"e_1_3_2_1_3_1","unstructured":"Andr\u00e9 Chailloux and Jean-Pierre Tillich. 2023. The Quantum Decoding Problem. arXiv preprint arXiv:2310.20651."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 Chailloux and Jean-Pierre Tillich. 2024. Quantum advantage from soft decoders. arXiv preprint arXiv:2411.12553.","DOI":"10.1145\/3717823.3718319"},{"key":"e_1_3_2_1_5_1","volume-title":"Annual international conference on the theory and applications of cryptographic techniques. 372\u2013401","author":"Chen Yilei","year":"2022","unstructured":"Yilei Chen, Qipeng Liu, and Mark Zhandry. 2022. Quantum algorithms for variants of average-case lattice problems via filtering. In Annual international conference on the theory and applications of cryptographic techniques. 372\u2013401."},{"key":"e_1_3_2_1_6_1","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security. 21\u201351","author":"Debris-Alazard Thomas","year":"2019","unstructured":"Thomas Debris-Alazard, Nicolas Sendrier, and Jean-Pierre Tillich. 2019. Wave: A new family of trapdoor one-way preimage sampleable functions based on codes. In International Conference on the Theory and Application of Cryptology and Information Security. 21\u201351."},{"key":"e_1_3_2_1_7_1","volume-title":"Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 238\u2013268.","author":"Ducas L\u00e9o","year":"2018","unstructured":"L\u00e9o Ducas, Eike Kiltz, Tancr\u00e8de Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehl\u00e9. 2018. Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 238\u2013268."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s11128-023-04228-2","article-title":"Zero sum subsequences and hidden subgroups","volume":"23","author":"Imran Muhammad","year":"2024","unstructured":"Muhammad Imran and G\u00e1bor Ivanyos. 2024. Zero sum subsequences and hidden subgroups. Quantum Information Processing, 23, 1 (2024), 14.","journal-title":"Quantum Information Processing"},{"key":"e_1_3_2_1_9_1","first-page":"2012","article-title":"(preprint on ArXiv 2007). An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups","volume":"62","author":"Ivanyos G\u00e1bor","year":"2012","unstructured":"G\u00e1bor Ivanyos, Luc Sanselme, and Miklos Santha. 2012 (preprint on ArXiv 2007). An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Algorithmica, 62, 1 (2012 (preprint on ArXiv 2007)), 480\u2013498.","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Stephen P Jordan Noah Shutty Mary Wootters Adam Zalcman Alexander Schmidhuber Robbie King Sergei V Isakov and Ryan Babbush. 2024. Optimization by decoded quantum interferometry. arXiv preprint arXiv:2408.08292.","DOI":"10.1038\/s41586-025-09527-5"},{"key":"e_1_3_2_1_11_1","unstructured":"Robin Kothari Ryan O\u2019Donnell and Kewen Wu. 2025. No exponential quantum speedup for SIS^\u221e anymore. arXiv preprint arXiv:2510.07515."},{"key":"e_1_3_2_1_12_1","series-title":"SIAM journal on computing, 37, 1","volume-title":"Worst-case to average-case reductions based on Gaussian measures","author":"Micciancio Daniele","year":"2007","unstructured":"Daniele Micciancio and Oded Regev. 2007. Worst-case to average-case reductions based on Gaussian measures. SIAM journal on computing, 37, 1 (2007), 267\u2013302."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_14_1","volume-title":"EUROCRYPT 2024 (Lecture Notes in Computer Science","volume":"403","author":"Steiner Matthias","year":"2024","unstructured":"Matthias Steiner. 2024. The complexity of algebraic algorithms for LWE. In EUROCRYPT 2024 (Lecture Notes in Computer Science, Vol. 14653). Springer, 375\u2013403."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658665"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800731","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:37Z","timestamp":1781028337000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":15,"alternative-id":["10.1145\/3798129.3800731","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800731","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}