Bibliography
[Bar1982] | Barahona. “On the Computational Complexity of Ising Spin Glass Models.” J. Phys. A 15 (1982), pp. 3241–3253. |
[Boo2016] | T. Boothby et al. “Fast clique minor generation in Chimera qubit connectivity graphs.” Quantum Information Processing 15.1 (2016), pp. 495–508.
https://arxiv.org/abs/1507.04774 |
[Bun2014] | P. I. Bunyk et al. “Architectural considerations in the design of a superconducting quantum annealing processor.”
IEEE Transactions on Applied Superconductivity 24.4 (Aug. 2014),
pp. 1–10.
https://arxiv.org/abs/1401.5504 |
[Dec1987] | R. Dechter and J. Pearl. “The cycle-cutset method for improving search performance in AI applications.”
Proceedings of the Third IEEE on Artificial Intelligence Applications (1987), pp. 224–230. |
[Dickson2013] | N. G. Dickson et al. “Thermally assisted quantum annealing of a 16-qubit problem.”
Nature communications. 4:1903 (May 21, 2013). |
[DW2016_1] | D-Wave Systems Inc. Postprocessing Methods on D-Wave Systems, 09-1109A (2016). |
[DW2016_2] | D-Wave Systems Inc. Solver Computation Time, 09-1107A (2016). |
[Har2010] | R. Harris et al. “Experimental demonstration of a robust and scalable flux qubit.”
Phys. Rev. B 81 (13 Apr. 2010).
https://arxiv.org/abs/0909.4321 |
[Har2010_2] | R. Harris et al. “Experimental investigation of an eight qubit unit cell in a superconducting optimization processor.”
Phys. Rev. B 82, 024511 (2010) arXiv:1004.1628 |
[Joh2007] | J. K. Johnson, D. M. Malioutov, and A. S. Willsky. “Lagrangian relaxation for MAP estimation in graphical models.”
Proceedings of The 45th Allerton Conference on Communication, Control and Computing (Sept. 2007). |
[Joh2011] | M. W. Johnson et al. “Quantum annealing with manufactured spins.”
Nature 473 (May 12, 2011), pp. 194–198. |
[Kin2014] | A. D. King and C. C. McGeoch. “Algorithm engineering for a quantum annealing platform.”
arXiv preprint arXiv:1410.2628 (2014).
http://arxiv.org/abs/1410.2628 |
[Liu2005] | W. Liu et al. “A hybrid multi-exchange local search for unconstrained binary quadratic program,
University of Mississippi, Hearin Center for Enterprise Science, HCES-09-05, 2005. |
[Mar2007] | R. Marinescu and R. Dechter. “Best-first AND/OR search for 0-1 integer linear programming.”
Proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR) (2007).
http://www.ics.uci.edu/~radum/papers/cpaior07-aobf.pdf. |
[Ros2016] | G. Rosenberg et al. “Building an iterative heuristic solver for a quantum annealer,”
Computational Optimization and Applications, Springer (2016), pp. 1-25.
http://arxiv.org/abs/1507.07605 |
[Roy2016] | A. Roy et al. “Mapping constrained optimization problems to quantum annealing with application to fault diagnosis.”
Frontiers in ICT 3 (2016): p. 14.
http://arxiv.org/abs/1603.03111 |
[Sch2009] | N. N. Schraudolph and D. Kamenetsky. “Effcient exact inference in planar Ising models.”
Advances in Neural Information Processing Systems 21 (2009).
http://users.rsise. anu.edu.au/~dkamen/nips08.pdf. |