Case-Based Reasoning (CBR) is an artificial intelligence approach to problem-solving with a good record of success. This article proposes using Quantum Computing to improve some of the key processes of CBR, such that a Quantum Case-Based Reasoning (qCBR) paradigm can be defined. The focus is set on designing and implementing a qCBR based on the variational principle that improves its classical counterpart in terms of average accuracy, scalability and tolerance to overlapping. A comparative study of the proposed qCBR with a classic CBR is performed for the case of the Social Workers' Problem as a sample of a combinatorial optimization problem with overlapping. The algorithm's quantum feasibility is modelled with docplex and tested on IBMQ computers, and experimented on the Qibo framework.
翻译:以个案为依据的理由(CBR)是解决问题的一种人工智能方法,有良好的成功记录。本条提议使用量子计算法改进CBR的某些关键过程,以便界定量子原因(qCBR)范式,重点是根据在平均准确性、可伸缩性和对重叠的容忍度方面改进传统对应方的变式原则,设计和实施qCBR。对拟议的qCBR和典型的CBR进行了比较研究,作为重叠的组合优化问题的样本,对“社会工作者问题”进行了比较研究。算法的量性可行性以多式模型为模型,在IBMQ计算机上测试,并在Qibo框架上进行试验。