Quantum-walk search in motion
Abstract In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph.However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify the marked nodes as well as identify the correct chronological ordering between the marked nodes, fleshl