Cumulative balance testing of logic circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Balance testing and balance-testable design of logic circuits
Journal of Electronic Testing: Theory and Applications
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Designs, Intersecting Families, and Weight of Boolean Functions
Proceedings of the 7th IMA International Conference on Cryptography and Coding
Grover's Quantum Algorithm Applied to Global Optimization
SIAM Journal on Optimization
Simple Algorithm for Partial Quantum Search
Quantum Information Processing
Quantum Information Processing
Quantum Partial Search of a Database with Several Target Items
Quantum Information Processing
Optimality proofs of quantum weight decision algorithms
Quantum Information Processing
Quantum Information Processing
| Hi-index | 0.00 |
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