Improving Quantum Search on Simple Graphs by <i>Pretty Good</i> Structured Oracles

• Main Authors: Matteo G. A. Paris, Claudia Benedetti, Stefano Olivares
• Format: Article
• Language: English
• Published: MDPI AG 2021-01-01
• Series: Symmetry
• Subjects: quantum search algorithm; quantum walks
• Online Access: https://www.mdpi.com/2073-8994/13/1/96

Quantum search algorithms provide a way to speed up combinatorial search, and have found several applications in modern quantum technology. In particular, spatial search on graphs, based on continuous-time quantum walks (CTQW), represents a promising platform for the implementation of quantum search in condensed matter systems. CTQW-based algorithms, however, work exactly on complete graphs, while they are known to perform poorly on realistic graphs with low connectivity. In this paper, we put forward an alternative search algorithm, based on structuring the oracle operator, which allows one to improve the localization properties of the walker by tuning only the on-site energies of the graph, i.e., without altering its topology. As such, the proposed algorithm is suitable for implementation in systems with low connectivity, e.g., rings of quantum dots or superconducting circuits. Oracle parameters are determined by Hamiltonian constraints, without the need for numerical optimization.