Quantum Counterfeit Coin Problems

B. Manvel. Counterfeit coin problems. Mathematics Magazine

1977

Earlier work this paper cites.

R. K. Guy and R. J. Nowakowski. Coin-weighing problems. Amer. Math. Monthly

1995

Earlier work this paper cites.

L. Halbeisen and N. Hungerbühler. The general counterfeit coin problem. Discrete Mathematics

1995

Earlier work this paper cites.

L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. 28th STOC

1996

Earlier work this paper cites.

E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput

1997

Earlier work this paper cites.

M. Boyer, G. Brassard, P. Høyer and A. Tapp. Tight bounds on quantum searching. Fortschritte Der Physik

1998

Earlier work this paper cites.

B. M. Terhal and J. A. Smolin. Single quantum querying of a database. Phys. Rev. A

1998

Earlier work this paper cites.

A. Ambainis. Quantum lower bounds by quantum arguments. J. Comput. Syst. Sci

2002

Cited alongside, same era.

G. Brassard, P. Høyer, M. Mosca and A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume

2002

Cited alongside, same era.

H. Barnum, M. E. Saks, M. Szegedy. Quantum query complexity and semi-definite programming. In Proc. 18th CCC

2003

Cited alongside, same era.

W. A. Liu, W. G. Zhang and Z. K. Nie. Searching for two counterfeit coins with two-arms balance. Discrete Appl. Math

2005

Cited alongside, same era.

S. Zhang. On the power of Ambainis’s lower bounds. Theoret. Comput. Sci

Original

2005

Cited alongside, same era.

P. Høyer, T. Lee and R. Špalek. Negative weights make adversaries stronger. In Proc. 39th STOC

2007

Later among the works it cites.

F. Magniez, M. Santha and M. Szegedy. Quantum algorithms for the triangle problem. SIAM J. Comput

2007

Later among the works it cites.

W. van Dam and I. Shparlinski. Classical and quantum algorithms for exponential congruences. In Proc. 3rd TQC, Lecture Notes in Comput. Sci

2008

Later among the works it cites.

S. Laplante and F. Magniez. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. SIAM J. Comput

2008

Later among the works it cites.

B. Reichardt. Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function. In Proc. 50th FOCS

2009

Later among the works it cites.