Fetching the paper…
Reading the bibliography…
Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithm and factoring
P. Shor · 1997
Earlier work this paper cites.
On the power of quantum computation
D. Simon · 1997
Earlier work this paper cites.
Bounds for small-error and zero-error quantum algorithms
H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka · 1999
Earlier work this paper cites.
Hidden subgroup states are almost orthogonal
M. Ettinger, P. Høyer, and E. Knill · 1999
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 2001
Earlier work this paper cites.
Quantum algorithms for element distinctness
H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf · 2005
Earlier work this paper cites.
Lower bounds on quantum query complexity
P. Høyer and R. Špalek · 2005
Cited alongside, same era.
Quantum query complexity of some graph problems
C. Dürr, M. Heiligman, P. Høyer, and M. Mhalla · 2006
Cited alongside, same era.
Quantum walk algorithm for element distinctness
A. Ambainis · 2007
Cited alongside, same era.
Negative weights make adversaries stronger
Peter Høyer, Troy Lee, and Robert Špalek · 2007
Cited alongside, same era.
Quantum algorithms for the triangle problem
F. Magniez, M. Santha, and M. Szegedy · 2007
Cited alongside, same era.
Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function
Ben W. Reichardt · 2009
Cited alongside, same era.
Quantum query complexity of state conversion
T. Lee, R. Mittal, B. Reichardt, R. Špalek, and M. Szegedy · 2011
Closest in time.
Search via quantum walk
F. Magniez, A. Nayak, J. Roland, and M. Santha · 2011
Closest in time.
Reflections for quantum query algorithms
Ben W. Reichardt · 2011
Closest in time.
Quantum query complexity of subgraph containment with constant-sized certificates
Y. Zhu · 2011
Closest in time.
Learning-graph-based quantum algorithm for k k -distinctness
A. Belovs · 2012
Closest in time.
Span programs for functions with constant-sized 1-certificates
A. Belovs · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum query complexity of minor-closed graph properties
A. Childs and R. Kothari · 2011
Cited alongside, same era.