Noise-tolerant Grover's algorithm via success-probability prediction
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 differe...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-01-01
|
| Series: | Physical Review Research |
| Online Access: | http://doi.org/10.1103/PhysRevResearch.7.L012017 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832592153055854592 |
|---|---|
| author | Jian Leng Fan Yang Xiang-Bin Wang |
| author_facet | Jian Leng Fan Yang Xiang-Bin Wang |
| author_sort | Jian Leng |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-740d1e54f04341efb6a6a43377d50a59 |
| institution | Kabale University |
| issn | 2643-1564 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | American Physical Society |
| record_format | Article |
| series | Physical Review Research |
| spelling | doaj-art-740d1e54f04341efb6a6a43377d50a592025-01-21T15:01:32ZengAmerican Physical SocietyPhysical Review Research2643-15642025-01-0171L01201710.1103/PhysRevResearch.7.L012017Noise-tolerant Grover's algorithm via success-probability predictionJian LengFan YangXiang-Bin WangWe 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.http://doi.org/10.1103/PhysRevResearch.7.L012017 |
| spellingShingle | Jian Leng Fan Yang Xiang-Bin Wang Noise-tolerant Grover's algorithm via success-probability prediction Physical Review Research |
| title | Noise-tolerant Grover's algorithm via success-probability prediction |
| title_full | Noise-tolerant Grover's algorithm via success-probability prediction |
| title_fullStr | Noise-tolerant Grover's algorithm via success-probability prediction |
| title_full_unstemmed | Noise-tolerant Grover's algorithm via success-probability prediction |
| title_short | Noise-tolerant Grover's algorithm via success-probability prediction |
| title_sort | noise tolerant grover s algorithm via success probability prediction |
| url | http://doi.org/10.1103/PhysRevResearch.7.L012017 |
| work_keys_str_mv | AT jianleng noisetolerantgroversalgorithmviasuccessprobabilityprediction AT fanyang noisetolerantgroversalgorithmviasuccessprobabilityprediction AT xiangbinwang noisetolerantgroversalgorithmviasuccessprobabilityprediction |