Quantum Computing: Implementing Hitting Time for Coined Quantum Walks on Regular Graphs
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantu...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2021
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-444818 |