Learning-Graph-Based Quantum Algorithm for k-Distinctness

@article{Belovs2012LearningGraphBasedQA,
  title={Learning-Graph-Based Quantum Algorithm for k-Distinctness},
  author={Aleksandrs Belovs},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={207-216}
}
  • Aleksandrs Belovs
  • Published 7 May 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. 
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
TLDR
An extension to the quantum walk search framework that facilitates quantum walks with nested updates is presented, to give a quantum walk algorithm for 3-Distinctness with query complexity ~O(n^{5/7}), matching the best known upper bound up to log factors.
Time-Efficient Quantum Walks for 3-Distinctness
TLDR
Two quantum walk algorithms for 3-Distinctness are presented, improving the previous $\tilde{O}(n^{3/4})$ and matching the best known upper bound for query complexity (obtained via learning graphs) up to log factors.
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs
We develop a general framework to construct quantum algorithms that detect if a 3-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
Quantum algorithms for finding constant-sized sub-hypergraphs
We develop a general framework to construct quantum algorithms that detect if a 3-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph.
Quantum Walks and Electric Networks
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the
Adversary lower bound for the k-sum problem
We prove a tight quantum query lower bound Omega(nk/(k+1)) for the problem of deciding whether there exist k numbers among n that sum up to a prescribed number, provided that the alphabet size is
On the Power of Non-adaptive Learning Graphs
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of
On the Power of Non-adaptive Learning Graphs
TLDR
A notion of the quantum query complexity of a certificate structure is introduced and there exists a function possessing the certificate structure such that a learning graph gives an optimal quantum query algorithm for it.
Recent Developments in Quantum Algorithms and Complexity
TLDR
This work surveys several recent developments in quantum algorithms and complexity, including Reichardt's characterization of quantum query algorithms via span programs and exact quantum algorithms with superlinear advantage over the best classical algorithm.
Applications of Adversary Method in Quantum Query Algorithms
In the thesis, we use a recently developed tight characterisation of quantum query complexity, the adversary bound, to develop new quantum algorithms and lower bounds. Our results are as follows: *
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Quantum algorithms for subset finding
TLDR
This algorithm is reviewed and a simplified and tightened analysis of its query complexity is given using techniques previously applied to the analysis of continuous-time quantum walk.
Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
It is known that the dual of the general adversary bound can be used to build quantum query algorithms with optimal complexity. Despite this result, not many quantum algorithms have been designed
Adversary lower bound for the k-sum problem
We prove a tight quantum query lower bound Omega(nk/(k+1)) for the problem of deciding whether there exist k numbers among n that sum up to a prescribed number, provided that the alphabet size is
Quantum walk algorithm for element distinctness
  • A. Ambainis
  • Mathematics, Physics
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
TLDR
An O(N/sup k/(k+1)/) query quantum algorithm is given for the generalization of element distinctness in which the authors have to find k equal items among N items.
Span programs for functions with constant-sized 1-certificates: extended abstract
TLDR
The power of the approach is proved by designing a quantum algorithm for the triangle problem with query complexity O(n35/27) that is better than O( n13/10) of the best previously known algorithm by Magniez et al.
The Quantum Query Complexity of Algebraic Properties
TLDR
The first application of the new quantum random walk technique by Magniez, Nayak, Roland, and Santha that improves the previous bounds by Ambainis [3] and Szegedy [23] is given.
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, l. We prove an upper bound of
Quantum lower bounds by quantum arguments
TLDR
Two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques are proved.
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
TLDR
An algorithm is given that uses O(n) queries to the adjacency matrix of an n-vertex graph to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected.
Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates
We study the quantum query complexity of constant-sized subgraph containment. Such problems include determining whether an $ n $-vertex graph contains a triangle, clique or star of some size. For a
...
1
2
3
...