Loading...
Please wait, while we are loading the content...
Similar Documents
On a New Quantum Search Algorithm and Its Computational Complexity (函数解析学による一般化エントロピーの新展開 : RIMS研究集会報告集)
| Content Provider | Semantic Scholar |
|---|---|
| Author | 聖史, 入山 雅則, 大矢 |
| Copyright Year | 2013 |
| Abstract | In this paper, we introduce a new quantum algorithm for search problem, and discuss its computational complexity. This quantum algorithm is based on the $OV$ quantum algorithm for SAT problem. |
| Starting Page | 33 |
| Ending Page | 39 |
| Page Count | 7 |
| File Format | PDF HTM / HTML |
| Volume Number | 1852 |
| Alternate Webpage(s) | http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/1852-05.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |