Fast embedding of constrained satisfaction problem to quantum annealer with minimizing chain length

Recent research has demonstrated promising results in solving constrained satisfaction problem (CSP) using D-Wave quantum annealer. However, the embedding of the CSP suffers drawbacks such as long embedding time in addition to poor quality due to long chains that reduce the ground state probability. To address those issues, we propose an effective embedding technique that reduces the embedding time and minimizes the chain length. We compared to the most recent method published in DAC 2016. Experiments using existing D-Wave 2× quantum annealer show that the proposed embedding technique increases the ground state probability by 29% on average. Furthermore, to demonstrate the efficiency, we embedded large problems onto a predicted C100 D-Wave Chimera architecture. Experimental results show that our approach reduces the run-time by 3.4× on average with reduced longest chain length.

[1]  Kenneth B. Kent,et al.  VPR 5.0: FPGA CAD and architecture exploration tools with single-driver routing, heterogeneity and process scaling , 2011, TRETS.

[2]  Dimitrios M. Thilikos,et al.  Faster parameterized algorithms for minor containment , 2010, Theor. Comput. Sci..

[3]  Aidan Roy,et al.  Discrete optimization using quantum annealing on sparse Ising models , 2014, Front. Phys..

[4]  S. Knysh,et al.  Quantum Optimization of Fully-Connected Spin Glasses , 2014, 1406.7553.

[5]  G. Rose,et al.  Finding low-energy conformations of lattice protein models by quantum annealing , 2012, Scientific Reports.

[6]  Lei He,et al.  A quantum annealing approach for Boolean Satisfiability problem , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[7]  Carl Ebeling,et al.  PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[8]  Vicky Choi,et al.  Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..

[9]  Aidan Roy,et al.  Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis , 2016, Front. ICT.

[10]  Aidan Roy,et al.  A practical heuristic for finding graph minors , 2014, ArXiv.

[11]  M. W. Johnson,et al.  A scalable readout system for a superconducting adiabatic quantum optimization system , 2009, 0905.0891.

[12]  Steven H. Adachi,et al.  Application of Quantum Annealing to Training of Deep Neural Networks , 2015, ArXiv.

[13]  M. W. Johnson,et al.  Thermally assisted quantum annealing of a 16-qubit problem , 2013, Nature Communications.

[14]  Kesheng Wu,et al.  Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer , 2015, IEEE Journal of Selected Topics in Signal Processing.