Asset Details
Do you wish to reserve the book?
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
Do you wish to request the book?
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
2020
Overview
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to balance out singularities in the logical problem changing its universality class. Smart choice of embedding parameters reduces annealing times for random Ising chain from \\(O(exp[c\\sqrt N])\\) to \\(O(N^2)\\). Dramatic reduction in time-to-solution for QA is confirmed by numerics, for which we developed a custom integrator to overcome convergence issues.
Publisher
Cornell University Library, arXiv.org
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.