Constant-factor optimization of quantum adders on 2D quantum architectures

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quantum arithmetic circuits have practical applications in various quantum algorithms. In this paper, we address quantum addition on 2-dimensional nearest-neighbor architectures based on the work presented by Choi and Van Meter (JETC 2012). To this end, we propose new circuit structures for some basic blocks in the adder, and reduce communication overhead by adding concurrency to consecutive blocks and also by parallel execution of expensive Toffoli gates. The proposed optimizations reduce total depth from to for constants k 1,k 2 and affect the computation fidelity considerably. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Saeedi, M., Shafaei, A., & Pedram, M. (2013). Constant-factor optimization of quantum adders on 2D quantum architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7948 LNCS, pp. 58–69). Springer Verlag. https://doi.org/10.1007/978-3-642-38986-3_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free