Quantum switching and quantum merge sorting

Sheng Tzong Cheng, Chun Yen Wang

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

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
Volume53
Issue number2
DOIs
Publication statusPublished - 2006 Dec 1

Fingerprint

Sorting
Quantum computers
Subroutines
Time delay

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{e5f3e3c70eba40d882aec34be75fccff,
title = "Quantum switching and quantum merge sorting",
abstract = "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.",
author = "Cheng, {Sheng Tzong} and Wang, {Chun Yen}",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/TCSI.2005.856669",
language = "English",
volume = "53",
pages = "316--325",
journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",
issn = "1057-7122",
number = "2",

}

Quantum switching and quantum merge sorting. / Cheng, Sheng Tzong; Wang, Chun Yen.

In: IEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 53, No. 2, 01.12.2006, p. 316-325.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Quantum switching and quantum merge sorting

AU - Cheng, Sheng Tzong

AU - Wang, Chun Yen

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33748713930&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748713930&partnerID=8YFLogxK

U2 - 10.1109/TCSI.2005.856669

DO - 10.1109/TCSI.2005.856669

M3 - Article

AN - SCOPUS:33748713930

VL - 53

SP - 316

EP - 325

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1057-7122

IS - 2

ER -