Fetching the paper…
Reading the bibliography…
We study the quantum query complexity of constant-sized subgraph containment.
D. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proceedings of the Royal Society of London A
1992
Earlier work this paper cites.
L. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the 29th ACM Symposium on Theory of computing
1996
Earlier work this paper cites.
D. Meyer, “From quantum cellular automata to quantum lattice gases,” Journal of Statistical Physics
1996
Earlier work this paper cites.
D. Meyer, “On the absence of homogeneous scalar unitary cellular automata,” Physics Letters A
1996
Earlier work this paper cites.
P. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing
1997
Earlier work this paper cites.
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, “Quantum lower bounds by polynomials,” Journal of the ACM
2001
Earlier work this paper cites.
J. Watrous, “Quantum simulations of classical random walks and undirected graph connectivity,” Journal of Computer and System Sciences
2001
Earlier work this paper cites.
A. Ambainis, “Quantum lower bounds by quantum arguments,” Journal of Computer and System Sciences
2002
Earlier work this paper cites.
H. Buhrman and R. de Wolf, “Complexity measures and decision tree complexity: a survey,” Theoretical Computer Science
2002
Cited alongside, same era.
N. Shenvi, J. Kempe, and K. Whaley, “Quantum random-walk search algorithm,” Physical Review A
2003
Cited alongside, same era.
S. Aaronson and Y. Shi, “Quantum lower bounds for the collision and the element distinctness problems,” Journal of the ACM
2004
Cited alongside, same era.
H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf, “Quantum algorithms for element distinctness,” SIAM Journal on Computing
2005
Cited alongside, same era.
S. Zhang, “On the power of ambainis lower bounds,” Theoretical Computer Science
2005
Cited alongside, same era.
F. Magniez, A. Nayak, J. Roland, and M. Santha, “Search via quantum walk,” in Proceedings of the 39th ACM Symposium on Theory of computing
2007
Later among the works it cites.
B. Reichardt, “Span programs and quantum query algorithms,” Electronic Colloquium on Computational Complexity (ECCC)
2010
Later among the works it cites.
B. Reichardt, “Least span program witness size equals the general adversary lower bound on quantum query complexity,” Electronic Colloquium on Computational Complexity (ECCC)
2010
Later among the works it cites.
B. Reichardt, “Reflections for quantum query algorithms.,” in SODA
2011
Closest in time.
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Buhrman and R. Špalek, “Quantum verification of matrix products,” in Proceedings of the 17th ACM-SIAM symposium on Discrete algorithm
2006
Cited alongside, same era.
A. Ambainis, “Quantum walk algorithm for element distinctness,” SIAM Journal on Computing
2007
Cited alongside, same era.
F. Magniez, M. Santha, and M. Szegedy, “Quantum algorithms for the triangle problem,” SIAM Journal on Computing
2007
Cited alongside, same era.
2011
Closest in time.
A. Childs and R. Kothari, “Quantum query complexity of minor-closed graph properties,” in Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
2011
Closest in time.