Learning-Graph-Based Quantum Algorithm for k-Distinctness

@article{Belovs2012LearningGraphBasedQA,
  title={Learning-Graph-Based Quantum Algorithm for k-Distinctness},
  author={A. Belovs},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={207-216}
}
  • A. Belovs
  • Published 2012
  • Mathematics, Physics, Computer Science
  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
  • We present a quantum algorithm solving the k-distinctness problem in a less number of queries than the previous algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. 
    70 Citations

    Figures and Topics from this paper.

    Paper Mentions

    BLOG POST
    Time-Efficient Quantum Walks for 3-Distinctness
    • 45
    • PDF
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
    Quantum algorithms for finding constant-sized sub-hypergraphs
    • 2
    • PDF
    Quantum Walks and Electric Networks
    • 21
    • PDF
    Adversary lower bound for the k-sum problem
    • 37
    • PDF
    On the Power of Non-adaptive Learning Graphs
    • 5
    • PDF
    On the Power of Non-adaptive Learning Graphs
    • 23
    • PDF
    Recent Developments in Quantum Algorithms and Complexity
    • 2
    Applications of Adversary Method in Quantum Query Algorithms
    • 11
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    Quantum algorithms for subset finding
    • 67
    • PDF
    Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
    • 27
    • PDF
    Adversary lower bound for the k-sum problem
    • 37
    • PDF
    Quantum walk algorithm for element distinctness
    • A. Ambainis
    • Computer Science, Physics
    • 45th Annual IEEE Symposium on Foundations of Computer Science
    • 2004
    • 610
    • Highly Influential
    • PDF
    Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates
    • 12
    • PDF
    Span programs for functions with constant-sized 1-certificates: extended abstract
    • A. Belovs
    • Mathematics, Computer Science
    • STOC '12
    • 2012
    • 88
    • PDF
    The Quantum Query Complexity of Algebraic Properties
    • 22
    • PDF
    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
    • 10
    • PDF
    Quantum lower bounds by quantum arguments
    • 372
    • PDF