{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:30:09Z","timestamp":1760146209475,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T00:00:00Z","timestamp":1729209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT (Boolean satisfiability) problem. The quantum computing experiments were performed using Grover\u2019s search algorithm to find a valid solution. The experiments were performed under different variations to demonstrate their effects on the results. Changing the number of shots, qubit mapping, and using a different quantum processor were all among the experimental variables. The study also branched into a dedicated experiment highlighting a peculiar behavior that IBM quantum processors exhibit when running circuits with a certain number of shots.<\/jats:p>","DOI":"10.3390\/e26100875","type":"journal-article","created":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T10:49:22Z","timestamp":1729507762000},"page":"875","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better"],"prefix":"10.3390","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4269-2856","authenticated-orcid":false,"given":"Ahmad","family":"Bennakhi","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3647-8738","authenticated-orcid":false,"given":"Gregory T.","family":"Byrd","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6048-5770","authenticated-orcid":false,"given":"Paul","family":"Franzon","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,10,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Zulehner, A., and Wille, R. (2020). Introducing Design Automation for Quantum Computing, Springer Nature Switzerland AG.","DOI":"10.1007\/978-3-030-41753-6"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Turtletaub, I., Li, G., Ibrahim, M., and Franzon, P. (2020, January 16\u201320). Application of Quantum Machine Learning to VLSI Placement. Proceedings of the 2020 ACM\/IEEE Workshop on Machine Learning for CAD, Virtual.","DOI":"10.1145\/3380446.3430644"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","article-title":"Grover\u2019s quantum searching algorithm is optimal","volume":"60","author":"Zalka","year":"1999","journal-title":"Phys. Rev. A"},{"key":"ref_4","unstructured":"Cerf, N.J., Grover, L.K., and Williams, C.P. (1998). Nested quantum search and NP-complete problems. arXiv."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Tseitin, G. (1983). On the complexity of derivation in propositional calculus. Automation Of Reasoning: 2: Classical Papers On Computational Logic 1967\u20131970, Springer.","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Gabor, T., Zielinski, S., Feld, S., Roch, C., Seidel, C., Neukart, F., Galter, I., Mauerer, W., and Linnhoff-Popien, C. (2019, January 18). Assessing solution quality of 3SAT on a quantum annealing platform. Proceedings of the Quantum Technology and Optimization Problems: First International Workshop, QTOP 2019, Munich, Germany. Proceedings 1.","DOI":"10.1007\/978-3-030-14082-3_3"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"056126","DOI":"10.1103\/PhysRevE.66.056126","article-title":"Random k-satisfiability problem: From an analytic solution to an efficient algorithm","volume":"66","author":"Zecchina","year":"2002","journal-title":"Phys. Rev. E"},{"key":"ref_8","unstructured":"Qiskit-Community (2024, August 23). Qiskit-Community\/QGSS-2023: All Things Qiskit Global Summer School 2023: Theory to Implementation\u2014Lecture Notes, Labs and Solutions. Available online: https:\/\/github.com\/qiskit-community\/qgss-2023."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., and Sakallah, K. (2000, January 1). Boolean satisfiability in electronic design automation. Proceedings of the 37th Annual Design Automation Conference, Los Angeles, CA, USA.","DOI":"10.1145\/337292.337611"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jcss.2006.09.003","article-title":"Quantum cooperative search algorithm for 3-SAT","volume":"73","author":"Cheng","year":"2007","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2021.3120449","article-title":"Finding solutions to the integer case constraint satisfiability problem using Grover\u2019s algorithm","volume":"2","author":"Vinod","year":"2021","journal-title":"IEEE Trans. Quantum Eng."},{"key":"ref_12","unstructured":"Fadillah, M.H.A., Idrus, B., Hasan, M.S., and Mohd, S. (2021, January 12\u201313). Impact of various IBM Quantum architectures with different properties on Grover\u2019s algorithm. Proceedings of the 2021 International Conference on Electrical Engineering and Informatics (ICEEI), Terengganu, Malaysia."},{"key":"ref_13","unstructured":"(2024, October 17). D-Wave Systems: The Practical Quantum Computing Company. Available online: https:\/\/www.dwavesys.com\/."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","article-title":"The unconstrained binary quadratic programming problem: A survey","volume":"28","author":"Kochenberger","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10479-022-04634-2","article-title":"Quantum bridge analytics I: A tutorial on formulating and using QUBO models","volume":"314","author":"Glover","year":"2022","journal-title":"Ann. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Su, J., Tu, T., and He, L. (2016, January 5). A quantum annealing approach for boolean satisfiability problem. Proceedings of the 53rd Annual Design Automation Conference, Austin, TX, USA.","DOI":"10.1145\/2897937.2897973"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Sahai, T., Mishra, A., Pasini, J., and Jha, S. (2020, January 9\u201311). Estimating the density of states of Boolean satisfiability problems on classical and quantum computing platforms. Proceedings of the AAAI Conference on Artificial Intelligence, New York, NY, USA.","DOI":"10.1609\/aaai.v34i02.5524"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"013096","DOI":"10.1103\/PhysRevResearch.4.013096","article-title":"Solving systems of Boolean multivariate equations with quantum annealing","volume":"4","author":"Lin","year":"2022","journal-title":"Phys. Rev. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"010327","DOI":"10.1103\/PRXQuantum.4.010327","article-title":"Suppressing Quantum Circuit Errors Due to System Variability","volume":"4","author":"Nation","year":"2023","journal-title":"PRX Quantum"},{"key":"ref_20","unstructured":"Qiskit (2023, November 07). \u201cRandomized Benchmarking.\u201d Randomized Benchmarking-Qiskit Experiments 0.5.4 Documentation. Available online: https:\/\/qiskit.org\/ecosystem\/experiments\/manuals\/verification\/randomized_benchmarking.html."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/10\/875\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:16:15Z","timestamp":1760112975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/10\/875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,18]]},"references-count":20,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["e26100875"],"URL":"https:\/\/doi.org\/10.3390\/e26100875","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2024,10,18]]}}}