A logarithmic-depth quantum carry-lookahead adder

  • Authors:
  • Thomas G. Draper;Samuel A. Kutin;Eric M. Rains;Krysta M. Svore

  • Affiliations:
  • Department of Mathematics, University of Maryland, College Park, MD;Center for Communications Reseach, Princeton, NJ;Department of Mathematics, University of California, Davis, CA;Department of Computer Science, Columbia University, New York, NY

  • Venue:
  • Quantum Information & Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an efficient addition circuit, borrowing techniques from classical carry-lookahead arithmetic. Our quantum carry-lookahead (QCLA) adder accepts two n-bitnumbers and adds them in O(log n) depth using O(n) ancillary qubits. We present bothin-place and out-of-place versions, as well as versions that add modulo 2n and modulo2n - 1. Previously, the linear-depth ripple-carry addition circuit has been the methodof choice. Our work reduces the cost of addition dramatically with only a slight increasein the number of required qubits. The QCLA adder can be used within current modularmultiplication circuits to reduce substantially the run-time of Shor's algorithm.