Enhanced Quantum Search via Partial Diffusion and Entanglement with Linear Optics

Searching for specific items in an unstructured database presents a vital computational problem. While the best-known classical search algorithm in a database of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> has a complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{O}(N)$</tex>, Grover's quantum search algorithm exhibits a complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{O}(\sqrt{N})$</tex>, featuring a quadratic speed-up. In this paper, we present an optical system that implements an enhanced version of the search algorithm proposed by Younis et al. The system uses linear optical components such as beam splitters, phase shifters, and wave plates, along with a single-photon source and photodetectors.

Authors

Institutions

Publication Details

Published
2025-05-06
DOI
https://doi.org/10.1109/nrsc65659.2025.11018556
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhanced Quantum Search via Partial Diffusion and Entanglement with Linear Optics

Ahmed Younes, S. S. A. Obayya, A. R. Abdulghany, Salem F. Hegazy et al.
Quantum Computing Algorithms and Architecture
article

Enhanced Quantum Search via Partial Diffusion and Entanglement with Linear Optics

Ahmed Younes, S. S. A. Obayya, A. R. Abdulghany, Salem F. Hegazy, Ahmed S. El Fiky
article en

Abstract

Searching for specific items in an unstructured database presents a vital computational problem. While the best-known classical search algorithm in a database of size <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$N$</tex> has a complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{O}(N)$</tex>, Grover's quantum search algorithm exhibits a complexity <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{O}(\sqrt{N})$</tex>, featuring a quadratic speed-up. In this paper, we present an optical system that implements an enhanced version of the search algorithm proposed by Younis et al. The system uses linear optical components such as beam splitters, phase shifters, and wave plates, along with a single-photon source and photodetectors.

Cairo University (EG), Zewail City of Science and Technology (EG), Alexandria University (EG)
Openalex Percentile: Top 94%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Enhanced Quantum Search via Partial Diffusion and Entanglement with Linear Optics — Ahmed Younes, S. S. A. Obayya, et al. · (2025) | TGRS Research Map | TGRS