Fetching the paper…
Reading the bibliography…
Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$.
E. A. Dinic, “Algorithm for solution of a problem of maximum flow in a network with power estimation,” Soviet Math Doklady
1970
Earlier work this paper cites.
J. E. Hopcroft and R. M. Karp, “An n 5 / 2 n^{5/2} algorithm for maximum matchings in bipartite graphs,” SIAM Journal on Computing
1973
Earlier work this paper cites.
Moscow State University Press, 1973
A. V. Karzanov, “O nakhozhdenii maksimal’nogo potoka v setyakh spetsial’nogo vida i nekotorykh prilozheniyakh,” in Matematicheskie Voprosy Upravleniya Proizvodstvom · 1973
Earlier work this paper cites.
S. Even and R. E. Tarjan, “Network flow and testing graph connectivity,” SIAM Journal on Computing
1975
Earlier work this paper cites.
B. Misra and E. C. G. Sudarshan, “The Zeno’s paradox in quantum theory,” Journal of Mathematical Physics
1977
Earlier work this paper cites.
S. Wiesner, “Conjugate coding,” ACM SIGACT News
1983
Earlier work this paper cites.
S. Cook, C. Dwork, and R. Reischuk, “Upper and lower time bounds for parallel random access machines without simultaneous writes,” SIAM Journal on Computing
1986
Earlier work this paper cites.
N. Nisan, “CREW PRAMs and decision trees,” SIAM Journal on Computing
1991
Earlier work this paper cites.
A. C. Elitzur and L. Vaidman, “Quantum mechanical interaction-free measurements,” Foundations of Physics
1993
Earlier work this paper cites.
P. Kwiat, H. Weinfurter, T. Herzog, A. Zeilinger, and M. A. Kasevich, “Interaction-free measurement,” Physical Review Letters
1995
Earlier work this paper cites.
May, 1996
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC) · 1996
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, “Strengths and weaknesses of quantum computing,” SIAM Journal on Computing
1997
Cited alongside, same era.
R. Bhatia, Matrix Analysis · 1997
Cited alongside, same era.
G. Mitchison and R. Jozsa, “Counterfactual computation,” Proceedings of the Royal Society A
2001
Cited alongside, same era.
H. Buhrman and R. D. Wolf, “Complexity measures and decision tree complexity: A survey,” Theoretical Computer Science
2002
Cited alongside, same era.
Springer, 2004
A. Berzina, A. Dubrovsky, R. Freivalds, L. Lace, and O. Scegulnaja, “Quantum query complexity for some graph problems,” in Lecture Notes in Computer Science · 2004
Cited alongside, same era.
S. Dörn, “Quantum algorithms for matching problems,” Theory of Computing Systems
2009
Later among the works it cites.
T.-G. Noh, “Counterfactual quantum cryptography,” Physical Review Letters
2009
Later among the works it cites.
MIT Press and McGraw-Hill, 3rd ed., 2009
T. H. Cormen, C. E. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms · 2009
Later among the works it cites.
F. Magniez, A. Nayak, J. Roland, and M. Santha, “Search via quantum walk,” SIAM Journal on Computing
2011
Later among the works it cites.
S. Kimmel, “Quantum adversary (upper) bound,” Chicago Journal of Theoretical Computer Science
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
Springer, 2006
A. Ambainis and R. Špalek, “Quantum algorithms for matching and network flows,” in Lecture Notes in Computer Science · 2006
Cited alongside, same era.
O. Hosten, M. T. Rakher, J. T. Barreiro, N. A. Peters, and P. G. Kwiat, “Counterfactual quantum computation through quantum interrogation,” Nature
2006
Cited alongside, same era.
A. Ambainis, “Quantum walk algorithm for element distinctness,” SIAM Journal on Computing
2007
Cited alongside, same era.
B. Furrow, “A panoply of quantum algorithms,” Quantum Information and Computation
2008
Cited alongside, same era.
O. Regev and L. Schiff, “Impossibility of a quantum speed-up with a faulty oracle,” in Lecture Notes in Computer Science · 2008
Cited alongside, same era.
Cited in the paper.
2013
Later among the works it cites.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2014
R. Kothari, “An optimal quantum algorithm for the oracle identification problem,” in Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS) · 2014
Closest in time.
S. Aaronson. Personal communication, 2014
2014
Closest in time.
2042
Closest in time.