{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T01:49:05Z","timestamp":1762998545886,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p>\n            It is well known that a straightforward application of Grover's quantum search algorithm enables to solve SAT in\n            <jats:italic>O<\/jats:italic>\n            (2\n            <jats:sup>\n              <jats:italic>n<\/jats:italic>\n              \/2\n            <\/jats:sup>\n            ) steps. Ambainis (SIGACT News, 2004) observed that it is possible to use Grover's technique to similarly speed up a sophisticated algorithm for solving 3-SAT. In this note, we show that a similar speed up can be obtained for all major record-breaking algorithms for satisfiability. We also show that if we use Grover's technique only, then we cannot do better than quadratic speed up.\n          <\/jats:p>","DOI":"10.1145\/1107523.1107524","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T18:14:10Z","timestamp":1139249650000},"page":"103-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On quantum versions of record-breaking algorithms for SAT"],"prefix":"10.1145","volume":"36","author":[{"given":"Evgeny","family":"Dantsin","sequence":"first","affiliation":[{"name":"Roosevelt University, Chicago, IL"}]},{"given":"Vladik","family":"Kreinovich","sequence":"additional","affiliation":[{"name":"University of Texas at El Paso, El Paso, TX"}]},{"given":"Alexander","family":"Wolpert","sequence":"additional","affiliation":[{"name":"Roosevelt University, Chicago, IL"}]}],"member":"320","published-online":{"date-parts":[[2005,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052796.1052804"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:OPSY.0000047567.88377.74"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/992287.992296"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-45687-2_7","volume-title":"Proceedings of the 27th International Symposium Mathematical Foundations of Computer Science MFCS'2002","author":"Angelsmark O.","year":"2002","unstructured":"O. Angelsmark , V. Dahll\u00f6f , and P. Jonsson . Finite domain constraint satisfaction using quantum computation , In: K. Diks and W. Rytter (Eds.), Proceedings of the 27th International Symposium Mathematical Foundations of Computer Science MFCS'2002 , Warsaw, Poland , August 26--30, 2002 , volume 2420 of Lecture Notes in Computer Science , pages 93 -- 103 , 2002. O. Angelsmark, V. Dahll\u00f6f, and P. Jonsson. Finite domain constraint satisfaction using quantum computation, In: K. Diks and W. Rytter (Eds.), Proceedings of the 27th International Symposium Mathematical Foundations of Computer Science MFCS'2002, Warsaw, Poland, August 26--30, 2002, volume 2420 of Lecture Notes in Computer Science, pages 93--103, 2002."},{"key":"e_1_2_1_5_1","first-page":"53","volume-title":"Quantum amplitude amplification and estimation","author":"Brassard G.","year":"2000","unstructured":"G. Brassard , P. Hoyer , M. Mosca , and A. Tapp . Quantum amplitude amplification and estimation . In : Quantum Computation and Quantum Information Systems, American Mathematical Society , Contemporary Math Series, 2000 , volume 305 , pages 53 -- 74 . G. Brassard, P. Hoyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information Systems, American Mathematical Society, Contemporary Math Series, 2000, volume 305, pages 53--74."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00174-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527695_7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_31"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276712"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.022314"},{"key":"e_1_2_1_13_1","first-page":"328","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'2004","author":"Iwama K.","year":"2004","unstructured":"K. Iwama and S. Tamaki . Improved upper bounds for 3-SAT . In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'2004 , page 328 , 2004 . K. Iwama and S. Tamaki. Improved upper bounds for 3-SAT. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'2004, page 328, 2004."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PHYCMP.1994.363683"},{"key":"e_1_2_1_15_1","volume-title":"Quantum computation and quantum information","author":"Nielsen M. A.","year":"2000","unstructured":"M. A. Nielsen and I. L. Chuang . Quantum computation and quantum information . Cambridge University Press , Cambridge, U.K. , 2000 . M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, Cambridge, U.K., 2000."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the von Neumann Centennial Conference: Linear Operators and Foundations of Quantum Mechanics","author":"Ohya M.","year":"2003","unstructured":"M. Ohya . Quantum algorithm for SAT problem and quantum mutual entropy . In Proceedings of the von Neumann Centennial Conference: Linear Operators and Foundations of Quantum Mechanics , Budapest, Hungary, 15- -20 October , 2003 , 2003. M. Ohya. Quantum algorithm for SAT problem and quantum mutual entropy. In Proceedings of the von Neumann Centennial Conference: Linear Operators and Foundations of Quantum Mechanics, Budapest, Hungary, 15--20 October, 2003, 2003."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796346"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796439"},{"key":"e_1_2_1_19_1","volume-title":"Report No.","author":"Rolf D.","year":"2003","unstructured":"D. Rolf . 3-SAT in RTIME(O(1.32971n)) --- improving randomized local search by initializing strings of 3-clauses. Electronic Colloquium on Computational Complexity , Report No. 54, July 2003 . D. Rolf. 3-SAT in RTIME(O(1.32971n)) --- improving randomized local search by initializing strings of 3-clauses. Electronic Colloquium on Computational Complexity, Report No. 54, July 2003."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_16"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796524"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.012"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1107523.1107524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1107523.1107524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:26Z","timestamp":1750262906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1107523.1107524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1145\/1107523.1107524"],"URL":"https:\/\/doi.org\/10.1145\/1107523.1107524","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2005,12]]},"assertion":[{"value":"2005-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}