Efficient Construction for Quantum Boolean Circuits
碩士 === 國立東華大學 === 資訊工程學系 === 95 === As the development of VLSI design advances, quantum computing is a possible alternative for solving the bottleneck of future computer design. Just like a classical computer, a quantum computer also has circuits and logic gates inside. Over the last few years, seve...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/nmk283 |
| Summary: | 碩士 === 國立東華大學 === 資訊工程學系 === 95 === As the development of VLSI design advances, quantum computing is a possible alternative for solving the bottleneck of future computer design. Just like a classical computer, a quantum computer also has circuits and logic gates inside. Over the last few years, several quantum circuit simplification methods have been proposed. However, most methods are complex and others can not be automated.
In the classical logic design, the Quine-McCluskey method (Tabulation Method) and the Karnaugh map are efficient and easy methods of minimization for conventional logic design. In this thesis, we design a grouping operation technique to classify data and another method to extract the XOR operation between two gates in the circuit. We present our grouping method and using those two simplification steps to construct the quantum circuit effectively.
|
|---|