001018614 001__ 1018614
001018614 005__ 20231214201903.0
001018614 0247_ $$2datacite_doi$$a10.34734/FZJ-2023-04929
001018614 037__ $$aFZJ-2023-04929
001018614 1001_ $$0P:(DE-Juel1)176997$$aMehta, Vrinda$$b0$$ufzj
001018614 1112_ $$aNonequilibrium Physics – Current Trends and Future Perspectives$$cBad Honnef$$d2023-08-28 - 2023-09-01$$wGermany
001018614 245__ $$aQuantum annealing: Sampling efficiency for 2-SAT problems with multiple solutions
001018614 260__ $$c2023
001018614 3367_ $$033$$2EndNote$$aConference Paper
001018614 3367_ $$2BibTeX$$aINPROCEEDINGS
001018614 3367_ $$2DRIVER$$aconferenceObject
001018614 3367_ $$2ORCID$$aCONFERENCE_POSTER
001018614 3367_ $$2DataCite$$aOutput Types/Conference Poster
001018614 3367_ $$0PUB:(DE-HGF)24$$2PUB:(DE-HGF)$$aPoster$$bposter$$mposter$$s1702537457_29991$$xOther
001018614 520__ $$aThe performance of quantum annealing has been studied well for solving optimization problems with a unique solution. One of the most common metrics of performance is the scaling of the success probability (the probability with which one finds the solution to the problem) or related quantities like time to solution (TTS) [1]. On the other hand, for problems with multiple solutions, another aspect of performance that becomes relevant is the fairness of quantum annealing in sampling the various solutions of the problem, i.e., whether or not it can sample all the solutions of the problem with comparable probabilities [2]. Using both simulations and the D-Wave Advantage_system5.1 (DWAdv) quantum annealer we study the sampling efficiency of the standard quantum annealing algorithm as well as the reverse annealing protocol, as implemented by the D-Wave systems, for solving 2-Satisfiability (SAT) problems with four satisfying assignments. We find that while the numerically obtained sampling probabilities using the standard quantum annealing algorithm are not always fair, but in agreement with the perturbation theory in the long annealing time limit, the sampling probabilities of the four ground states from DWAdv are comparable for a majority of the problems, which indicates the presence of noise and temperature effects in the latter. On the other hand, we find that the sampling probabilities for the reverse annealing protocol depend greatly on the choice of annealing times, reversal distance, waiting time, and the initial state.
001018614 536__ $$0G:(DE-HGF)POF4-5111$$a5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)$$cPOF4-511$$fPOF IV$$x0
001018614 7001_ $$0P:(DE-Juel1)144355$$aJin, Fengping$$b1$$ufzj
001018614 7001_ $$0P:(DE-Juel1)138295$$aMichielsen, Kristel$$b2$$ufzj
001018614 7001_ $$0P:(DE-Juel1)179169$$aDe Raedt, Hans$$b3$$ufzj
001018614 8564_ $$uhttps://juser.fz-juelich.de/record/1018614/files/FairSampling.pdf$$yOpenAccess
001018614 8564_ $$uhttps://juser.fz-juelich.de/record/1018614/files/FairSampling.gif?subformat=icon$$xicon$$yOpenAccess
001018614 8564_ $$uhttps://juser.fz-juelich.de/record/1018614/files/FairSampling.jpg?subformat=icon-1440$$xicon-1440$$yOpenAccess
001018614 8564_ $$uhttps://juser.fz-juelich.de/record/1018614/files/FairSampling.jpg?subformat=icon-180$$xicon-180$$yOpenAccess
001018614 8564_ $$uhttps://juser.fz-juelich.de/record/1018614/files/FairSampling.jpg?subformat=icon-640$$xicon-640$$yOpenAccess
001018614 909CO $$ooai:juser.fz-juelich.de:1018614$$popenaire$$popen_access$$pVDB$$pdriver
001018614 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)176997$$aForschungszentrum Jülich$$b0$$kFZJ
001018614 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)144355$$aForschungszentrum Jülich$$b1$$kFZJ
001018614 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)138295$$aForschungszentrum Jülich$$b2$$kFZJ
001018614 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)179169$$aForschungszentrum Jülich$$b3$$kFZJ
001018614 9131_ $$0G:(DE-HGF)POF4-511$$1G:(DE-HGF)POF4-510$$2G:(DE-HGF)POF4-500$$3G:(DE-HGF)POF4$$4G:(DE-HGF)POF$$9G:(DE-HGF)POF4-5111$$aDE-HGF$$bKey Technologies$$lEngineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action$$vEnabling Computational- & Data-Intensive Science and Engineering$$x0
001018614 9141_ $$y2023
001018614 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
001018614 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
001018614 9801_ $$aFullTexts
001018614 980__ $$aposter
001018614 980__ $$aVDB
001018614 980__ $$aUNRESTRICTED
001018614 980__ $$aI:(DE-Juel1)JSC-20090406