Improving solutions by embedding larger subproblems in a D-Wave quantum annealer

Scientific Reports

Volumn 9, Issue 1, 2019, Pages

  Okada, Shuntaro ^a,b   Ohzeki, Masayuki ^b,c   Terabe, Masayoshi ^a   Taguchi, Shinichiro ^a  

^a DENSO CORPORATION   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; EMBEDDING;

EID: 85061592573     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/s41598-018-38388-4     Document Type: Article

References (35)

1. Lucas, A. Ising formulations of many np problems. Front. Phys. 2, 5, 10.3389/fphy.2014.00005 (2014).
2. Karkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science 220, 671–680, 10.1126/science.220.4598.671 (1983).
3. Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse ising model. Phys. Rev. E 58, 5355–5363, 10.1103/PhysRevE.58.5355 (1998).
4. Santoro, G. E., Martoňák, R., Tosatti, E. & Car, R. Theory of quantum annealing of an ising spin glass. Science 295, 2427–2430, 10.1126/science.1068774 (2002).
5. Martoňák, R., Santoro, G. E. & Tosatti, E. Quantum annealing of traveling-salesman problem. Phys. Rev. E 70, 057701, 10.1103/PhysRevE.70.057701 (2004).
6. Denchev, V. S. et al. What is the computational value of finite range tunneling? Phys. Rev. X 6, 031015, 10.1103/PhysRevX.6.031015 (2016).
7. Battaglia, D. A., Santoro, G. E. & Tosatti, E. Optimization by quantum annealing: Lessons from hard satisfiability problems. Phys. Rev. E 71, 066707, 10.1103/PhysRevE.71.066707 (2005).
8. Johnson, M. W. et al. Quantum annealing with manufactured spins. Nature 473, 194–198, 10.1038/nature10012 (2011).
9. Rønnow, T. F. et al. Defining and detecting quantum speedup. science 345, 420–424, 10.1126/science.1252319 (2014).
10. Boyda, E. et al. Deploying a quantum annealing processor to detect tree cover in aerial imagery of california. PLoS One 12(2), e0172505, 10.1371/journal.pone.0172505 (2017).
11. Neukart, F. et al. Traffic flow optimization using a quantum annealer. Frontiers in ICT 4, 29, 10.3389/fict.2017.00029 (2017).
12. O’Malley, D., Vesselinov, V. V., Alexandrov, B. S. & Alexandrov, L. B. Nonnegative/binary matrix factorization with a d-wave quantum annealer. Preprint at https://arxiv.org/abs/1704.01605 (2017).
13. Morita, S. & Nishimori, H. Mathematical foundation of quantum annealing. Journal of Mathematical Physics 49, 125210, 10.1063/1.2995837 (2008).
14. Bunyk, P. I. et al. Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Transactions in Applied Superconductivity 24, 1700110, 10.1109/TASC.2014.2318294 (2014).
15. Robertson, N. & Seymour, P. D. Graph minors.xiii. the disjoint paths problem. Journal of Combinatorial Theory, Series B 63, 65–110, 10.1006/jctb.1995.1006 (1995).
16. Cai, J., Macready, B. & Roy, A. A practical heuristic for finding graph minors. Preprint at https://arxiv.org/abs/1406.2741 (2014).
17. Klymko, C., Sullivan, B. D. & Humble, T. S. Adiabatic quantum programming: Minor embedding with hard faults. Quantum Inf Process 13, 709, 10.1007/s11128-013-0683-9 (2014).
18. Boothby, T., King, A. D. & Roy, A. Fast clique minor generation in chimera qubit connectivity graphs. Quantum Inf Process 15, 495, 10.1007/s11128-015-1150-6 (2016).
19. Booth, M., Reinhardt, S. P. & Roy, A. Partitioning optimization problems for hybrid classcal/quantum execution. http://www.dwavesys.com/sites/default/files/partitioning_QUBOs_for_quantum_acceleration-2.pdf (2017).
20. Goodrich, T. D., Sullivan, B. D. & Humble, T. S. Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Inf Process 17, 118, 10.1007/s11128-018-1863-4 (2018).
21. Hamilton, K. E. & Humble, T. S. Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. Quantum Inf Process 16, 94, 10.1007/s11128-016-1513-7 (2017).
22. Zaribafiyan, A., Marchand, D. J. J. & Changiz Rezaei, S. S. Systematic and deterministic graph minor embedding for cartesian products of graphs. Quantum Inf Process 16, 136, 10.1007/s11128-017-1569-z (2017).
23. Harris, R. et al. Phase transitions in a programmable quantum spin glass simulator. Science 361, 162–165, 10.1126/science.aat2025 (2018).
24. King, A. D. et al. Observation of topological phenomena in a programmable lattice of 1,800 qubits. Nature 560, 456–460, 10.1038/s41586-018-0410-x (2018).
25. Wang, J.-S. & Swendsen, R. H. Cluster monte carlo algorithms. Physica A: Statistical Mechanics and its Applications 167, 565–579, 10.1016/0378-4371(90)90275-W (1990).
26. Rosenberg, G. et al. Building an iterative heuristic solver for a quantum annealer. Comput Optim Appl 65, 845, 10.1007/s10589-016-9844-y (2016).
27. Narimani, A., Saeed, S. S., Changiz Rezaei & Zaribafiyan, A. Combinatorial optimization by decomposition on hybrid cpu–non-cpu solver architectures. Preprint at https://arxiv.org/abs/1708.03439 (2017).
28. Chancellor, N. Modernizing quantum annealing using local searches. New Journal of Physics 19, 023024, 10.1088/1367-2630/aa59c4 (2017).
29. Stella, L., Santoro, G. E. & Tosatti, E. Optimization by quantum annealing: Lessons from simple cases. Phys. Rev. B 72, 014303, 10.1103/PhysRevB.72.014303 (2005).
30. Amin, M. H. Searching for quantum speedup in quasistatic quantum annealers. Phys. Rev. A 92, 052323, 10.1103/PhysRevA.92.052323 (2015).
31. Adachi, S. H. & Henderson, M. P. Application of quantum annealing to training of deep neural networks. Preprint at https://arxiv.org/abs/1510.06356 (2015).
32. Benedetti, M., Realpe-Gómez, J., Biswas, R. & Perdomo-Ortiz, A. Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning. Phys. Rev. A 94, 022308, 10.1103/PhysRevA.94.022308 (2016).
33. Benedetti, M., Realpe-Gómez, J., Biswas, R. & Perdomo-Ortiz, A. Quantum-assisted learning of hardware-embedded probabilistic graphical models. Phys. Rev. X 7, 041052, 10.1103/PhysRevX.7.041052 (2017).
34. Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B. & Melko, R. Quantum boltzmann machine. Phys. Rev. X 8, 021050, 10.1103/PhysRevX.8.021050 (2018).
35. Reverse quantum annealing for local refinement of solutions. https://www.dwavesys.com/sites/default/files/14-1018A-A_Reverse_Quantum_Annealing_for_Local_Refinement_of_Solutions.pdf (2017).