Quantum switching and quantum merge sorting

Sheng Tzong Cheng, Chun Yen Wang

Research output: Contribution to journalArticlepeer-review

50 Citations (Scopus)


This paper proposes a quantum switching architecture that can dynamically permute each input quantum data to its destination port to avoid using the fully connected networks. In addition, in order to reduce the execution time of the quantum switching, an efficient quantum merge sorting (QMS) algorithm that provides a parallel quantum computation is also developed. The quantum switching utilizes the QMS algorithm as a subroutine so that the total running time can be reduced to polylogarithmic time. Furthermore, to evaluate the feasibility of the quantum switching, we also define three different kinds of performance factors that can be used to estimate the complexity in implementation and the time delay in execution for quantum instruments. From the evaluation results, it can be seen that the proposed quantum switching is feasible in practice.

Original languageEnglish
Pages (from-to)316-325
Number of pages10
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Issue number2
Publication statusPublished - 2006

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Hardware and Architecture


Dive into the research topics of 'Quantum switching and quantum merge sorting'. Together they form a unique fingerprint.

Cite this