Fetching the paper…
Reading the bibliography…
We develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
Svante Janson, Tomasz Łuczak, and Andrzej Ruciński. Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization
2000
Earlier work this paper cites.
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca and Ronald de Wolf. Quantum lower bounds by polynomials. J. ACM
2001
Earlier work this paper cites.
Mario Szegedy. Quantum speed-up of Markov chain based algorithms. In Proceedings of FOCS
2004
Earlier work this paper cites.
Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha and Ronald de Wolf. Quantum algorithms for element distinctness. SIAM J. Comput
2005
Earlier work this paper cites.
Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci
2005
Earlier work this paper cites.
Andris Ambainis. Quantum walk algorithm for element distinctness. SIAM J. Comput
2007
Earlier work this paper cites.
Peter Høyer, Troy Lee and Robert Špalek. Negative weights make adversaries stronger. In Proceedings of STOC
2007
Earlier work this paper cites.
Frédéric Magniez, Miklos Santha and Mario Szegedy. Quantum algorithms for the triangle problem. SIAM J. Comput
2007
Earlier work this paper cites.
Ryan Williams. Algorithms and resource requirements for fundamental problems
2007
Cited alongside, same era.
Ben Reichardt. Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. In Proceedings of FOCS
2009
Cited alongside, same era.
Virginia Vassilevska Williams and Ryan Williams. Subcubic equivalences between path, matrix and triangle problems. In Proceedings of FOCS
2010
Cited alongside, same era.
Frédéric Magniez, Ashwin Nayak, Jérémie Roland and Miklos Santha. Search via quantum walk. SIAM J. Comput
2011
Cited alongside, same era.
Aleksandrs Belovs. Span programs for functions with constant-sized 1 1 -certificates: extended abstract. In Proceedings of STOC
2012
Cited alongside, same era.
Troy Lee, Frédéric Magniez and Miklos Santha. Learning graph based quantum query algorithms for finding constant-size subgraphs. Chicago J. Theor. Comput. Sci
2012
Later among the works it cites.
Yechao Zhu. Quantum query complexity of constant-sized subgraph containment. Int. J. Quant. Inf
2012
Later among the works it cites.
Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari and Frédéric Magniez. Time-efficient quantum walks for 3-distinctness. In Proceedings of ICALP, Part I
2013
Closest in time.
Aleksandrs Belovs and Ansis Rosmanis. On the power of non-adaptive learning graphs. In Proceedings of CCC
2013
Closest in time.
Stacey Jeffery, Robin Kothari and Frédéric Magniez. Nested quantum walks with quantum data structures. In Proceedings of SODA
2013
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aleksandrs Belovs. Learning-graph-based quantum algorithm for k k -distinctness. In Proceedings of FOCS
2012
Cited alongside, same era.
François Le Gall. Improved output-sensitive quantum algorithms for Boolean matrix multiplication. In Proceedings of SODA
2012
Cited alongside, same era.
Closest in time.
Troy Lee, Frédéric Magniez and Miklos Santha. Improved quantum query algorithms for triangle finding and associativity testing. In Proceedings of SODA
2013
Closest in time.
Virginia Vassilevska Williams and Ryan Williams. Finding, minimizing, and counting weighted subgraphs. SIAM J. Comput
2013
Closest in time.