Improved quantum algorithm for triangle finding via combinatorial arguments

DOI10.1109/FOCS.2014.31MaRDI QIDQ6947240zbMATH OpenFDO

Authors François Le Gall

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2014.31

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(7)

• Listing 4-cycles
• Derandomization of quantum algorithm for triangle finding
• On quantum query complexities of collision-finding in non-uniform random functions
• Quantum algorithms for Hopcroft's problem
• Quantum data structure for range minimum query
• Parameterized quantum query algorithms for graph problems
• Exponential speedups for quantum walks in random hierarchical graphs

This page was built for publication: Improved quantum algorithm for triangle finding via combinatorial arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947240)