1. Bruno Apolloni , Nicolò Cesa-Bianchi , and Diego De Falco . 1990 . A numerical implementation of "quantum annealing". In Stochastic Processes , Physics and Geometry: Proceedings of the Ascona-Locarno Conference. 97--111 . Bruno Apolloni, Nicolò Cesa-Bianchi, and Diego De Falco. 1990. A numerical implementation of "quantum annealing". In Stochastic Processes, Physics and Geometry: Proceedings of the Ascona-Locarno Conference. 97--111.
2. Sanjeev Arora and Boaz Barak . 2009. Computational complexity: a modern approach . Cambrtidge University Press . Sanjeev Arora and Boaz Barak. 2009. Computational complexity: a modern approach. Cambrtidge University Press.
3. Jun Cai , William G Macready , and Aidan Roy . 2014. A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741 ( 2014 ). Jun Cai, William G Macready, and Aidan Roy. 2014. A practical heuristic for finding graph minors. arXiv preprint arXiv:1406.2741 (2014).
4. Nicholas Chancellor , Stefan Zohren , Paul A Warburton , Simon C Benjamin , and Stephen Roberts . 2016. A direct mapping of Max k-SAT and high order parity checks to a chimera graph. Scientific reports 6, 1 ( 2016 ), 37107. Nicholas Chancellor, Stefan Zohren, Paul A Warburton, Simon C Benjamin, and Stephen Roberts. 2016. A direct mapping of Max k-SAT and high order parity checks to a chimera graph. Scientific reports 6, 1 (2016), 37107.
5. Minor-embedding in adiabatic quantum computation: I. The parameter setting problem