A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Coins, Quantum Measurements, and Turing's Barrier
Quantum Information Processing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Complexity of Probabilistic Versus Deterministic Automata
Baltic Computer Science, Selected Papers
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Introduction to Quantum Computing
An Introduction to Quantum Computing
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Reversible computing and cellular automata—A survey
Theoretical Computer Science
| Hi-index | 0.00 |
Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we present a quantum query algorithm for conjunction of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p = 4/5, that improves the previous result. Then, we present the main result - generalization of our approach to design efficient quantum algorithms for computing conjunction of two Boolean functions. Finally, we demonstrate another kind of an algorithm for conjunction of two bits, that has a correct answer probability p = 9/10. This algorithm improves success probability by 10%, but stands aside and cannot be extended to compute conjunction of Boolean functions.