Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Quantum full adder and subtractor

Quantum full adder and subtractor

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

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

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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
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.

© IEE
Published

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.

Inspec keywords: quantum gates; digital arithmetic; adders; quantum computing

Other keywords: classical truth tables; n-bits adder; quantum computer; elementary quantum gates; n-bits subtractor; n-bits numbers; quantum full subtractor; quantum full adder

Subjects: Logic circuits; Quantum computing theory; Digital circuit design, modelling and testing; Digital arithmetic methods; Other logic elements; Logic design methods

References

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

Related content

content/journals/10.1049/el_20020949
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address