Upper bounds on quantum query complexity inspired by the elitzur-vaidman bomb tester
Year: 2015
Type: preprint
Abstract: Inspired by the Elitzur-Vaidman bomb testing problem [19], we introduce a new query complexity model, which we call bomb query complexity B(f). We investigate its relationship with the usual quantum query complexity Q(f), and show that B(f) = Θ(Q(f)2).This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on [EQUATION]. We subsequently were able to give explicit quantum algorithms matching our upper bound method. We apply this method on the single-source shortest paths problem on unweighted graphs, obtaining an algorithm with O(n1.5) quantum query complexity, improving the best known algorithm of [EQUATION] [21]. Applying this method to the maximum bipartite matching problem gives an O(n1.75) algorithm, improving the best known trivial O(n2) upper bound.
Source: arXiv (Cornell University)
Authors: Cedric Yen-Yu Lin, Han-Hsuan Lin
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2964048406
