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.
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.
The social worker scheduling problem is a class of combinatorial optimization problems that combines scheduling with routing issues. These types of problems with classical computing can only be solved, in the best of cases, in an approximate way and significantly when the input data does not grow considerably. Today, the focus on the quantum computer should no longer be only on its enormous computing power, but also on the use of its imperfection for this era, (Noisy Intermediate-Scale Quantum (NISQ)) to create a powerful optimization and learning device that uses variational techniques. We had already proposed a formulation and solution of this problem using the capacity of the quantum computer. In this article, we present some broad results of the experimentation techniques. And above all, we propose an adaptive and intelligence solution, which efficiently recalculates the schedules of social workers. Taking into account new restrictions and changes in the initial conditions, by using a case-based reasoning system and the variational quantum eigensolver based on a finite-depth quantum circuit. That encodes the ground state of the Hamiltonian of social workers. The quantum feasibility of the algorithm will be modelled with docplex and tested on IBMQ computers.
Abstract: This research explores the emerging paradigm of Quantum Intelligence (QI), which unifies artificial intelligence and quantum computing to enable next-generation cognitive systems. By leveraging quantum principles such as superposition, entanglement, and quantum tunneling, QI frameworks transcend classical AI limitations in learning efficiency, contextual awareness, and problem-solving complexity. The study implements a hybrid architecture integrating variational quantum circuits with reinforcement learning agents, tested across multi-goal environments. Experimental results reveal faster convergence, greater entropy reduction, and enhanced generalization compared to classical deep Q-networks. These findings demonstrate the transformative potential of QI to replicate and surpass human-like cognition, offering scalable, efficient, and adaptable models for future autonomous reasoning systems. Keywords: Quantum intelligence, Artificial intelligence, Quantum computing, Hybrid AI systems, Reinforcement learning, Variational quantum circuits, Cognitive systems, Quantum-enhanced learning, Entropy optimization, Next-generation AI
Quantum computing, leveraging quantum mechanics, promises to enhance optimization processes in artificial intelligence (AI) by addressing challenges faced by classical computing in solving complex problems. This study investigates the role of quantum computing in optimizing AI tasks, focusing on algorithms such as Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) for improved efficiency in optimization. A hybrid quantum-classical approach was used to evaluate the performance of quantum algorithms in optimization tasks, including combinatorial optimization and machine learning model tuning. QAOA and QA were applied to benchmark problems, such as Max-Cut and Traveling Salesman Problem (TSP). The study involved a comparative analysis between quantum algorithms and classical optimization techniques using performance metrics like solution quality, computational time, and scalability. Data were gathered through simulation on a quantum computing platform, and results were analyzed using statistical methods to assess improvements. The results showed that quantum computing significantly outperformed classical methods in solving large-scale optimization problems. QAOA demonstrated a 30% improvement in solution quality for Max-Cut problems, and QA showed a 25% faster convergence in TSP compared to classical algorithms. Quantum algorithms demonstrated scalability advantages as the problem size increased, with quantum methods achieving up to a 40% reduction in computational time for large instances. Furthermore, 70% of the tested cases showed significant improvements in solution accuracy, confirming the potential of quantum computing in real-world AI applications. Quantum computing, through QAOA and QA, offers substantial improvements in solving complex optimization problems in AI, presenting a transformative opportunity for the future of optimization algorithms.
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.
The rapid advancement of artificial intelligence (AI) and quantum computing has introduced new paradigms for solving computationally complex problems beyond the capabilities of classical systems. This paper presents a Quantum Intelligence Platform (QIP), a hybrid quantum-inspired computational framework designed to enhance intelligent decision prediction and optimization in complex environments. The proposed system integrates quantum probabilistic modelling concepts such as superposition and interference with classical machine learning algorithms to improve prediction accuracy and adaptive decision-making. A hybrid architecture combining quantum circuit simulation and classical deep learning modules is developed to enable scalable experimentation without requiring physical quantum hardware. The platform is evaluated on decision prediction and optimization tasks, demonstrating improvements in convergence stability and predictive performance compared to conventional models. Experimental results show that quantum-inspired state representation enhances feature expressiveness and probabilistic reasoning. The proposed framework bridges the gap between theoretical quantum computation and practical intelligent systems, offering a scalable pathway for future quantum-enhanced AI applications.
Quantum computing has emerged as a transformative technology with the potential to revolutionize artificial intelligence (AI) and machine learning (ML). This paper explores the intersection of quantum computing and AI, focusing on how quantum principles can enhance computational capabilities and address challenges in traditional machine learning approaches. Key aspects discussed include quantum algorithms such as quantum support vector machines, quantum neural networks, and quantum variational algorithms, which leverage quantum superposition and entanglement to process vast amounts of data more efficiently than classical counterparts. These algorithms promise to accelerate tasks such as optimization, pattern recognition, and data classification, thereby advancing the capabilities of AI systems. Moreover, quantum computing offers potential breakthroughs in solving combinatorial optimization problems that are computationally intensive for classical computers. Quantum annealing and other quantum optimization techniques are explored for their application in AI, providing novel approaches to solving complex decision-making problems.