arXiv 1102.46992011-02-23cs.CC

The influence lower bound via query elimination

Rahul Jain, Shengyu Zhang

备注：: 5 pages

英文摘要：

We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any variable of f. Our lower bound also applies to the two-sided error distributional query complexity of f, and it allows an immediate extension which can be used to prove stronger lower bounds for some functions.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A case study of the difficulty of quantifier elimination in constraint databases: the alibi query in moving object databases

In the constraint database model, spatial and spatio-temporal data are stored by boolean combinations of polynomial equalities and inequalities over the real numbers. The relational calculus augmented with polynomial constraints is the standard first-order query language for constraint databases. Although the expressive power of this query language has been studied extensively, the difficulty of the efficient evaluation of queries, usually involving some form of quantifier elimination, has received considerably less attention. The inefficiency of existing quantifier-elimination software and th…

2007-12-12cs.CCcs.DBcs.LO

The Complexity of Iterated Strategy Elimination

We consider the computational complexity of the question whether a certain strategy can be removed from a game by means of iterated elimination of dominated strategies. In particular, we study the influence of different definitions of domination and of the number of different payoff values. In addition, the consequence of restriction to constant-sum games is shown.

2010-01-20cs.CCcs.GT

Lower bounds for predecessor searching in the cell probe model

We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form "What is the predecessor of x in S?" can be answered efficiently. We study this problem in the cell probe model introduced by Yao. Recently, Beame and Fich obtained optimal bounds on the number of probes needed by any deterministic query scheme if the associated storage scheme uses only n^{O(1)} cells of word size (\log m)^{O(1)} bits. We give a new lower bound proof for this problem that matches the bounds of Beame and Fich. …

2003-09-17cs.CCcs.DSquant-ph

Lower bounds in the quantum cell probe model

We introduce a new model for studying quantum data structure problems -- the "quantum cell probe model". We prove a lower bound for the static predecessor problem in the address-only version of this model where we allow quantum parallelism only over the `address lines' of the queries. The address-only quantum cell probe model subsumes the classical cell probe model, and many quantum query algorithms like Grover's algorithm fall into this framework. Our lower bound improves the previous known lower bound for the predecessor problem in the classical cell probe model with randomised query schemes…

2001-10-16cs.CCquant-ph

Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms

The Aaronson-Ambainis conjecture (Theory of Computing '14) says that every low-degree bounded polynomial on the Boolean hypercube has an influential variable. This conjecture, if true, would imply that the acceptance probability of every $d$-query quantum algorithm can be well-approximated almost everywhere (i.e., on almost all inputs) by a $\mathrm{poly}(d)$-query classical algorithm. We prove a special case of the conjecture: in every completely bounded degree-$d$ block-multilinear form with constant variance, there always exists a variable with influence at least $1/\mathrm{poly}(d)$. In a …

2022-03-01cs.CCmath.FAquant-ph

On the sum of $L1$ influences

For a function $f$ over the discrete cube, the total $L_1$ influence of $f$ is defined as $\sum_{i=1}^n \|\partial_i f\|_1$, where $\partial_i f$ denotes the discrete derivative of $f$ in the direction $i$. In this work, we show that the total $L_1$ influence of a $[-1,1]$-valued function $f$ can be upper bounded by a polynomial in the degree of $f$, resolving affirmatively an open problem of Aaronson and Ambainis (ITCS 2011). The main challenge here is that the $L_1$ influences do not admit an easy Fourier analytic representation. In our proof, we overcome this problem by introducing a new an…

2014-04-13cs.CC

更多相关论文收起更多论文

Fourier 完全有界多项式的影响与量子算法的经典模拟

Influences of Fourier Completely Bounded Polynomials and Classical Simulation of Quantum Algorithms

本文提出用 Fourier 完全有界多项式刻画量子查询算法，并猜想此类多项式均存在有影响力的变量；同时证明了齐次情形下的 Aaronson-Ambainis 猜想，为量子算法的经典模拟提供了新依据。

2023-06-28cs.CCmath.FAquant-ph

高影响力函数、连通性和阈值的噪声计算紧界

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold

本文针对噪声查询模型中若干基础问题得出紧界：总影响力为Ω(n)的布尔函数噪声查询复杂度为Θ(nlogn)；图连通性为Θ(n²logn)；还确定了k-阈值与计数问题的精确查询数界，填补了相关空白。

2025-02-13cs.CCcs.DScs.IT

Query strategies for priced information, revisited

We consider the problem of designing query strategies for priced information, introduced by Charikar et al. In this problem the algorithm designer is given a function $f : \{0,1\}^n \to \{-1,1\}$ and a price associated with each of the $n$ coordinates. The goal is to design a query strategy for determining $f$'s value on unknown inputs for minimum cost. Prior works on this problem have focused on specific classes of functions. We analyze a simple and natural strategy that applies to all functions $f$, and show that its performance relative to the optimal strategy can be expressed in terms of a…

2020-10-22cs.CCcs.DS

完全有界多项式的最优不等式及量子查询算法的局限性

Optimal inequalities for completely bounded polynomials and the limitations of quantum query algorithms

Quriosity, Inria, France（库里奥西蒂，法国国家信息与自动化研究所）；Centre de Recerca Matemàtica, Spain（加泰罗尼亚数学研究中心）；Universidad Complutense de Madrid, Spain（马德里康普顿斯大学）

该研究通过完全有界多项式方法证明了块多重线性多项式和量子查询算法最高层傅里叶增长的最优不等式，导出了更优的量子查询算法极限定理，部分解决了Girish的问题。

2026-09-07cs.CCmath.FAquant-ph

布尔函数噪声查询复杂度的统一下界

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

针对噪声查询模型，基于布尔超立方体子图的度统计，提出了布尔函数噪声查询复杂度的通用下界，统一并改进了现有结果，并解决了Gu、Li和Xu提出的开放问题。

2026-06-11cs.CCcs.DScs.IT