Using Bernstein-Vazirani Algorithm to Solve Balanced Boolean Function with Two-Bits
碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 107 === This thesis uses Bernstein-Vazirani algorithm to solve balanced Boolean function with two bits. Bernstein-Vazirani algorithm can discover a from the function f(x)=a∙x+b ( mod 2). But, Bernstein-Vazirani algorithm cannot directly find a from the measured value,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/a62y47 |