By Topic

Quantum Boolean circuits construction using tabulation method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chin-Yung Lu ; Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Shiou-An Wang ; Sy-Yen Kuo

The tabulation method can be used with a computer to simplify Boolean logic functions with up to 6 or more variables, especially with a large number of variables. For the various applications, their circuits usually are complex and we must simplify the circuit design to the best of our ability. In this paper, we present an algorithm that can efficiently simplify a quantum Boolean circuit with an arbitrary number of input variables by using the tabulation method. In terms of the space consumption, we use only one auxiliary qubit as the output qubit, and keep all the input qubits unchanged.

Published in:

Nanotechnology, 2004. 4th IEEE Conference on

Date of Conference:

16-19 Aug. 2004