Name
Title | ||
|---|---|---|
Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights |
Abstract | ||
|---|---|---|
As one of the applications of Grover search, an exact quantum algorithm for the symmetric weight decision problem of a Boolean function has been proposed recently. Although the proposed method shows a quadratic speedup over the classical approach, it only applies to the symmetric case of a Boolean function whose weight is one of the pair {0 w 1 w 2 w 1 + w 2 = 1}. In this article, we generalize this algorithm in two ways. Firstly, we propose a quantum algorithm for the more general asymmetric case where {0 w 1 w 2 w 1 w 2 w m |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s11128-010-0187-9 | Quantum Information Processing |
Keywords | Field | DocType |
Quantum algorithm,Generalized weight decision problem,Query complexity | Boolean function,Discrete mathematics,Quantum,Decision problem,Quantum mechanics,Quantum state,Quadratic equation,Quantum algorithm,Speedup,Physics | Journal |
Volume | Issue | ISSN |
10 | 2 | 1570-0755 |
Citations | PageRank | References |
1 | 0.37 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Byung-Soo Choi | 1 | 46 | 7.09 |
| Samuel L. Braunstein | 2 | 51 | 6.86 |