Quantum full adder and subtractor

Quantum full adder and subtractor

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The designs of quantum full adder (QFA) and quantum full subtractor (QFS) are investigated. First, the 1-bit QFA and 1-bit QFS are designed according to the classical truth tables. The adder and subtractor for two n-bits numbers are then separately constructed from n 1-bit QFAs and QFSs. The number of elementary quantum gates to accomplish the design of n-bits adder and subtractor are 4n and 8n, respectively.


    1. 1)
      • M.A. Neilsen , I.L. Chuang . (2000) Quantum computation and quantum information.
    2. 2)
      • C.P. Williams , S.H. Clearwater . (2000) Ultimate zero and one: computing at the quantum frontier.
    3. 3)
      • G. Cattaneo , M.L. Dalla , R. Giuntini , R. Leporini . (2002) An unsharp logic from quantum computation.
    4. 4)
      • V. Vedral , A. Barenco , A. Ekert . Quantum networks for elementary arithmetic operations. Phys. Rev. A , 147 , 1 - 7
    5. 5)
      • A. Glassner . Quantum computing-Pt 2. IEEE Comput. Graph. Appl. , 4 , 86 - 95
    6. 6)
      • M. Morris Mano . (1991) Digital design.
    7. 7)
      • D.A. Pucknell , K. Eshraghian . (1994) Basic VLSI design.

Related content

This is a required field
Please enter a valid email address