Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better

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’s search algorithm to find a valid solution. The experime...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Entropy (Basel, Switzerland) Jg. 26; H. 10; S. 875
Hauptverfasser: Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Switzerland MDPI AG 18.10.2024
MDPI
Schlagworte:
ISSN:1099-4300, 1099-4300
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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’s 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.
AbstractList 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's 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.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's 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.
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’s 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.
Audience Academic
Author Franzon, Paul
Byrd, Gregory T.
Bennakhi, Ahmad
AuthorAffiliation Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA; gbyrd@ncsu.edu (G.T.B.); paulf@ncsu.edu (P.F.)
AuthorAffiliation_xml – name: Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA; gbyrd@ncsu.edu (G.T.B.); paulf@ncsu.edu (P.F.)
Author_xml – sequence: 1
  givenname: Ahmad
  orcidid: 0000-0002-4269-2856
  surname: Bennakhi
  fullname: Bennakhi, Ahmad
– sequence: 2
  givenname: Gregory T.
  orcidid: 0000-0003-3647-8738
  surname: Byrd
  fullname: Byrd, Gregory T.
– sequence: 3
  givenname: Paul
  orcidid: 0000-0002-6048-5770
  surname: Franzon
  fullname: Franzon, Paul
BackLink https://www.ncbi.nlm.nih.gov/pubmed/39451951$$D View this record in MEDLINE/PubMed
BookMark eNpdkktv3CAUha0qVfNoF_0DlaVu2oVTMGBDN9VklLQjRX1okjUCfD1hZMwUcKT---JMOkq6Ah0-Dtxz72lxNPoRiuItRueECPQJ6gYjxFv2ojjBSIiKEoSOnuyPi9MYtwjVpMbNq-KYCMqwYPik-L72w70dN2W6g_KiWi9uyp_B6wFceRtn_dekxjS5cundbkpZ-VyunRoGCOUqlmvvIFkHsbyAlCC8Ll72aojw5nE9K26vLm-W36rrH19Xy8V1ZWgjUsU6jZRRHcG8xS3nPQUDAre11kbrpsEdAaBNi2hPKHANwDmHput6Bl3fKnJWrPa-nVdbuQvWqfBHemXlg-DDRqqQrBlAKgWCCIW4bmuKmRYdU0QZA0pwjtDs9WXvtZu0g87AmIIanpk-Pxntndz4e4kxQ21ONzt8eHQI_vcEMUlno4FhUCP4KUqCa8SEwKzO6Pv_0K2fwpizeqAawimaqfM9tVG5Ajv2Pj9s5sTAWZOb39usLzimhAuGRL7w7mkNh8__a3QGPu4BE3yMAfoDgpGch0gehoj8BVyft6s
Cites_doi 10.1007/s10479-022-04634-2
10.1145/3380446.3430644
10.1007/s10878-014-9734-0
10.1609/aaai.v34i02.5524
10.1007/978-3-030-14082-3_3
10.1103/PhysRevResearch.4.013096
10.1007/978-1-4899-5327-8_25
10.1145/2897937.2897973
10.1007/978-3-030-41753-6
10.1016/j.jcss.2006.09.003
10.1109/TQE.2021.3120449
10.1103/PhysRevA.60.2746
10.1145/337292.337611
10.1103/PRXQuantum.4.010327
10.1103/PhysRevE.66.056126
ContentType Journal Article
Copyright COPYRIGHT 2024 MDPI AG
2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
2024 by the authors. 2024
Copyright_xml – notice: COPYRIGHT 2024 MDPI AG
– notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
– notice: 2024 by the authors. 2024
DBID AAYXX
CITATION
NPM
7TB
8FD
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
HCIFZ
KR7
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
7X8
5PM
DOA
DOI 10.3390/e26100875
DatabaseName CrossRef
PubMed
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
SciTech Premium Collection
Civil Engineering Abstracts
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
MEDLINE - Academic
PubMed Central (Full Participant titles)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
PubMed
Publicly Available Content Database
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Civil Engineering Abstracts
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic


Publicly Available Content Database

