Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yasuhiro TAKAHASHI, "Quantum Arithmetic Circuits: A Survey" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 5, pp. 1276-1283, May 2009, doi: 10.1587/transfun.E92.A.1276.
Abstract: Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.1276/_p
Copy
@ARTICLE{e92-a_5_1276,
author={Yasuhiro TAKAHASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Quantum Arithmetic Circuits: A Survey},
year={2009},
volume={E92-A},
number={5},
pages={1276-1283},
abstract={Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.},
keywords={},
doi={10.1587/transfun.E92.A.1276},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Quantum Arithmetic Circuits: A Survey
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1276
EP - 1283
AU - Yasuhiro TAKAHASHI
PY - 2009
DO - 10.1587/transfun.E92.A.1276
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2009
AB - Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.
ER -