Entanglement in a quantum annealing processor

  1. T. Lanting,
  2. A.J. Przybysz,
  3. A. Yu. Smirnov,
  4. F.M. Spedalieri,
  5. M.H. Amin,
  6. A.J. Berkley,
  7. R. Harris,
  8. F. Altomare,
  9. S. Boixo,
  10. P. Bunyk,
  11. N. Dickson,
  12. C. Enderud,
  13. J.P. Hilton,
  14. E. Hoskinson,
  15. M.W. Johnson,
  16. E. Ladizinsky,
  17. N. Ladizinsky,
  18. R. Neufeld,
  19. T. Oh,
  20. I. Perminov,
  21. C. Rich,
  22. M.C. Thom,
  23. E. Tolkacheva,
  24. S. Uchaikin,
  25. A.B. Wilson,
  26. and G. Rose
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising