By Topic

Transformation rules for designing CNOT-based quantum circuits

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
$31 $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)
Iwama, K. ; Sch. of Inf., Kyoto Univ., Japan ; Kambayashi, Yahiko ; Yamashita, S.

This paper gives a simple but nontrivial set of local transformation rules for control-NOT (CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, for any two equivalent circuits, S1 and S2, there is a sequence of transformations, each of them in the rule set, which changes S1 to S2. Our motivation is to use this rule set for developing a design theory for quantum circuits whose Boolean logic parts should be implemented by CNOT-based circuits. As a preliminary example, we give a design procedure based on the transformation rules which reduces the cost of CNOT-based circuits.

Published in:

Design Automation Conference, 2002. Proceedings. 39th

Date of Conference:

2002