Please use this identifier to cite or link to this item:
Title: Quantum circuits for Toom-Cook multiplication
Authors: Dutta, Srijit
Bhattacharjee, Debjyoti
Chattopadhyay, Anupam
Keywords: Quantum Circuits
Toom-Cook Multiplication
DRNTU::Engineering::Computer science and engineering
Issue Date: 2018
Source: Dutta, S., Bhattacharjee, D., & Chattopadhyay, A. (2018). Quantum circuits for Toom-Cook multiplication. Physical Review A, 98(1), 012311-. doi:10.1103/PhysRevA.98.012311
Series/Report no.: Physical Review A
Abstract: In this paper, we report efficient quantum circuits for integer multiplication using the Toom-Cook algorithm. By analyzing the recursive tree structure of the algorithm, we obtained a bound on the count of Toffoli gates and qubits. These bounds are further improved by employing reversible pebble games through uncomputing the intermediate results. The asymptotic bounds for different performance metrics of the proposed quantum circuit are superior to the prior implementations of multiplier circuits using schoolbook and Karatsuba algorithms.
ISSN: 2469-9926
DOI: 10.1103/PhysRevA.98.012311
Rights: © 2018 American Physical Society. This paper was published in Physical Review A and is made available as an electronic reprint (preprint) with permission of American Physical Society. The published version is available at: []. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
Quantum circuits for Toom-Cook multiplication.pdf314.47 kBAdobe PDFThumbnail

Page view(s)

checked on Oct 21, 2020


checked on Oct 21, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.