{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:58:22Z","timestamp":1776783502267,"version":"3.51.2"},"reference-count":138,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T00:00:00Z","timestamp":1657152000000},"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":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"<jats:p>As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM\u2019s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.<\/jats:p>","DOI":"10.1145\/3517340","type":"journal-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T11:54:30Z","timestamp":1648468470000},"page":"1-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["Quantum Algorithm\u00a0Implementations for Beginners"],"prefix":"10.1145","volume":"3","author":[{"given":"Abhijith","family":"J.","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Adetokunbo","family":"Adedoyin","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"John","family":"Ambrosiano","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Petr","family":"Anisimov","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"William","family":"Casper","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6223-8570","authenticated-orcid":false,"given":"Gopinath","family":"Chennupati","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Carleton","family":"Coffrin","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"David","family":"Gunter","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Satish","family":"Karra","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Nathan","family":"Lemons","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Shizeng","family":"Lin","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Alexander","family":"Malyzhenkov","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"David","family":"Mascarenas","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Susan","family":"Mniszewski","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Balu","family":"Nadiga","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Daniel","family":"O\u2019malley","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Diane","family":"Oyen","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Scott","family":"Pakin","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Lakshman","family":"Prasad","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Randy","family":"Roberts","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Phillip","family":"Romero","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Nandakishore","family":"Santhi","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Nikolai","family":"Sinitsyn","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Pieter J.","family":"Swart","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"James G.","family":"Wendelberger","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Boram","family":"Yoon","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Richard","family":"Zamora","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Wei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Andreas","family":"B\u00e4rtschi","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Patrick J.","family":"Coles","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"given":"Marc","family":"Vuffray","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3269-7263","authenticated-orcid":false,"given":"Andrey Y.","family":"Lokhov","sequence":"additional","affiliation":[{"name":"Los Alamos National Laboratory, Los Alamos, New Mexico 87545"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"[n.d.]. ibmq-device-information. Retrieved from https:\/\/github.com\/Qiskit\/ibmq-device-information\/tree\/master\/backends\/tenerife\/V1. Accessed: 14-12-2019."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3272"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2017.22"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor Abraham Ismail Yunus Akhalwaya Gadi Aleksandrowicz\u2026. and yotamvakninibm. 2019. Qiskit: An Open-source Framework for Quantum Computing. DOI:10.5281\/zenodo.2562110","DOI":"10.5281\/zenodo.2562110"},{"key":"e_1_3_2_6_2","unstructured":"A. Ambainis H. Buhrman P. H\u00f8yer M. Karpinski and P. Kurur. 2002. Quantum matrix verification. (2002)."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447311"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","DOI":"10.1007\/11672142_13","article-title":"Quantum algorithms for matching and network flows","volume":"3884","author":"Ambainis Andris","year":"2006","unstructured":"Andris Ambainis and R. Spalec. 2006. Quantum algorithms for matching and network flows. In Proceedings of the Lecture Notes in Computer Science: STACS 2006 3884 (2006).","journal-title":"Proceedings of the Lecture Notes in Computer Science: STACS 2006"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/080739379"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Dave Bacon Isaac L. Chuang and Aram W. Harrow. 2006. Efficient quantum circuits for Schur and Clebsch-Gordan transforms. Physical Review Letters 97 17 (2006) 170502.","DOI":"10.1103\/PhysRevLett.97.170502"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1646353.1646375"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep06115"},{"key":"e_1_3_2_14_2","first-page":"48","article-title":"Quantum computation of fourier transforms over symmetric groups","author":"Beals Robert","year":"1997","unstructured":"Robert Beals. 1997. Quantum computation of fourier transforms over symmetric groups. In Proceedings of the STOC (1997), 48\u201353.","journal-title":"Proceedings of the STOC"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1119\/1.2894532"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167097"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-006-0150-x"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.200504"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/4\/043034"},{"key":"e_1_3_2_21_2","first-page":"37","article-title":"O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm","volume":"3","author":"Bor\u016fvka Otakar","year":"1926","unstructured":"Otakar Bor\u016fvka. 1926. O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Mor. P\u0159\u00edrodov\u011b d. spol. v Brn\u0159 (Acta Societ. Scient. Natur. Moravicae) 3 (1926), 37\u201358.","journal-title":"Pr\u00e1ce Mor. P\u0159\u00edrodov\u011b d. spol. v Brn\u0159 (Acta Societ. Scient. Natur. Moravicae)"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.126.070505"},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Gilles Brassard Peter Hoyer Michele Mosca and Alain Tapp. 2002. Quantum amplitude amplification and estimation. Contemporary Mathematics 305 (2002) 53\u201374.","DOI":"10.1090\/conm\/305\/05215"},{"key":"e_1_3_2_25_2","article-title":"Variational quantum linear solver: A hybrid algorithm for linear systems","author":"Bravo-Prieto Carlos","year":"2019","unstructured":"Carlos Bravo-Prieto, Ryan LaRose, Marco Cerezo, Yigit Subasi, Lukasz Cincio, and Patrick J Coles. 2019. Variational quantum linear solver: A hybrid algorithm for linear systems. arXiv:1909.05820. Retrieved from https:\/\/arxiv.org\/abs\/1909.05820.","journal-title":"arXiv:1909.05820"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505"},{"key":"e_1_3_2_27_2","first-page":"880","article-title":"Quantum verification of matrix products","author":"Buhrman H.","year":"2006","unstructured":"H. Buhrman and R. Spalek. 2006. Quantum verification of matrix products. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (2006), 880\u2013889.","journal-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.230501"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.5555\/2011339.2011341"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ISAAC.2020.47"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.1"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aae94a"},{"key":"e_1_3_2_33_2","first-page":"1","article-title":"Classical and quantum algorithms for finding cycles","author":"Cirasella Jill","year":"2006","unstructured":"Jill Cirasella. 2006. Classical and quantum algorithms for finding cycles. MSc Thesis (2006), 1\u201358.","journal-title":"MSc Thesis"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","unstructured":"Chris Godsil and Hanmeng Zhan. 2019. Discrete-time quantum walks and graph structures. Journal of Combinatorial Theory Series A 167 (2019) 181\u2013212.","DOI":"10.1016\/j.jcta.2019.05.003"},{"key":"e_1_3_2_35_2","article-title":"Quantum Approximate Optimization Algorithm","author":"Computing Rigetti","year":"2017","unstructured":"Rigetti Computing. 2017. Quantum Approximate Optimization Algorithm. Published online at https:\/\/github.com\/rigetticomputing\/grove. Accessed: 12\/01\/2017.","journal-title":"Published online at https:\/\/github.com\/rigetticomputing\/grove"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE49297.2020.00021"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms1147"},{"key":"e_1_3_2_40_2","volume-title":"Algorithms","author":"Dasgupta Sanjoy","year":"2008","unstructured":"Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani. 2008. Algorithms. McGraw-Hill, Inc., New York, NY."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456932"},{"key":"e_1_3_2_42_2","first-page":"439","volume-title":"Proceedings of the of the Royal Society of London A","author":"Deutsch D.","year":"1992","unstructured":"D. Deutsch and R. Jozsa. 1992. Rapid solutions of problems by quantum computation. In Proceedings of the of the Royal Society of London A. 439\u2013553."},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1088\/0034-4885\/76\/7\/076001"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.79.052335"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0798"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1137\/050644719"},{"key":"e_1_3_2_47_2","article-title":"A quantum algorithm for finding the minimum","author":"Durr Christoph","year":"1996","unstructured":"Christoph Durr and Peter Hoyer. 1996. A quantum algorithm for finding the minimum. arXiv preprint quant-ph\/9607014 (1996).","journal-title":"arXiv preprint quant-ph\/9607014"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1137\/090745854"},{"key":"e_1_3_2_50_2","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. arXiv:1412.6062. Retrieved from https:\/\/arxiv.org\/abs\/1412.6062."},{"key":"e_1_3_2_51_2","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv preprint arXiv:1411.4028."},{"key":"e_1_3_2_52_2","unstructured":"Edward Farhi Jeffrey Goldstone Sam Gutmann and Michael Sipser. 2000. Quantum computation by adiabatic evolution. arXiv: quant-ph\/0001106. Retrieved from https:\/\/arxiv.org\/abs\/0001106."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_54_2","first-page":"57","article-title":"Fast probabilistic algorithms","author":"Freivalds R.","year":"1979","unstructured":"R. Freivalds. 1979. Fast probabilistic algorithms. In Proc. of 8th Symposium on Mathematical Foundations of Computer Science (1979), 57\u201369.","journal-title":"In Proc. of 8th Symposium on Mathematical Foundations of Computer Science"},{"key":"e_1_3_2_55_2","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co."},{"key":"e_1_3_2_56_2","doi-asserted-by":"crossref","unstructured":"Silvano Garnerone Annalisa Marzuoli and Mario Rasetti. 2009. Efficient quantum processing of three\u2013manifold topological invariants. Advances in Theoretical and Mathematical Physics 13 6 (2009) 1601\u20131652.","DOI":"10.4310\/ATMP.2009.v13.n6.a1"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.86.153"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0084-7"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-008-0438-0"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.87"},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","unstructured":"Vittorio Giovannetti Seth Lloyd and Lorenzo Maccone. 2008. Quantum random access memory. Physical Review Letters 100 16 (2008) 160501.","DOI":"10.1103\/PhysRevLett.100.160501"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.06.001"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.55.R1561"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_70_2","article-title":"IBM Quantum Experience","author":"Corporation IBM","year":"2016","unstructured":"IBM Corporation. 2016. IBM Quantum Experience. Published online at https:\/\/quantumexperience.ng.bluemix.net. Accessed: 12\/01\/2017.","journal-title":"Published online at https:\/\/quantumexperience.ng.bluemix.net"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.64.052312"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.96.195136"},{"key":"e_1_3_2_73_2","article-title":"Quantum Algorithm Zoo","author":"Jordan Stephan","year":"2011","unstructured":"Stephan Jordan. 2011. Quantum Algorithm Zoo. Published online at https:\/\/math.nist.gov\/quantum\/zoo\/. Accessed: 3\/18\/2018.","journal-title":"Published online at https:\/\/math.nist.gov\/quantum\/zoo\/"},{"key":"e_1_3_2_74_2","unstructured":"Stephen P. Jordan. 2009. Fast quantum algorithms for approximating some irreducible representations of groups. (2009) 1\u201321. arXiv:0811.0562. Retrieved from https:\/\/arxiv.org\/abs\/0811.0562."},{"key":"e_1_3_2_75_2","unstructured":"Petteri Kaski. 2002. Eigenvectors and spectra of Cayley graphs. Retrieved from http:\/\/www.tcs.hut.fi\/Studies\/T-79.300\/2002S\/esitelmat\/kaski_paper_020506.pdf."},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1080\/00107151031000110776"},{"key":"e_1_3_2_77_2","unstructured":"V. Kendon. 2011. Where to quantum walk. (2011) 1\u201313. https:\/\/arxiv.org\/abs\/1107.3795."},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447372"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.5555\/1795555"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12138"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature08812"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-019-0167-6"},{"key":"e_1_3_2_83_2","unstructured":"Richard J. Lipton and Kenneth W. Regan. 2014. Quantum Algorithms via Linear Algebra: A Primer. MIT Press."},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms10138"},{"key":"e_1_3_2_85_2","article-title":"Quantum algorithms for supervised and unsupervised machine learning","author":"Lloyd Seth","year":"2013","unstructured":"Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost. 2013. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411. Retrieved from https:\/\/arxiv.org\/abs\/1307.0411.","journal-title":"arXiv:1307.0411"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3029"},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.81.042330"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1137\/050643684"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1038\/nphoton.2012.259"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/18\/2\/023023"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2015.23"},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1800-9_144"},{"key":"e_1_3_2_93_2","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen Michael A.","year":"2016","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2016. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, United Kingdom. 10th Anniversary Edition."},{"key":"e_1_3_2_94_2","unstructured":"Bryan O\u2019Gorman William J. Huggins Eleanor G. Rieffel and K. Birgitta Whaley. 2019. Generalized swap networks for near-term quantum computing. arXiv:1905.05118. Retrieved from https:\/\/arxiv.org\/abs\/1905.05118."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/674832"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.83.032302"},{"key":"e_1_3_2_100_2","first-page":"1473","article-title":"A tale of two sieves","volume":"43","author":"Pomerance Carl","year":"1996","unstructured":"Carl Pomerance. 1996. A tale of two sieves. Notices of the American Mathematical Society 43, 12 (1996), 1473\u20131485.","journal-title":"Notices of the American Mathematical Society"},{"key":"e_1_3_2_101_2","article-title":"Quantum computing and the entanglement frontier","author":"Preskill John","year":"2020","unstructured":"John Preskill. 2020. Quantum computing and the entanglement frontier. Rapporteur Talk at the 25th Solvay Conference on Physics, 19\u201322 October 2011 (2020).","journal-title":"Rapporteur Talk at the 25th Solvay Conference on Physics, 19\u201322 October 2011"},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep03496"},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.130503"},{"key":"e_1_3_2_104_2","unstructured":"Eleanor G. Rieffel and Wolfgang H. Polak. 2011. Quantum computing: A gentle introduction. MIT Press."},{"key":"e_1_3_2_105_2","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_3_2_106_2","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431220"},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_3"},{"key":"e_1_3_2_108_2","unstructured":"N. Santhi. 2017. Quantum Netlist Compiler (QNC) software repository. Retrieved 1 July 2020 from http:\/\/gitlab.lanl.gov\/QuantumProgramming2017\/QNCApplied for LANL LACC authorization for unlimited open-source release December 2017."},{"key":"e_1_3_2_109_2","doi-asserted-by":"publisher","DOI":"10.1080\/00107514.2014.964942"},{"key":"e_1_3_2_110_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.062336"},{"key":"e_1_3_2_111_2","doi-asserted-by":"publisher","DOI":"10.5555\/2011791.2011799"},{"key":"e_1_3_2_112_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.062321"},{"key":"e_1_3_2_113_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"e_1_3_2_114_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_115_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_116_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2017.12.042"},{"key":"e_1_3_2_117_2","unstructured":"Robert S. Smith Michael J. Curtis and William J. Zeng. 2016. A Practical Quantum Instruction Set Architecture. arXiv:1608.03355. Retrieved from https:\/\/arxiv.org\/abs\/1608.03355."},{"key":"e_1_3_2_118_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.108.070502"},{"key":"e_1_3_2_119_2","doi-asserted-by":"publisher","DOI":"10.5555\/3179430.3179434"},{"key":"e_1_3_2_120_2","volume-title":"Quantum Algorithms, Lower Bounds, and Time-space Tradeoffs","author":"Spalek Robert","year":"2006","unstructured":"Robert Spalek et\u00a0al. 2006. Quantum Algorithms, Lower Bounds, and Time-space Tradeoffs. ILLC,Amsterdam."},{"key":"e_1_3_2_121_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.122.060504"},{"key":"e_1_3_2_123_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018628609742"},{"key":"e_1_3_2_124_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.53"},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.210505"},{"key":"e_1_3_2_126_2","article-title":"IBM Q experience backend information","author":"Team IBM QX","year":"2017","unstructured":"IBM QX Team. 2017. IBM Q experience backend information. Retrieved from http:\/\/github.com\/QISKit\/ibmqx-backend-information. Last accessed: 12 December, 2017.","journal-title":"http:\/\/github.com\/QISKit\/ibmqx-backend-information"},{"key":"e_1_3_2_127_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0048-5"},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1038\/414883a"},{"key":"e_1_3_2_129_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.147902"},{"key":"e_1_3_2_130_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304"},{"key":"e_1_3_2_131_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.012320"},{"key":"e_1_3_2_132_2","unstructured":"Chu Ryang Wie. 2017. A Quantum Circuit to Construct All Maximal Cliques Using Grover Search Algorithm. arXiv preprint arXiv:1711.06146."},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa5c73"},{"key":"e_1_3_2_134_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aba038"},{"key":"e_1_3_2_135_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.052313"},{"key":"e_1_3_2_136_2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.7.021027"},{"key":"e_1_3_2_137_2","doi-asserted-by":"crossref","unstructured":"Noson S. Yanofsky and Mirco A. Mannucci. 2008. Quantum computing for computer scientists. Cambridge University Press.","DOI":"10.1017\/CBO9780511813887"},{"key":"e_1_3_2_138_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.118.210504"},{"key":"e_1_3_2_139_2","doi-asserted-by":"crossref","unstructured":"Leo Zhou Sheng-Tao Wang Soonwon Choi Hannes Pichler and Mikhail D. Lukin. 2020. Quantum approximate optimization algorithm: Performance mechanism and implementation on near-term devices. Physical Review X 10 2 (2020) 021067.","DOI":"10.1103\/PhysRevX.10.021067"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:16:58Z","timestamp":1750191418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,7]]},"references-count":138,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12,31]]}},"alternative-id":["10.1145\/3517340"],"URL":"https:\/\/doi.org\/10.1145\/3517340","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,7]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-07-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}