Abstract
The quantum query complexity of evaluating any read-once formula with n black-box input bits is \(\Theta(\sqrt n)\). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs can be repeated) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs can be repeated many times. We give an algorithm for evaluating any formula with n inputs, size S, and G gates using \(O(\min\{n, \sqrt{S}, n^{1/2} G^{1/4}\})\) quantum queries. Furthermore, we show that this algorithm is optimal, since for any n,S,G there exists a formula with n inputs, size at most S, and at most G gates that requires \(\Omega(\min\{n, \sqrt{S}, n^{1/2} G^{1/4}\})\) queries. We also show that the algorithm remains nearly optimal for circuits of any particular depth k ≥ 3, and we give a linear-size circuit of depth 2 that requires \(\tilde\Omega(n^{5/9})\) queries. Applications of these results include a \(\tilde\Omega(n^{19/18})\) lower bound for Boolean matrix product verification, a nearly tight characterization of the quantum query complexity of evaluating constant-depth circuits with bounded fanout, new formula gate count lower bounds for several functions including parity, and a construction of an AC0 circuit of linear size that can only be evaluated by a formula with Ω(n 2 − ε) gates.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ambainis, A., Childs, A.M., Reichardt, B.W., Špalek, R., Zhang, S.: Any AND-OR formula of size N can be evaluated in time N 1/2 + o(1) on a quantum computer. SIAM J. Comput. 39(6), 2513–2530 (2010)
Ambainis, A., Iwama, K., Nakanishi, M., Nishimura, H., Raymond, R., Tani, S., Yamashita, S.: Quantum Query Complexity of Boolean Functions with Small On-Sets. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 907–918. Springer, Heidelberg (2008)
Barnum, H., Saks, M.: A lower bound on the quantum query complexity of read-once functions. J. Comput. System Sci. 69(2), 244–258 (2004)
Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778–797 (2001)
Beame, P., Machmouchi, W.: The quantum query complexity of AC0. arXiv:1008.2422
Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 1510–1523 (1997)
Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O.: Quantum Query Complexity for Some Graph Problems. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 140–150. Springer, Heidelberg (2004)
Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4-5), 493–505 (1998)
Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: 30th STOC, pp. 63–68 (1998)
Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: 17th SODA, pp. 880–889 (2006)
Childs, A.M., Cleve, R., Jordan, S.P., Yonge-Mallo, D.: Discrete-query quantum algorithm for NAND trees. Theory Comput. 5, 119–123 (2009)
Dürr, C., Heiligman, M., Høyer, P., Mhalla, M.: Quantum query complexity of some graph problems. SIAM J. Comput. 35(6), 1310–1328 (2006)
Farhi, E., Goldstone, J., Gutmann, S.: A quantum algorithm for the Hamiltonian NAND tree. Theory Comput. 4(1), 169–190 (2008)
Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Limit on the speed of quantum computation in determining parity. Phys. Rev. Lett. 81(24), 5442–5444 (1998)
Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325–328 (1997)
Høyer, P., Mosca, M., de Wolf, R.: Quantum Search on Bounded-Error Inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 291–299. Springer, Heidelberg (2003)
Jeffery, S., Kothari, R., Magniez, F.: Improving quantum query complexity of Boolean matrix multiplication using graph collision, arXiv:1112.5855
Jukna, S.: Boolean Function Complexity. Springer (2012)
Khrapchenko, V.M.: Complexity of the realization of a linear function in the class of Π-circuits. Math. Notes 9(1), 21–23 (1971)
Kothari, R.: Formula size lower bounds for AC0 functions. Theoretical Computer Science Stack Exchange, http://cstheory.stackexchange.com/q/7156
Le Gall, F.: Improved output-sensitive quantum algorithms for Boolean matrix multiplication. In: 23rd SODA, pp. 1464–1476 (2012)
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37, 413–424 (2007)
Nechiporuk, E.I.: A Boolean function. Soviet Mathematics Doklady 7, 999–1000 (1966)
Nisan, N.: Shortest formula for an n-term monotone CNF. Theoretical Computer Science Stack Exchange, http://cstheory.stackexchange.com/a/7087
Reichardt, B.: Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. In: 50th FOCS, pp. 544–551 (2009)
Reichardt, B.: Reflections for quantum query algorithms. In: 22nd SODA, pp. 560–569 (2011)
Vassilevska Williams, V., Williams, R.: Subcubic equivalences between path, matrix, and triangle problems. In: 51st FOCS, pp. 645–654 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Childs, A.M., Kimmel, S., Kothari, R. (2012). The Quantum Query Complexity of Read-Many Formulas. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)