CrossRef
PubMed
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 3
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
EISSN 1099-4300
ExternalDocumentID oai_doaj_org_article_aae939a08b72415b9d5a3accea98800a
PMC11507300
A814389509
39451951
10_3390_e26100875
Genre Journal Article
GeographicLocations Nigeria
Ecuador
GeographicLocations_xml – name: Ecuador
– name: Nigeria
GroupedDBID 29G
2WC
5GY
5VS
8FE
8FG
AADQD
AAFWJ
AAYXX
ABDBF
ABJCF
ACIWK
ACUHS
ADBBV
AEGXH
AENEX
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
BGLVJ
CCPQU
CITATION
CS3
DU5
E3Z
ESX
F5P
GROUPED_DOAJ
GX1
HCIFZ
HH5
IAO
ITC
J9A
KQ8
L6V
M7S
MODMG
M~E
OK1
OVT
PGMZT
PHGZM
PHGZT
PIMPY
PQGLB
PROAC
PTHSS
RNS
RPM
TR2
TUS
XSB
~8M
NPM
7TB
8FD
ABUWG
AZQEC
DWQXO
FR3
KR7
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
7X8
PUEGO
5PM
ID FETCH-LOGICAL-c469t-5db0acad31871788f4ece9172bbcbb661d3ee46704f34e8bee888e6ddf5edf7a3
IEDL.DBID DOA
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001342499100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1099-4300
IngestDate Fri Oct 03 12:53:08 EDT 2025
Tue Nov 04 02:05:03 EST 2025
Thu Sep 04 16:37:07 EDT 2025
Fri Jul 25 12:01:51 EDT 2025
Tue Nov 04 18:14:40 EST 2025
Mon Jul 21 06:05:38 EDT 2025
Sat Nov 29 07:16:10 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 10
Keywords electronic design automation (EDA)
Boolean satisfiability problem
quantum computing
Grover’s search
closed-box testing
conjunctive normal form (CNF)
B-SAT
Language English
License Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c469t-5db0acad31871788f4ece9172bbcbb661d3ee46704f34e8bee888e6ddf5edf7a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-6048-5770
0000-0003-3647-8738
0000-0002-4269-2856
OpenAccessLink https://doaj.org/article/aae939a08b72415b9d5a3accea98800a
PMID 39451951
PQID 3120638402
PQPubID 2032401
ParticipantIDs doaj_primary_oai_doaj_org_article_aae939a08b72415b9d5a3accea98800a
pubmedcentral_primary_oai_pubmedcentral_nih_gov_11507300
proquest_miscellaneous_3120599152
proquest_journals_3120638402
gale_infotracacademiconefile_A814389509
pubmed_primary_39451951
crossref_primary_10_3390_e26100875
PublicationCentury 2000
PublicationDate 20241018
PublicationDateYYYYMMDD 2024-10-18
PublicationDate_xml – month: 10
  year: 2024
  text: 20241018
  day: 18
PublicationDecade 2020
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Basel
PublicationTitle Entropy (Basel, Switzerland)
PublicationTitleAlternate Entropy (Basel)
PublicationYear 2024
Publisher MDPI AG
MDPI
Publisher_xml – name: MDPI AG
– name: MDPI
References Vinod (ref_11) 2021; 2
Cheng (ref_10) 2007; 73
ref_13
ref_12
Lin (ref_18) 2022; 4
ref_20
Nation (ref_19) 2023; 4
ref_1
Glover (ref_15) 2022; 314
ref_2
Kochenberger (ref_14) 2014; 28
ref_17
ref_16
Zalka (ref_3) 1999; 60
ref_9
ref_8
Zecchina (ref_7) 2002; 66
ref_5
ref_4
ref_6
References_xml – volume: 314
  start-page: 141
  year: 2022
  ident: ref_15
  article-title: Quantum bridge analytics I: A tutorial on formulating and using QUBO models
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-022-04634-2
– ident: ref_2
  doi: 10.1145/3380446.3430644
– ident: ref_8
– volume: 28
  start-page: 58
  year: 2014
  ident: ref_14
  article-title: The unconstrained binary quadratic programming problem: A survey
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-014-9734-0
– ident: ref_17
  doi: 10.1609/aaai.v34i02.5524
– ident: ref_4
– ident: ref_6
  doi: 10.1007/978-3-030-14082-3_3
– ident: ref_12
– volume: 4
  start-page: 013096
  year: 2022
  ident: ref_18
  article-title: Solving systems of Boolean multivariate equations with quantum annealing
  publication-title: Phys. Rev. Res.
  doi: 10.1103/PhysRevResearch.4.013096
– ident: ref_5
  doi: 10.1007/978-1-4899-5327-8_25
– ident: ref_16
  doi: 10.1145/2897937.2897973
– ident: ref_1
  doi: 10.1007/978-3-030-41753-6
– volume: 73
  start-page: 123
  year: 2007
  ident: ref_10
  article-title: Quantum cooperative search algorithm for 3-SAT
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1016/j.jcss.2006.09.003
– volume: 2
  start-page: 1
  year: 2021
  ident: ref_11
  article-title: Finding solutions to the integer case constraint satisfiability problem using Grover’s algorithm
  publication-title: IEEE Trans. Quantum Eng.
  doi: 10.1109/TQE.2021.3120449
