Quantum computing offers an accelerated mechanism for solving combinatorial optimization problems that could be hardly solvable with classical tools, in this context, this paper highlights the utility of quantum computing in solving NP-complete problems efficiently and shows up the importance of employing quantum algorithms achieving parallel calculation in the purpose of reducing the algorithmic complexity and simplifying the development of optimization applications. Within this publication, an optimized version of quantum circuit conception for developing the oracle of the Grover's search algorithm is introduced for solving the vertex cover problem, and it was also tested using the Qiskit library and applied to a set of instances to evaluate its performance.
Abstract Quantum computing is a new mode that follows the laws of quantum mechanics. It performs computational tasks based on the control of quantum units. From the view of computable problems, quantum computers can only solve the problems that traditional computers can solve, but considering the efficiency of computation, due to the existence of quantum superposition, some known quantum algorithms are exponentially faster than traditional general-purpose computers. In this article, we combine quantum computing with a classical neural network to design a quantum Hopfield network. Each neuron is initialized to a specified state and evolved into a steady state. The output result is one of patterns in a training set. We also present an application of this protocol in image recognition. The simulation results show that this network works in the quantum environment and the output images are correct, therefore the feasibility of this protocol is verified.
We propose a novel heuristic quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs). In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes, enabling the identification of highly influential vertices through their transition probabilities. To enhance stability and solution quality, we introduce a dynamic decoupling (``freezing'') mechanism that isolates vertices already selected for the cover, preventing their interference in subsequent iterations of the algorithm. The method employs a compact binary encoding, requiring only
⌈log2(V)⌉ qubits to represent a graph with
V vertices, resulting in an exponential reduction of quantum resources compared to conventional vertex-based encodings. We benchmark the proposed heuristic against exact solutions obtained via Mixed-Integer Linear Programming (MILP) and against established classical heuristics, including Simulated Annealing, FastVC, and the 2-Approximation algorithm, across Erdős--Rényi, Barabási--Albert and regular random graph ensembles. Our results demonstrate that the CTQW-based heuristic consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology, outperforming classical approaches in both heterogeneous and homogeneous structures. These findings indicate that continuous-time quantum walks, when combined with topology-independent decoupling strategies, provide a powerful paradigm for large-scale combinatorial optimization and complex network control, with potential applications spanning infrastructure resilience, epidemic containment, sensor network optimization, and biological systems analysis.
A promising combination of artificial intelligence and quantum computing, quantum neural networks (QNNs) have the potential to completely transform the way neural networks interpret and learn from data. QNNs can outperform classical neural networks in terms of speed, efficiency, and scalability by utilizing the special qualities of quantum physics, such as superposition, entanglement, and quantum parallelism. The basic ideas of QNNs, their structures, and the ways in which quantum algorithms can be incorporated into machine learning processes to improve problem-solving skills are all examined in this study. current developments in QNNs, emphasizing how they can be used for challenging applications including pattern recognition, optimization, and high-dimensional data space decision-making. We also go over the difficulties in creating scalable QNN models and the possible future applications of QNNs in artificial intelligence. By utilizing the potential of quantum computing, QNNs have the potential to advance artificial intelligence by providing answers to issues that are now intractable through traditional methods.
This chapter gives a brief description of subject foundations of chain architecture optimization and quantum computing. Through this chapter, the authors intend to discover and know the basic principles of quantum computing that are related to supply chain management. They explore the potentials of quantum algorithms in empowering and solving distribution and logistics optimization problems. The field of study covers a basic understanding of quantum computing excelling in supply chain activities, which also includes important topics such as superposition, entanglement, and quantum gates. The major point presented is that traditional optimization methods fail when applied to the large supply chain structures via their abilities to analyse all the variables as efficiently as they can. This chapter explores methods to improve techniques for making supply chains decisions and extends overall effectiveness and efficiency through use of methods based on quantum computers.