Abstract
Studies have demonstrated that a joined complete graph is a typical mathematical model that can support a fast quantum search. In this paper, we study the implementation of joined complete graphs in atomic systems and realize a quantum search of runtime O(N) based on this implementation with a success probability of 50%. Even though the practical systems inevitably interact with the surrounding environment, we reveal that a successful quantum search can be realized through delicately engineering the environment itself. We consider that our study will bring about a feasible way to realize quantum information processing including quantum algorithms in reality.
Original language | English |
---|---|
Article number | 045101 |
Journal | Communications in Theoretical Physics |
Volume | 74 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1 Apr 2022 |
Keywords
- environmental engineering
- non-Markovian
- quantum search algorithm
- quantum walk