Home > Publications database > Comparison of Factoring Algorithms on the D-Wave Quantum Annealer > print

001     1030222
005     20240902204341.0
024 7 _ |2 datacite_doi
|a 10.34734/FZJ-2024-05254
037 _ _ |a FZJ-2024-05254
041 _ _ |a English
100 1 _ |0 P:(DE-Juel1)203492
|a Hanussek, Philipp Jan
|b 0
|e Corresponding author
|u fzj
245 _ _ |a Comparison of Factoring Algorithms on the D-Wave Quantum Annealer
|f - 2024-08-14
260 _ _ |c 2024
300 _ _ |a 46 pages
336 7 _ |2 DRIVER
|a bachelorThesis
336 7 _ |0 2
|2 EndNote
|a Thesis
336 7 _ |2 DataCite
|a Output Types/Supervised Student Publication
336 7 _ |0 PUB:(DE-HGF)2
|2 PUB:(DE-HGF)
|a Bachelor Thesis
|b bachelor
|m bachelor
|s 1724756206_15957
336 7 _ |2 BibTeX
|a MASTERSTHESIS
336 7 _ |2 ORCID
|a SUPERVISED_STUDENT_PUBLICATION
502 _ _ |a Bachelorarbeit, FH Aachen, 2024
|b Bachelorarbeit
|c FH Aachen
|d 2024
|o 2024-08-14
520 _ _ |a The goal of this work is to implement and assess different approaches for solving the factoring problem on quantum annealers. We identify three promising approaches that use custom and heuristic embedding and experimentally test their performance on the Advantage quantum annealer by D-Wave Systems Inc. To reduce terms of higher order than quadratic, we formulate an approach that takes into account the coefficient of the term to be reduced, and we show experimentally that it produces valid models for smaller problem sizes. We evaluate the impact of using individual per-qubit offsets and find that this feature can significantly improve the success frequencies for some problem sizes. For others, applying offsets can lead to a decrease in success frequencies.We find that all three examined factoring approaches exhibit a scaling with problem size that is qualitatively similar to random drawing. Generally, all methods fail to find solutions for larger problem sizes. On average, the success frequencies are only $10-100$ times higher than randomly drawing each bit of $p$ and $q$. However, the approach with custom embedding is able to find ground states even for larger problem sizes, indicating a problem formulation that is well suited for the quantum annealer.
536 _ _ |0 G:(DE-HGF)POF4-5111
|a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)
|c POF4-511
|f POF IV
|x 0
856 4 _ |u https://juser.fz-juelich.de/record/1030222/files/bachelorarbeit_final.pdf
|y OpenAccess
856 4 _ |u https://juser.fz-juelich.de/record/1030222/files/bachelorarbeit_final.gif?subformat=icon
|x icon
|y OpenAccess
856 4 _ |u https://juser.fz-juelich.de/record/1030222/files/bachelorarbeit_final.jpg?subformat=icon-1440
|x icon-1440
|y OpenAccess
856 4 _ |u https://juser.fz-juelich.de/record/1030222/files/bachelorarbeit_final.jpg?subformat=icon-180
|x icon-180
|y OpenAccess
856 4 _ |u https://juser.fz-juelich.de/record/1030222/files/bachelorarbeit_final.jpg?subformat=icon-640
|x icon-640
|y OpenAccess
909 C O |o oai:juser.fz-juelich.de:1030222
|p openaire
|p open_access
|p VDB
|p driver
|p dnbdelivery
910 1 _ |0 I:(DE-588b)5008462-8
|6 P:(DE-Juel1)203492
|a Forschungszentrum Jülich
|b 0
|k FZJ
913 1 _ |0 G:(DE-HGF)POF4-511
|1 G:(DE-HGF)POF4-510
|2 G:(DE-HGF)POF4-500
|3 G:(DE-HGF)POF4
|4 G:(DE-HGF)POF
|9 G:(DE-HGF)POF4-5111
|a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|v Enabling Computational- & Data-Intensive Science and Engineering
|x 0
914 1 _ |y 2024
915 _ _ |0 StatID:(DE-HGF)0510
|2 StatID
|a OpenAccess
915 _ _ |0 LIC:(DE-HGF)CCBY4
|2 HGFVOC
|a Creative Commons Attribution CC BY 4.0
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)JSC-20090406
|k JSC
|l Jülich Supercomputing Center
|x 0
980 _ _ |a bachelor
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)JSC-20090406
980 1 _ |a FullTexts

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21