Implementation of Continuous-Time Quantum Walks on Quantum Computers
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912343539056640 |
|---|---|
| author | Portugal, Renato Moqadam, Jalil Khatibi |
| author_facet | Portugal, Renato Moqadam, Jalil Khatibi |
| contents | Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are interesting candidates to be implemented on quantum computers. In this work, we describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes: complete graphs, complete bipartite graphs, and hypercubes. For the class of complete and complete bipartite graphs, the circuits implement the evolution operator exactly. For the class of hypercubes, the circuit implements an approximate evolution operator, which tends to the exact evolution operator when the number of vertices is large. Our Qiskit simulations show that the implementation is successful at finding the marked vertex even for low-dimensional hypercubes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_08889 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Implementation of Continuous-Time Quantum Walks on Quantum Computers Portugal, Renato Moqadam, Jalil Khatibi Quantum Physics Quantum walk is a useful model to simulate complex quantum systems and to build quantum algorithms; in particular, to develop spatial search algorithms on graphs, which aim to find a marked vertex as quickly as possible. Quantum walks are interesting candidates to be implemented on quantum computers. In this work, we describe efficient circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms on three graph classes: complete graphs, complete bipartite graphs, and hypercubes. For the class of complete and complete bipartite graphs, the circuits implement the evolution operator exactly. For the class of hypercubes, the circuit implements an approximate evolution operator, which tends to the exact evolution operator when the number of vertices is large. Our Qiskit simulations show that the implementation is successful at finding the marked vertex even for low-dimensional hypercubes. |
| title | Implementation of Continuous-Time Quantum Walks on Quantum Computers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2212.08889 |