Optimality proofs of quantum weight decision algorithms

Authors:
Byung-Soo Choi
Affiliations:
Center for Quantum Information Processing, Department of Electrical and Computer Engineering, University of Seoul, Seoul, Republic of Korea (South Korea) 130-743
Venue:
Quantum Information Processing
Year:
2012

Citing 10
Cited 1

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
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
Quantum lower bounds by quantum arguments

Journal of Computer and System Sciences - Special issue on STOC 2000
Quantum Lower Bounds by Polynomials

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Phase matching condition for quantum search with a generalized initial state

Physics Letters A
Grover's Quantum Algorithm Applied to Global Optimization

SIAM Journal on Optimization
Simple Algorithm for Partial Quantum Search

Quantum Information Processing
Quantum Partial Search of a Database with Several Target Items

Quantum Information Processing
Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

Quantum Information Processing

A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently two quantum algorithms have been proposed for the symmetric and asymmetric weight decision problems. Although they show the quadratic speedup over the classical approaches, their optimality has not been proven formally. In this article, we prove their optimality in a formal fashion.