@article{draper2006a,
author = {Draper, Tom and Kutin, Samuel and Rains, Eric and Svore, Krysta M. and Svore, Krysta M.},
title = {A Logarithmic-depth Quantum Carry-Lookahead Adder},
year = {2006},
month = {January},
abstract = {We present an efficient addition circuit, borrowing techniques from the classical carry look-ahead arithmetic circuit. Our quantum carry-lookahead (qcla) adder accepts two n-bit numbers and adds them in O(log n) depth using O(n) ancillary qubits. We present both in-place and out-of-place versions, as well as versions that add modulo 2n and modulo 2n − 1. Previously, the linear-depth ripple-carry addition circuit has been the method of choice. Our work reduces the cost of addition dramatically with only a slight increase in the number of required qubits. The qcla adder can be used within current modular multiplication circuits to reduce substantially the run-time of Shor’s algorithm.},
publisher = {Rinton Press},
url = {http://approjects.co.za/?big=en-us/research/publication/a-logarithmic-depth-quantum-carry-lookahead-adder/},
pages = {351-369},
journal = {Quantum Information and Computation},
note = { LANL ArXiv: quant-ph/0406142.},
}