Gast ::
| Hauptseite > Publikationsdatenbank > Quantum annealing and its variants: Application to quadratic unconstrained binary optimization > print |
| Hauptseite > Publikationsdatenbank > Quantum annealing and its variants: Application to quadratic unconstrained binary optimization > print |
| 001 | 1026467 | ||
| 005 | 20241209210459.0 | ||
| 020 | _ | _ | |a 978-3-95806-755-4 |
| 024 | 7 | _ | |2 datacite_doi |a 10.34734/FZJ-2024-03411 |
| 024 | 7 | _ | |2 URN |a urn:nbn:de:0001-20241209125135062-9549579-4 |
| 037 | _ | _ | |a FZJ-2024-03411 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |0 P:(DE-Juel1)176997 |a Mehta, Vrinda |b 0 |e Corresponding author |u fzj |
| 245 | _ | _ | |a Quantum annealing and its variants: Application to quadratic unconstrained binary optimization |f - 2023-11-06 |
| 260 | _ | _ | |a Jülich |b Forschungszentrum Jülich GmbH Zentralbibliothek, Verlag |c 2024 |
| 300 | _ | _ | |a iii, 152 |
| 336 | 7 | _ | |2 DataCite |a Output Types/Dissertation |
| 336 | 7 | _ | |0 PUB:(DE-HGF)3 |2 PUB:(DE-HGF) |a Book |m book |
| 336 | 7 | _ | |2 ORCID |a DISSERTATION |
| 336 | 7 | _ | |2 BibTeX |a PHDTHESIS |
| 336 | 7 | _ | |0 2 |2 EndNote |a Thesis |
| 336 | 7 | _ | |0 PUB:(DE-HGF)11 |2 PUB:(DE-HGF) |a Dissertation / PhD Thesis |b phd |m phd |s 1717750915_3801 |
| 336 | 7 | _ | |2 DRIVER |a doctoralThesis |
| 490 | 0 | _ | |a Schriften des Forschungszentrums Jülich IAS Series |v 59 |
| 502 | _ | _ | |a Dissertation, RWTH Aachen University, 2023 |b Dissertation |c RWTH Aachen University |d 2023 |
| 520 | _ | _ | |a In this thesis, we study the performance of the numerical implementation of quantum annealing, as well as of physical quantum annealing systems from D-Wave Quantum Systems Inc., for solving 2-Satisfiability (2-SAT) and other quadratic unconstrained binaryoptimization (QUBO) problems. For gauging the suitability of quantum annealing for solving these problems, we use three main metrics: the probability of the algorithm to solve the problem, its ability to find all the solutions to the problem if the problem has more than one solution, and the scaling of the time to solution as a function of the problem size. In doing so, we compare the performance of the numerically simulated ideal quantum annealing with its actual physical realization. We find that the ideal, standard quantum annealing algorithm can solve the sets of 2-SAT problems considered in this work, even if with a low success probability for hard problems, and can sample the degenerate ground states of the 2-SAT problems with multiple satisfying assignments in accordance with perturbation theory. However, in the long annealing time limit, the ideal standard annealing algorithm leads to a scaling of the time to solution that is worse compared to even the simple enumeration of all the possible states. On the other hand, we find noise and temperature effects to play an active role in the evolution of the state of the system on the D-Wave quantum annealers. These systems can solve a majority of the studied problems with a relatively large success probability, and the scaling of the time to solution, though still growing exponentially in the system size, is significantly improved. Next, by means of simulations, we introduce two modifications in the standard quantum annealing algorithm, and gauge the performance of the modified algorithms. These modifications are the addition of a trigger Hamiltonian to the standard quantum annealing Hamiltonian, or a change in the initial Hamiltonian of the annealing Hamiltonian. We choose the trigger Hamiltonian to have either ferromagnetic or antiferromagnetic transverse couplings, while the additional higher-order couplings added to the typically chosen initial Hamiltonian are ferromagnetic. We find that these modifications can lead to significant improvements in the performance of the annealing algorithm, even if the scaling behavior is still exponential. |
| 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/1026467/files/IAS_Series_59.pdf |y OpenAccess |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/1026467/files/IAS_Series_59.gif?subformat=icon |x icon |y OpenAccess |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/1026467/files/IAS_Series_59.jpg?subformat=icon-1440 |x icon-1440 |y OpenAccess |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/1026467/files/IAS_Series_59.jpg?subformat=icon-180 |x icon-180 |y OpenAccess |
| 856 | 4 | _ | |u https://juser.fz-juelich.de/record/1026467/files/IAS_Series_59.jpg?subformat=icon-640 |x icon-640 |y OpenAccess |
| 909 | C | O | |o oai:juser.fz-juelich.de:1026467 |p openaire |p open_access |p urn |p driver |p VDB |p dnbdelivery |
| 910 | 1 | _ | |0 I:(DE-588b)5008462-8 |6 P:(DE-Juel1)176997 |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 phd |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a book |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | 1 | _ | |a FullTexts |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|