Corpus ID: 12469009

Learning graph based quantum query algorithms for finding constant-size subgraphs

@article{Lee2012LearningGB,
  title={Learning graph based quantum query algorithms for finding constant-size subgraphs},
  author={T. Lee and F. Magniez and M. Santha},
  journal={Chic. J. Theor. Comput. Sci.},
  year={2012},
  volume={2012}
}
  • T. Lee, F. Magniez, M. Santha
  • Published 2012
  • Mathematics, Computer Science, Physics
  • Chic. J. Theor. Comput. Sci.
  • Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity of determining if an $n$-vertex graph contains $H$ as a subgraph is $O(n^{2-2/k-t})$, where $ t = \max{\frac{k^2- 2(m+1)}{k(k+1)(m+1)}, \frac{2k - d - 3}{k(d+1)(m-d+2)}}$. The previous best algorithm of Magniez et al. had complexity $\widetilde O(n^{2-2/k})$. 
    24 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
    • 2
    • PDF
    Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing
    • 17
    • PDF
    Span-program-based quantum algorithm for tree detection
    • G. Wang
    • Mathematics, Computer Science
    • ArXiv
    • 2013
    • 2
    • PDF
    Quantum algorithms for finding constant-sized sub-hypergraphs
    • 2
    • PDF
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
    Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
    • 41
    • PDF
    Span program for non-binary functions
    • 1
    • PDF
    Time-Efficient Quantum Walks for 3-Distinctness
    • 45
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Quantum Query Complexity of Some Graph Problems
    • 28
    • PDF
    Quantum query complexity of minor-closed graph properties
    • 38
    • PDF
    Quantum Query Complexity of Some Graph Problems
    • 126
    • PDF
    Span programs for functions with constant-sized 1-certificates: extended abstract
    • A. Belovs
    • Mathematics, Computer Science
    • STOC '12
    • 2012
    • 90
    • Highly Influential
    • PDF
    Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates
    • 12
    • PDF
    Learning-Graph-Based Quantum Algorithm for k-Distinctness
    • A. Belovs
    • Mathematics, Physics
    • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
    • 2012
    • 70
    • Highly Influential
    • PDF
    Reflections for quantum query algorithms
    • 142
    • PDF
    Quantum lower bounds by polynomials
    • 400
    • PDF