Rieffel, E.G., Venturelli, D., O’Gorman, B., Do, M.B., Prystay, E. and Smelyanskiy, V.N. (2014) A Case Study in Programming a Quantum Annealer for Hard Operational Planning Problems. Quantum Information Processing, 14, 1-36.
https://doi.org/10.1007/s11128-014-0892-x

has been cited by the following article:

• TITLE: Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary Optimization Form and Solve It on a Quantum Computer

  AUTHORS: Atchade Parfait Adelomou, Elisabet Golobardes Ribé, Xavier Vilasis Cardona

  KEYWORDS: QUBO, Quantum Algorithms, Variational Quantum Eigensolvers, Combinatorial Optimization Algorithms

  JOURNAL NAME: Journal of Computer and Communications, Vol.8 No.11, November 12, 2020

  ABSTRACT: The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard. These problems require heuristic techniques to provide an efficient solution in the best of cases. In this article, in addition to providing a detailed resolution of the social workers’ problem using the Quadratic Unconstrained Binary Optimization Problems (QUBO) formulation, an approach to mapping the inequality constraints in the QUBO form is given. Finally, we map it in the Hamiltonian of the Ising model to solve it with the Quantum Exact Solver and Variational Quantum Eigensolvers (VQE). The quantum feasibility of the algorithm will be tested on IBMQ computers.