View Proposal

---

Proposer

Kai Lin Ong

Title

Designing Efficient Search Algorithms Using Quantum Walks

Goal

Design, implementation and performance analysis of QW Search Algorithms

Description

This project aims to investigate the applications of quantum walks in the design of search algorithms on graphs, supported by numerical simulations using Qiskit, Python, or other suitable programming tools. The project may consider the following aspects: • Investigate how different graph structures and quantum-walk parameters affect the performance of the search algorithms. • Perform an error analysis of quantum-walk-based search algorithms and investigate the effects of different types of noise. • Compare the performance of quantum-walk search algorithms when searching for single and multiple target vertices. • Compare quantum-walk-based search algorithms with their classical counterparts in terms of search probability, computational complexity, and number of steps.

Resources

Portugal, R. (2013). Quantum walks and search algorithms. Springer. https://doi.org/10.1007/978-1-4614-6336-8 Tiong, Y.Q., Ong, K.L. & Tan, I.K.T. Discrete-time quantum walk search on the cycle graph with weighted self-loop. Quantum Inf Process 24, 324 (2025). https://doi.org/10.1007/s11128-025-04945-w Qiskit textbook: Quantum-walk search algorithm https://qiskit.org/textbook/ch-algorithms/quantum-walk-search-algorithm.html

Background

Url

Difficulty Level

Variable

Ethical Approval

None

Number Of Students

1

Supervisor

Kai Lin Ong

Keywords

quantum computing, qiskit, search algorithms

Degrees