– ident: ref_13
– volume: 60
  start-page: 2746
  year: 1999
  ident: ref_3
  article-title: Grover’s quantum searching algorithm is optimal
  publication-title: Phys. Rev. A
  doi: 10.1103/PhysRevA.60.2746
– ident: ref_9
  doi: 10.1145/337292.337611
– volume: 4
  start-page: 010327
  year: 2023
  ident: ref_19
  article-title: Suppressing Quantum Circuit Errors Due to System Variability
  publication-title: PRX Quantum
  doi: 10.1103/PRXQuantum.4.010327
– ident: ref_20
– volume: 66
  start-page: 056126
  year: 2002
  ident: ref_7
  article-title: Random k-satisfiability problem: From an analytic solution to an efficient algorithm
  publication-title: Phys. Rev. E
  doi: 10.1103/PhysRevE.66.056126
SSID ssj0023216
Score 2.3762188
Snippet This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT (Boolean...
SourceID doaj
pubmedcentral
proquest
gale
pubmed
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
StartPage 875
SubjectTerms Algorithms
B-SAT
Boolean
Boolean satisfiability problem
Circuits
conjunctive normal form (CNF)
electronic design automation (EDA)
Grover’s search
Logic
Microprocessors
Quantum computers
Quantum computing
Qubits (quantum computing)
Search algorithms
Variables
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7BlgMXHuIVKMggJE5Rk9hpHC5oF7UCCa0WtqDeLD8mpRKblH3w-xk73tAIiQtX23Fsj-dlj78BeG0rgXVemtSSBE5Fk4vU-EgAJ7HRjQecCm-rvn2q5nN5fl4v4oHbJoZV7mViENSus_6M_Ijnhdeu5O68u_qZ-qxR_nY1ptC4CQceqUxM4GB2Ml98GVwuXuTHPZ4QJ-f-CMlfCBjuIy0UwPr_FsnXdNI4XvKaAjq9-79Dvwd3ounJpv1euQ83sH0A82X3w58pMDIE2SxdTs_Yos8xw0I0Afu8o7XfrVif_oFK3rLlyidgWbOPG7bsVhjS07NZeBf0EL6enpy9_5DGHAupJcd4m5bOZNpqR6xNjp2UjUBLxKsKY6wxpLwdRyRhmomGC5QGkVxmPHauKdE1leaPYNJ2LT4BZrDSpqiQy0wKFII-p66lqah3bYs8gVf7NVdXPZSGIhfEE0YNhElg5qkxNPDo16GgW1-oyExKa6x5rTPq2xsgpnalpl9Y1DWJo0wn8MbTUnkeJYJZHZ8a0Dg92pWaypD0nWylBA73JFOReTfqD70SeDlUE9v5uxTdYrfr25RkW5fU5nG_O4Yx8zpg9tCE5WjfjCY1rmkvvwdo72Cf8yx7-u9xPYPbBXGR16G5PITJdr3D53DL_tpebtYvIhP8BtHtE_M
  priority: 102
  providerName: ProQuest
Title Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
URI https://www.ncbi.nlm.nih.gov/pubmed/39451951
https://www.proquest.com/docview/3120638402
https://www.proquest.com/docview/3120599152
https://pubmed.ncbi.nlm.nih.gov/PMC11507300
https://doaj.org/article/aae939a08b72415b9d5a3accea98800a
Volume 26
WOSCitedRecordID wos001342499100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: DOA
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: M7S
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: BENPR
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1099-4300
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0023216
  issn: 1099-4300
  databaseCode: PIMPY
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB5B4cAFgXgFysogJE5Rk9hpHG67aKtWglUgBS0ny3YmaiU2i_bBsb-9Yzu72ogDl15yiB3L_ibjmUnG3wB8sIXAMs1NbGkHjkWbiti4TIBGYqtbRzjlz1b9_FLMZnI-L6uDUl8uJyzQAwfgTrTGkpc6kaZwxsaUTa65ppF1Sa9e4l0j8np2wVQfavEsPQ08QpyC-hOkOMFztw-sjyfp_3crPrBFwzzJA8Nz9gQe9x4jG4eZPoV72D2DWb387T4FMPLf2CSux5esCqVhmE8CYN-2BNl2wULVBrrzidULVzdlxS7WrF4u0FeVZxN_nOc5_DibXn4-j_vSCLGleHYT541JtNUNaSTFY1K2Ai1hXmTGWGPI5jYckfbARLRcoDSIFOniadO0OTZtofkLOOqWHb4CZrDQJiuQy0QKFIIep6EJbhpd2yyN4P0OMvUnMGAoihwcrmqPawQTB-a-gyOt9jdIlKoXpfqfKCP46EShnGoR3lb3JwRono6kSo2lr9VOLk4ExztpqV7n1oqnmfO_KCCO4N2-mbTF_QLRHS63oU9OLnFOfV4G4e7nzEtPtUMLlgOxDxY1bOmurzwjt3ereZK8vgsY3sCjjFTEGchUHsPRZrXFt_DQ_t1cr1cjuF_M5QgeTKaz6vvIv_Ujl7Bau-vNlFqqi6_Vr1szkgvV
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VLRJceIhXoIBBIE5Rk9hpHCSEdoGqq25Xi3ZB7SnYzgQqsUnZB4g_xW9k7DzoColbD1wTx7HjL9_Ml3hmAJ6ZRGAaxto3xMC-KELha7sTIJdYqMImnHKxVR9HyXgsj4_TyRb8amNh7LbKlhMdUeeVsd_Id3kYWetKcuf12TffVo2yf1fbEho1LA7x5w-SbMtXw7e0vs-jaP_d7M2B31QV8A1JwZUf5zpQRuUEZpIyUhYCDQ03ibQ2WpO5yjki0UcgCi5QakQSibiX50WMeZEoTv1egm1BYJc92J4MjyYnncTjUbhX5y_iPA12kfSJyxm_YfVccYC_TcA5G7i5P_Ocwdu__r89qhtwrXGtWb9-F27CFpa3YDytvtpvJowcXTbwp_0Zm9Q1dJjbLcHerwlb6zmry1vQkZdsOrcFZhZsuGTTao4rGyXDBi7u6TZ8uJAp3IFeWZV4D5jGROkoQS4DKVAIupy6ljqh3pWJQg-etmucndWpQjKSWBYIWQcEDwZ29bsGNru3O1AtPmcNWWRKYcpTFVDf1sHSaR4ruoVBlRLdBsqDFxY7meUgAohRTSgFjdNm88r60hW1J1_Qg50WIllDTsvsDz48eNKdJlqx_4pUidW6bhOTdoipzd0ajd2YeepyEtGE5QZONya1eaY8_eJSlzv9wYPg_r_H9RiuHMyORtloOD58AFcjYgzrL4RyB3qrxRofwmXzfXW6XDxqXkAGny4ayL8BsXJ1Bg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VghAXHuIVKGAQiFO0SZw0DhJCu5QVq1arRVtQb67tTGilblL2AeKv8esYOw8aIXHrgWvi9drJl2_mS-YB8NKkMWZhon1DDOzHRRj72kYC5AILVdiCUy636stBOp2Ko6NstgW_2lwYG1bZcqIj6rwy9h35gIeRta4kdwZFExYx2xu_O__m2w5S9ktr206jhsg-_vxB8m31drJH9_pVFI0_HL7_6DcdBnxDsnDtJ7kOlFE5AZtkjRBFjIaWnkZaG63JdOUckagkiAseo9CIJBhxN8-LBPMiVZzmvQJX05j8BBc2OO_EHo_C3bqSEedZMEBSKq56fM_-uTYBfxuDC9awH6l5wfSNb_3PF-023Gwcbjasn5A7sIXlXZjOqzP7JoWR-8tG_nx4yGZ1Zx3mYijYpw0hbrNgddMLOvKGzRe27cySTVZsXi1wbXNn2MhlQ92Dz5eyhfuwXVYlPgSmMVU6SpGLQMQYx_RzmlrolGZXJgo9eNHeb3leFxCRJLwsKGQHCg9GFgndAFvz2x2oll9lQyFSKcx4pgKa27pdOssTRX9hUGVEwoHy4LXFkbTMRGAxqkmwoHXaGl9yKFyre_IQPdhp4SIbylrJP1jx4Hl3msjGfkFSJVabekxCiiKhMQ9qZHZr5pmrVEQbFj3M9jbVP1OenriC5k6V8CB49O91PYPrhF55MJnuP4YbEdGIdSJCsQPb6-UGn8A18319ulo-dU8ig-PLRvFv_Vh8TQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solving+the+B-SAT+Problem+Using+Quantum+Computing%3A+Smaller+Is+Sometimes+Better&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Bennakhi%2C+Ahmad&rft.au=Byrd%2C+Gregory+T&rft.au=Franzon%2C+Paul&rft.date=2024-10-18&rft.issn=1099-4300&rft.eissn=1099-4300&rft.volume=26&rft.issue=10&rft_id=info:doi/10.3390%2Fe26100875&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon