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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
