Improving boolean circuit testing by using quantum search

Yao Hsin Chou, Sy Yen Kuo*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Given any classical circuit, a minimum input quantum version of boolean circuit can be constructed with general CCN gates. Any quantum boolean circuit can be easily tested with one test pattern under stuck-at fault model. In this paper, we apply quantum search algorithm to boolean logic testing problem and drastically decrease not only the number of test patterns but also the time and the number of bits we needed to find out the faulty wires.

Original languageEnglish
Title of host publication2008 8th IEEE Conference on Nanotechnology, IEEE-NANO
Pages617-620
Number of pages4
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 8th IEEE Conference on Nanotechnology, IEEE-NANO - Arlington, TX, United States
Duration: 18 08 200821 08 2008

Publication series

Name2008 8th IEEE Conference on Nanotechnology, IEEE-NANO

Conference

Conference2008 8th IEEE Conference on Nanotechnology, IEEE-NANO
Country/TerritoryUnited States
CityArlington, TX
Period18/08/0821/08/08

Fingerprint

Dive into the research topics of 'Improving boolean circuit testing by using quantum search'. Together they form a unique fingerprint.

Cite this