Grover's algorithm on two-way quantum computer
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913555671941120 |
|---|---|
| author | Czelusta, Grzegorz Verma, Dev Rishi Wanjalkar, Govind |
| author_facet | Czelusta, Grzegorz Verma, Dev Rishi Wanjalkar, Govind |
| contents | Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09450 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Grover's algorithm on two-way quantum computer Czelusta, Grzegorz Verma, Dev Rishi Wanjalkar, Govind General Physics Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm. |
| title | Grover's algorithm on two-way quantum computer |
| topic | General Physics |
| url | https://arxiv.org/abs/2406.09450 |