Abstract
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only "balanced" or "tilted" information and that we know the number k of false coins in advance. The balance scale can be modeled by a certain type of oracle and its query complexity is a measure for the cost of weighing algorithms (the number of weighings). In this paper, we study the quantum query complexity for this problem. Let Q(k,N) be the quantum query complexity of finding all k false coins from the N given coins. We show that for any k and N such that k
Cite
CITATION STYLE
Iwama, K., Nishimura, H., Raymond, R., & Teruyama, J. (2010). Quantum counterfeit coin problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6506 LNCS, pp. 85–96). https://doi.org/10.1007/978-3-642-17517-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
