{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T19:59:44Z","timestamp":1773431984099,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Sberbank"},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["19-71-10092"],"award-info":[{"award-number":["19-71-10092"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3336989","type":"journal-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T19:24:36Z","timestamp":1701199476000},"page":"134760-134768","source":"Crossref","is-referenced-by-count":5,"title":["Pitfalls of the Sublinear QAOA-Based Factorization Algorithm"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9482-1939","authenticated-orcid":false,"given":"Sergey V.","family":"Grebnev","sequence":"first","affiliation":[{"name":"Russian Quantum Center, Skolkovo, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2860-6576","authenticated-orcid":false,"given":"Maxim A.","family":"Gavreev","sequence":"additional","affiliation":[{"name":"Russian Quantum Center, Skolkovo, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5760-441X","authenticated-orcid":false,"given":"Evgeniy O.","family":"Kiktenko","sequence":"additional","affiliation":[{"name":"Russian Quantum Center, Skolkovo, Moscow, Russia"}]},{"given":"Anton P.","family":"Guglya","sequence":"additional","affiliation":[{"name":"Russian Quantum Center, Skolkovo, Moscow, Russia"}]},{"given":"Albert R.","family":"Efimov","sequence":"additional","affiliation":[{"name":"National University of Science and Technology “MISIS,”, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4722-3418","authenticated-orcid":false,"given":"Aleksey K.","family":"Fedorov","sequence":"additional","affiliation":[{"name":"Russian Quantum Center, Skolkovo, Moscow, Russia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.95.19.11032"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature08812"},{"key":"ref3","article-title":"Quantum computing at the quantum advantage threshold: A down-to-business review","author":"Fedorov","year":"2022","journal-title":"arXiv:2203.17181"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/nphys2385"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9480"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.250504"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.250505"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nphoton.2012.259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.abo6587"},{"key":"ref12","volume-title":"Our Quantum Roadmap is Leading to Increasingly Larger and Better Chips, With a 1,000-Qubit Chip, IBM Quantum Condor, Targeted for the End of 2023","year":"2023"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-15-433"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.140503"},{"key":"ref15","article-title":"Forecasting timelines of quantum computing","author":"Seville","year":"2020","journal-title":"arXiv:2009.05045"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14082-3_7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00478-z"},{"key":"ref18","article-title":"Factoring integers with sublinear resources on a superconducting quantum processor","author":"Yan","year":"2022","journal-title":"arXiv:2212.12372"},{"key":"ref19","article-title":"Fast factoring integers by SVP algorithms, corrected","author":"Schnorr","year":"2021","journal-title":"Cryptol. ePrint Arch"},{"key":"ref20","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv:1411.4028"},{"key":"ref21","article-title":"Quantum supremacy through the quantum approximate optimization algorithm","author":"Farhi","year":"2016","journal-title":"arXiv:1602.07674"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2006373117"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.94.015004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"ref26","volume-title":"Cargo Cult Quantum Factoring","year":"2023"},{"key":"ref27","volume-title":"Breaking RSA With a Quantum Computer","year":"2023"},{"key":"ref28","volume-title":"Unravelling the Chinese Factoring Algorithm: Is Our Current Encryption Still Safe?","year":"2023"},{"key":"ref29","volume-title":"Quantum Experts Debunk China Quantum Factoring Claims","year":"2023"},{"key":"ref30","article-title":"A comment on \u2018factoring integers with sublinear resources on a superconducting quantum processor\u2019","author":"Khattar","year":"2023","journal-title":"arXiv:2307.09651"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_3"},{"key":"ref33","article-title":"Testing Schnorr\u2019s factoring claim in SageMath","author":"Ducas","year":"2023"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.145"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2016.25"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/nature23461"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-021-00104-z"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-09-29-824"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10332184.pdf?arnumber=10332184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T21:56:02Z","timestamp":1703022962000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10332184\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3336989","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}