期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary Optimization Form and Solve It on a Quantum Computer
1
作者 Atchade Parfait Adelomou Elisabet Golobardes Ribé xavier vilasis cardona 《Journal of Computer and Communications》 2020年第11期44-68,共25页
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 pro... 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. 展开更多
关键词 QUBO Quantum Algorithms Variational Quantum Eigensolvers Combinatorial Optimization Algorithms
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部