Quantum algorithm for triangle finding in sparse graphs
From MaRDI portal
Publication:1679241
DOI10.1007/s00453-016-0267-zzbMath1380.68188arXiv1507.06878OpenAlexW2569388384MaRDI QIDQ1679241
François Le Gall, Shogo Nakajima
Publication date: 9 November 2017
Published in: Algorithmica, Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06878
Related Items (4)
Models in quantum computing: a systematic review ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Extended learning graphs for triangle finding ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Improved quantum query algorithms for triangle detection and associativity testing
- Finding and counting given length cycles
- Quantum search with variable times
- Finding, Minimizing, and Counting Weighted Subgraphs
- Towards polynomial lower bounds for dynamic problems
- Search via Quantum Walk
- Susceptibility in subcritical random graphs
- Finding a Minimum Circuit in a Graph
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- Quantum Query Complexity of Minor-Closed Graph Properties
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Triangle Problem
- Span programs for functions with constant-sized 1-certificates
- Quantum Walk Algorithm for Element Distinctness
- Nested Quantum Walks with Quantum Data Structures
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication: Quantum algorithm for triangle finding in sparse graphs
