Quantum Information Processing

, Volume 15, Issue 5, pp 1827–1848

A comparison of approaches for finding minimum identifying codes on graphs

Article

DOI: 10.1007/s11128-016-1240-0

Cite this article as:
Horan, V., Adachi, S. & Bak, S. Quantum Inf Process (2016) 15: 1827. doi:10.1007/s11128-016-1240-0

Abstract

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using MATLAB, an adiabatic quantum optimization approach using a D-Wave quantum annealing processor, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.

Keywords

Graph theory SMT solvers Quantum annealing 

Copyright information

© Springer Science+Business Media New York (outside the USA)  2016

Authors and Affiliations

  1. 1.Air Force Research Laboratory Information DirectorateRomeUSA
  2. 2.Lockheed MartinPalo AltoUSA

Personalised recommendations