Noise-tolerant Grover's algorithm via success-probability prediction
Physical Review Research · 21.01.2025 · 7 (1)
DOI: 10.1103/physrevresearch.7.l012017 ↗Kurz gefasst
Fachartikel in der Zeitschrift Physical Review Research, online erschienen am 21.01.2025. Verfasst von Jian Leng und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Innovation Program for Quantum Science and Technology.
Abstract (Originalsprache)
We present theoretical and experimental studies on efficient quantum search with noise. We propose a noise-tolerant method that significantly reduces the running time and exponentially improves the error threshold with number of qubits for Grover's search. Experiments are implemented on different quantum computing setups, with all results clearly confirming the advantage of our noise-tolerant method to the original Grover's search. In one setup, our method produces quantum advantages while the original Grover's search does not. In another setup with smaller noise, our method produces a larger quantum advantage than the original Grover's search does.
Förderung
- National Natural Science Foundation of China
- Innovation Program for Quantum Science and Technology
Zitieren
APA
Leng, J., Yang, F., & Wang, X. (2025). Noise-tolerant Grover's algorithm via success-probability prediction. Physical Review Research, 7(1). https://doi.org/10.1103/physrevresearch.7.l012017
Vancouver
Leng J, Yang F, Wang X. Noise-tolerant Grover's algorithm via success-probability prediction. Physical Review Research. 2025;7(1). doi:10.1103/physrevresearch.7.l012017
BibTeX
@article{Leng2025,
author = {Leng, Jian and Yang, Fan and Wang, Xiang-Bin},
title = {Noise-tolerant Grover's algorithm via success-probability prediction},
journal = {Physical Review Research},
year = {2025},
volume = {7},
number = {1},
doi = {10.1103/physrevresearch.7.l012017}
}
EUVIMED