License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2017.7
URN: urn:nbn:de:0030-drops-85841
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8584/
Go to the corresponding LIPIcs Volume Portal

Parent, Alex ; Roetteler, Martin ; Mosca, Michele

Improved reversible and quantum circuits for Karatsuba-based integer multiplication

pdf-format:
LIPIcs-TQC-2017-7.pdf (0.8 MB)

Abstract

Integer arithmetic is the underpinning of many quantum algorithms, with applications ranging from Shor's algorithm over HHL for matrix inversion to Hamiltonian simulation algorithms. A basic objective is to keep the required resources to implement arithmetic as low as possible. This applies in particular to the number of qubits required in the implementation as for the foreseeable future this number is expected to be small. We present a reversible circuit for integer multiplication that is inspired by Karatsuba's recursive method. The main improvement over circuits that have been previously reported in the literature is an asymptotic reduction of the amount of space required from O(n^1.585) to O(n^1.427). This improvement is obtained in exchange for a small constant increase in the number of operations by a factor less than 2 and a small asymptotic increase in depth for the parallel version. The asymptotic improvement are obtained from analyzing pebble games on complete ternary trees.

BibTeX - Entry

@InProceedings{parent_et_al:LIPIcs:2018:8584,
  author =	{Alex Parent and Martin Roetteler and Michele Mosca},
  title =	{{Improved reversible and quantum circuits for Karatsuba-based integer multiplication}},
  booktitle =	{12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)},
  pages =	{7:1--7:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-034-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{73},
  editor =	{Mark M. Wilde},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8584},
  URN =		{urn:nbn:de:0030-drops-85841},
  doi =		{10.4230/LIPIcs.TQC.2017.7},
  annote =	{Keywords: Quantum algorithms, reversible circuits, quantum circuits, integer multiplication, pebble games, Karatsuba's method}
}

Keywords: Quantum algorithms, reversible circuits, quantum circuits, integer multiplication, pebble games, Karatsuba's method
Collection: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)
Issue Date: 2018
Date of publication: 14.03.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI