{"title":"Quantum Switching Networks with Classical Routing","authors":"R. Ratan, M. K. Shukla, A. Oruç","doi":"10.1109/CISS.2007.4298416","DOIUrl":null,"url":null,"abstract":"Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Since qubits cannot be copied, this operation of moving qubits can be relatively costly in terms of resources. Moreover, implementation of quantum gates requires precise and extensive classical control and computation too. Accordingly, we consider the problem of dynamically permuting groups of qubits, i.e., qubit packets using reconfigurable quantum switches in which routing information is calculated classically as a possible way to reduce this cost. We design a 2 x 2 switch based on the controlled-swap quantum gate and show that if switch settings are determined using efficient classical algorithms, then quantum switches can be mapped onto classical non-blocking interconnection switch topologies with low cost by using this switch. Specific quantum switch designs for the optimal Benes network and the planar Spanke-Bcnes network are given.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
Flexible distribution of data in the form of quantum bits (qubits) amongst spatially separated entities is an essential component of envisioned scalable quantum computing architectures. Since qubits cannot be copied, this operation of moving qubits can be relatively costly in terms of resources. Moreover, implementation of quantum gates requires precise and extensive classical control and computation too. Accordingly, we consider the problem of dynamically permuting groups of qubits, i.e., qubit packets using reconfigurable quantum switches in which routing information is calculated classically as a possible way to reduce this cost. We design a 2 x 2 switch based on the controlled-swap quantum gate and show that if switch settings are determined using efficient classical algorithms, then quantum switches can be mapped onto classical non-blocking interconnection switch topologies with low cost by using this switch. Specific quantum switch designs for the optimal Benes network and the planar Spanke-Bcnes network are given.
在空间分离的实体之间以量子比特(量子位)的形式灵活分布数据是可扩展量子计算架构的重要组成部分。由于量子比特不能被复制,这种移动量子比特的操作在资源方面可能相对昂贵。此外,量子门的实现也需要精确而广泛的经典控制和计算。因此,我们考虑动态排列量子位组的问题,即使用可重构量子交换机的量子位包,其中路由信息是经典计算的,作为降低该成本的可能方法。我们设计了一个基于控制交换量子门的2 x 2开关,并证明如果使用有效的经典算法确定开关设置,那么量子开关可以通过使用该开关以低成本映射到经典的无阻塞互连开关拓扑上。给出了最优Benes网络和平面Spanke-Bcnes网络的具体量子开关设计。