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 |
id |
ndltd-TW-095NDHU5392047 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-095NDHU53920472019-05-15T19:47:47Z http://ndltd.ncl.edu.tw/handle/nmk283 Efficient Construction for Quantum Boolean Circuits 高效率的量子電路建構方法 Tsung-Hsun Liu 劉宗勳 碩士 國立東華大學 資訊工程學系 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. Hsin-Chou Chi 紀新洲 2007 學位論文 ; thesis 54 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 資訊工程學系 === 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.
|
author2 |
Hsin-Chou Chi |
author_facet |
Hsin-Chou Chi Tsung-Hsun Liu 劉宗勳 |
author |
Tsung-Hsun Liu 劉宗勳 |
spellingShingle |
Tsung-Hsun Liu 劉宗勳 Efficient Construction for Quantum Boolean Circuits |
author_sort |
Tsung-Hsun Liu |
title |
Efficient Construction for Quantum Boolean Circuits |
title_short |
Efficient Construction for Quantum Boolean Circuits |
title_full |
Efficient Construction for Quantum Boolean Circuits |
title_fullStr |
Efficient Construction for Quantum Boolean Circuits |
title_full_unstemmed |
Efficient Construction for Quantum Boolean Circuits |
title_sort |
efficient construction for quantum boolean circuits |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/nmk283 |
work_keys_str_mv |
AT tsunghsunliu efficientconstructionforquantumbooleancircuits AT liúzōngxūn efficientconstructionforquantumbooleancircuits AT tsunghsunliu gāoxiàolǜdeliàngzidiànlùjiàngòufāngfǎ AT liúzōngxūn gāoxiàolǜdeliàngzidiànlùjiàngòufāngfǎ |
_version_ |
1719094222316896256 |