Title of article
Quantum Switching Based on the Nearest Neighbor Hamiltonian
Author/Authors
Min, JIANG Soochow University - School of Electronics Information Engineering, China , Xu, HUANG Soochow University - School of Electronics Information Engineering, China , Yiming, ZHOU China Academy of Space Technology, China
From page
100
To page
105
Abstract
This paper describes a quantum switching architecture for nearest neighbor coupling. An efficient quantum shear sorting (QSS) algorithm is used to reduce the number of time steps. For the QSS algorithm, the running complexity of the quantum switching architecture is polynomial in time with the nearest neighbor coupling and the implementation is less complex. The result shows that improved switching is extremely simple to implement using existing quantum computer candidates.
Keywords
quantum information , quantum switching , quantum sorting , circuit
Journal title
Tsinghua Science and Technology
Journal title
Tsinghua Science and Technology
Record number
2535357
Link To Document