Quantum algorithms for finding constant-sized sub-hypergraphs

DOI10.1016/j.tcs.2015.10.006zbMath1333.68115arXiv1310.4127OpenAlexW1814302338MaRDI QIDQ896154

François Le Gall, Seiichiro Tani, Harumichi Nishimura

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.4127

zbMATH Keywords

quantum algorithmshypergraphsquantum walk

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the power of non-adaptive learning graphs
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Finding, Minimizing, and Counting Weighted Subgraphs
• QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT
• Search via Quantum Walk
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Quantum Algorithms for Element Distinctness
• Time-Efficient Quantum Walks for 3-Distinctness
• Quantum Algorithms for the Triangle Problem
• Span programs for functions with constant-sized 1-certificates
• Quantum lower bounds by polynomials
• Quantum Walk Algorithm for Element Distinctness
• Nested Quantum Walks with Quantum Data Structures
• Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing