首页> 外文期刊>Journal of systems architecture >Quantum ternary parallel adder/subtractor with partially-look-ahead carry
【24h】

Quantum ternary parallel adder/subtractor with partially-look-ahead carry

机译:具有部分超前进位的量子三进制并行加法器/减法器

获取原文
获取原文并翻译 | 示例
           

摘要

Multiple-valued quantum circuits are a promising choice for future quantum computing technology since they have several advantages over binary quantum circuits. Binary parallel adder/subtractor is central to the ALU of a classical computer and its quantum counterpart is used in oracles - the most important part that is designed for quantum algorithms. Many NP-hard problems can be solved more efficiently in quantum using Grover algorithm and its modifications when an appropriate oracle is constructed. There is therefore a need to design standard logic blocks to be used in oracles - this is similar to designing standard building blocks for classical computers. In this paper, we propose quantum realization of a ternary full-adder using macro-level ternary Feynman and Toffoli gates built on the top of ion-trap realizable ternary 1-qutrit and Muthukrishnan-Stroud gates. Our realization has several advantages over the previously reported realization. Based on this realization of ternary full-adder we propose realization of a ternary parallel adder with partially-look-ahead carry. We also show the method of using the same circuit as a ternary parallel adder/subtractor. (c) 2007 Elsevier B.V. All rights reserved.
机译:多值量子电路是未来量子计算技术的一个有前途的选择,因为它们比二进制量子电路具有多个优势。二进制并行加法器/减法器是经典计算机的ALU的核心,它的量子对等物用于oracle中-这是为量子算法设计的最重要部分。当构造适当的预言机时,使用Grover算法及其修改方法可以在量子中更有效地解决许多NP难题。因此,需要设计要在Oracle中使用的标准逻辑块-这类似于为经典计算机设计标准构建块。在本文中,我们提出了利用在离子阱可实现的三元1-qutrit和Muthukrishnan-Stroud门的顶部建立的宏观三元Feynman和Toffoli门实现三元全加器的量子实现。与先前报告的实现相比,我们的实现具有多个优点。基于三元全加法器的这种实现,我们提出了具有部分超前进位进位的三元并行加法器的实现。我们还展示了使用与三进制并行加法器/减法器相同的电路的方法。 (c)2007 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号