Quantum Group Testing with k-selective Families
碩士 === 國立交通大學 === 資訊工程系 === 91 === We describe the quantum group testing algorithm. Group testing problem has a history of research in the early days of computer science. In 2001, Clementi et al. introduce the k-selective family which can be use...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/08843896678927877867 |
| Summary: | 碩士 === 國立交通大學 === 資訊工程系 === 91 === We describe the quantum group testing algorithm.
Group testing problem has a history of research
in the early days of computer science.
In 2001, Clementi et al. introduce the k-selective family which
can be used to solve this problem.
Indyk provides a explicit construction method for the k-selective family
in 2002.
In this thesis, we first explain Grover's quantum search algorithm.
Then we involve the k-selective system with quantum computation
to solve the group testing problem with a better time complexity.
|
|---|