Using Quantum Switches to Mitigate Noise in Grover's Search Algorithm
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916729960005632 |
|---|---|
| author | Srivastava, Suryansh Pati, Arun K. Bhattacharya, Samyadeb Chakrabarty, Indranil |
| author_facet | Srivastava, Suryansh Pati, Arun K. Bhattacharya, Samyadeb Chakrabarty, Indranil |
| contents | Grover's quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a resource to mitigate the effects of noise. In this scenario, the noise is modeled by a depolarizing channel, which coherently acts on the entire quantum register. We show that a quantum switch can significantly reduce the error in Grover's search algorithm. We consider the success probability of finding the marked item as the sole quantifier of diminishing the effect of noise in the search space in the presence of quantum switch. We propose two frameworks for the application of quantum switches. In the first framework, we apply the superposition of channel's orders in the form of a switch and do a post-selection at every iteration of the applications of the Grover operator. In the second framework, we delay this measurement and post-selection until the very end. The number of post selections is minimal in the second scenario, and hence the noise reduction can be attributed more to the presence of quantum switch. We illustrate with an example of significant advantage in the success probability of Grover's algorithm using quantum switch. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_05866 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Using Quantum Switches to Mitigate Noise in Grover's Search Algorithm Srivastava, Suryansh Pati, Arun K. Bhattacharya, Samyadeb Chakrabarty, Indranil Quantum Physics Grover's quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a resource to mitigate the effects of noise. In this scenario, the noise is modeled by a depolarizing channel, which coherently acts on the entire quantum register. We show that a quantum switch can significantly reduce the error in Grover's search algorithm. We consider the success probability of finding the marked item as the sole quantifier of diminishing the effect of noise in the search space in the presence of quantum switch. We propose two frameworks for the application of quantum switches. In the first framework, we apply the superposition of channel's orders in the form of a switch and do a post-selection at every iteration of the applications of the Grover operator. In the second framework, we delay this measurement and post-selection until the very end. The number of post selections is minimal in the second scenario, and hence the noise reduction can be attributed more to the presence of quantum switch. We illustrate with an example of significant advantage in the success probability of Grover's algorithm using quantum switch. |
| title | Using Quantum Switches to Mitigate Noise in Grover's Search Algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2401.05866 |