Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
| Autor: | Sergey Knysh, Davide Venturelli, Eugeniu Plamadeala |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Physics
Discrete mathematics Quantum Physics Speedup Quantum annealing FOS: Physical sciences Disordered Systems and Neural Networks (cond-mat.dis-nn) 02 engineering and technology Condensed Matter - Disordered Systems and Neural Networks Renormalization group 021001 nanoscience & nanotechnology 01 natural sciences Integrator 0103 physical sciences Embedding Gravitational singularity Logical problem Quantum Physics (quant-ph) 010306 general physics 0210 nano-technology Quantum |
| Zdroj: | Physical Review B. 102 |
| ISSN: | 2469-9969 2469-9950 |
| DOI: | 10.1103/physrevb.102.220407 |
| Popis: | 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. 11 pages [5 pages (3 figs) main text+references; 5 pages (2 figs) appendix; 1 page code listing] |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|