Abstract
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalization of a well-known observation that many quantum query algorithms only require the knowledge of the position of possible certificates in the input string, not the precise values therein.
Next, we derive a dual formulation of the complexity of a non-adaptive learning graph and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure such that a learning graph gives an optimal quantum query algorithm for it.
For a special case of certificate structures generated by certificates of bounded size, we construct a relatively general class of functions having this property. The construction is based on orthogonal arrays and generalizes the quantum query lower bound for the k-sum problem derived recently by Belovs and Špalek (Proceeding of 4th ACM ITCS, 323–328, 2013).
Finally, we use these results to show that the learning graph for the triangle problem by Lee et al. (Proceeding of 24th ACM-SIAM SODA, 1486–1502, 2013) is almost optimal in the above settings. This also gives a quantum query lower bound for the triangle sum problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aaronson Scott, Yaoyun Shi: Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM 51(4), 595–605 (2004)
Ambainis Andris: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences 64(4), 750–767 (2002)
Ambainis Andris: Quantum walk algorithm for element distinctness. SIAM Journal on Computing 37(1), 210–239 (2007)
Aleksandrs Belovs, Span programs for functions with constant-sized 1-certificates. In Proc. of 44th ACM STOC, 2012a, 77–84.
Aleksandrs Belovs, Learning-graph-based quantum algorithm for k-distinctness. In Proc. of 53rd IEEE FOCS, 2012b, 207–216.
Aleksandrs Belovs and Troy Lee, Quantum algorithm for k-distinctness with prior knowledge on the input. 2011.
Aleksandrs Belovs and Robert Špalek, Adversary lower bound for the k-sum problem. In Proc. of 4th ACM ITCS, 2012, 323–328.
Stephen Boyd and Lieven Vandenberghe, Convex optimization. Cambridge University Press, 2004.
Gilles Brassard, Peter Høyer, and Alain Tapp, Quantum cryptanalysis of hash and claw-free functions. In Proc. of 3rd LATIN, vol. 1380 of LNCS. Springer, 1998, 163–169.
Harry Buhrman and Ronald de Wolf, Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288 (2002), 21–43.
Andrew M. Childs, and Jason M. Eisenberg, Quantum algorithms for subset finding. Quantum Information & Computation 5(7), 593–604 (2005)
Mark Ettinger, Peter Høyer, and Emanuel Knill, The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters 91(1) (2004), 43–48.
Dmitry Gavinsky and Tsuyoshi Ito, A quantum query algorithm for the graph collision problem. 2012.
Bryan Gillespie, On randomness of subsets of \({\mathbb{Z}_N}\), as described by uniformity of Fourier coefficients. 2010.
Lov K. Grover, A fast quantum mechanical algorithm for database search. In Proc. of 28th ACM STOC, 1996, 212–219.
A. S. Hedayat, N. J. A. Sloane, and John Stufken, Orthogonal arrays: theory and applications. Springer, 1999.
Peter Høyer, Troy Lee, and Robert Špalek, Negative weights make adversaries stronger. In Proc. of 39th ACM STOC, 2007, 526–535.
Greg Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing 35 (2005), 170–188.
Troy Lee, Frédéric Magniez, and Miklos Santha, A learning graph based quantum query algorithm for finding constant-size subgraphs. 2011a.
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek, and Mario Szegedy, Quantum query complexity of the state conversion problem. In Proc. of 52nd IEEE FOCS, 2011b, 344–353.
Troy Lee, Frédéric Magniez, and Miklos Santha, Improved quantum query algorithms for triangle finding and associativity testing. In Proc. of 24th ACM-SIAM SODA, 2013, 1486–1502.
Frédéric Magniez, Miklos Santha, and Mario Szegedy, Quantum algorithms for the triangle problem. SIAM Journal on Computing 37(2) (2007), 413–424.
Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha, Search via quantum walk. SIAM Journal on Computing 40(1) (2011), 142–164.
Ben W. Reichardt, Reflections for quantum query algorithms. In Proc. of 22nd ACM-SIAM SODA, 2011, 560–569.
Špalek Robert, Szegedy Mario: All quantum adversary methods are equivalent. Theory of Computing 2, 1–18 (2006)
Terence Tao and Vav H. Vu, Additive combinatorics, vol. 105 of Cambridge Studies in Advanced Mathematics. 2006.
Zhang Shengyu: On the power of Ambainis lower bounds. Theoretical Computer Science 339(2), 241–256 (2005)
Yechao Zhu, Quantum query complexity of subgraph containment with constant-sized certificates. International Journal of Quantum Information 10(3), (2012).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Belovs, A., Rosmanis, A. On the Power of Non-adaptive Learning Graphs. comput. complex. 23, 323–354 (2014). https://doi.org/10.1007/s00037-014-0084-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-014-0084-1
Keywords
- Quantum computing
- query algorithms
- adversary method
- k-sum problem
- triangle problem
- semidefinite optimization