Quantum switching limited by nearest-neighboring coupling

In this paper, we propose a quantum switching architecture under the nearest coupling limitation. In order to reduce implementation time steps, an efficient quantum shear sorting (QSS) algorithm is developed. With use of QSS algorithm, the running complexity of the improved quantum switching architecture is polynomial time even under nearest coupling interaction and the implementation complexity is better. Our improved switching is extremely simple to implement by existing quantum computer candidates.