Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.26678

Strong Selective and List-Decoding Direct Product Theorems for Quantum Query Complexity

Paul Beame, Niels Kornerup, Michael Whitmeyer

cs.CCquant-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 1 citation• Revised Sep 30, 2026 (v2)
v1 · Sep 22, 2026v2 · Sep 30, 2026
arXivHTMLPDF

Abstract

Quantum strong direct-product theorems for specific functions have been known for nearly two decades. These have been extended to general results for function computation and state generation. The proofs of these results use a version of the multiplicative adversary method that does not naturally extend to relations. Standard strong direct-product theorems apply when algorithms must correctly answer every given question. Prior work extended them to equivalent threshold direct-product theorems, which require answers to all questions but only require that most answers are correct. We focus on two further generalizations. Strong selective direct-products apply to algorithms that adaptively choose, based on what they learn from queries, which questions from a large list to answer. This generalization is relational and useful for proving time-space tradeoffs. We prove a quantum strong selective direct-product theorem for all functions using a relational formulation of the multiplicative adversary method by Jeffery and Zur which we prove, via an equivalent formulation, satisfies a strong selective direct product property and captures any query lower bound for functions proven by negative-weights adversaries. The second generalization is list-decoding direct product problems introduced by Ben-David and Blais for classical query complexity. These allow an algorithm to produce a large list of possible output vectors such that one of them is fully correct. They proved that such theorems hold for randomized complexity of all Boolean functions. We prove a quantum analogue of this theorem for all partial Boolean-valued functions. We show that strong list-decoding direct-product theorems are implied by a special case of multiplicative adversaries which we show, via a new reduction, can be obtained from negative-weights adversaries for any Boolean-valued function.

AI Summary

The paper asks whether quantum query strong direct-product theorems survive when an algorithm can choose which instances to answer, or output a list containing the correct answer vector. In the selective problem, it receives $m$ independent instances and must identify $k$ distinct instances together with correct outputs. In the list-decoding problem, it outputs at most $|Y|^{m-k}$ candidate vectors in $Y^m$. For every function $f$, including partial functions, the paper proves that selectively answering $k$ instances with success probability $\exp(-\Omega(k))$ requires $\Omega(kQ_{1/10}(f))$ queries, uniformly in $m\ge k$, for sufficiently large $k$. The analogous list-decoding theorem holds for every partial Boolean-valued function. Explicit bounds are also given for unique search, OR, and parity, with query scales $k\sqrt n$, $k\sqrt n$, and $kn$, respectively. An application gives a general quantum time-space lower bound $T=\Omega(n^{2.5}/S)$ and cumulative-memory lower bound $\Omega(n^{2.5})$ for matrix mapping. The proofs establish a selective tensor-product property for a relational multiplicative adversary method and convert negative-weight adversaries into matching multiplicative bounds, losing only constant factors. For Boolean outputs, a sharper conversion achieves the threshold parameter $\eta=1/2$ needed for list decoding. Fourth-moment bounds, proved through a hypercontractivity-style induction, control the probability captured by an output list without losses depending on $m/k$. The general list-decoding theorem for larger output alphabets remains open, as does an ordinary strong direct-product theorem for arbitrary relations. The paper also explains why these independent-input techniques do not directly remove output-oblivious restrictions from existing sorting and Boolean matrix-multiplication tradeoffs.

No sign of AI-generated textAI use disclosed
The idea of using 4-norms and the Cauchy-Schwarz inequality that is in the current argument is entirely the result of our interactions with ChatGPT 5.6.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
64 pages, 3 figures, submitted to QIP 2027

Related papers

A Strong Direct Product Theorem for Quantum Query Complexity

Troy Lee, Jérémie Roland

We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in $k$. For a boolean function $f$ we also show an XOR lemma -- computing the parity of $k$ copies of $f$ with less than $k$ times the queries needed for one copy implies that the advantage over random guessing will be exponentially small. We do this by showing that the multiplicative adversary method, which inherently satisfies a strong direct product theorem, characterizes bounded-error quantum query complexity. In particular, we show that the multiplicative adversary bound is always at least as large as the additive adversary bound, which is known to characterize bounded-error quantum query complexity.

arXiv:1104.4468•IEEE Conference on Computational Complexity (CCC)•Jun 1, 2012•22 citations

Direct Product Theorems for Randomized Query Complexity

Shalev Ben-David, Blais, Eric

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $γ^n$, requires $Θ(n)$ times the "maximum distributional" query complexity of $f$ with success parameter $γ$. This result holds for all success parameters $γ$, even when $γ$ is very close to $1/2$ or to $1$. As a result, it unifies and generalizes Drucker's direct product theorem (2012) for $γ$ bounded away from $\frac12$ and $1$ as well as the strong direct sum theorem of Blais and Brody (2019) for $γ\approx 1-1/n$. The second establishes a general "list decoding" direct product theorem that captures many different variants of partial computation tasks related to the function $f^n$ consisting of $n$ copies of $f$. Notably, our list decoding direct product theorem yields a new threshold direct product theorem and other new variants such as the labelled-threshold direct product theorem. Both of these direct product theorems are obtained by taking a new approach. Instead of directly analyzing the query complexity of algorithms, we introduce a new measure of complexity of functions that we call "discounted score". We show that this measure satisfies a number of useful structural properties, including tensorization, that make it particularly suitable for the study of direct product questions.

arXiv:2512.08268•Dec 9, 2025•0 citations

Distributional Quantum Query Complexity

Shalev Ben-David, M. H. Ebtehaj

Quantum query complexity enjoys a variety of pleasing joint computation properties: for example, a composition theorem asserting $Q(f\circ g)=Θ(Q(f)Q(g))$ for all Boolean functions $f$ and $g$; a direct sum theorem asserting that computing $k$ copies of a function (or search problem) costs $Ω(k)$ times as much as the cost of computing one copy; and a direct product theorem asserting that for Boolean functions, even succeeding at the direct sum problem with exponentially small probability still requires $Ω(k)$ times the cost of computing one copy to bounded error. However, all of these results are strictly for worst-case quantum query complexity. For example, if we have a fixed distribution $μ$ over inputs, the direct sum theorem says nothing about the quantum query complexity of computing $k$ copies of $f$ when the input comes from the product distribution $μ^k$ instead of being worst-case. (Note that while a standard Yao-type minimax theorem guarantees a hard distribution for the direct sum problem, there's no guarantee that this hard distribution is a product distribution.) A similar problem occurs for the direct product theorem and the composition theorem: none of these results respect distributions. In this work, we give distributional joint computation lower bounds for the composition, direct sum, and direct product problems. Along the way, we introduce some new tools for handling quantum query lower bounds, including (a) a new ``multiplicative'' variant of the $γ_2$ norm (which we use in place of the multiplicative adversary method for proving the direct product theorem), and (b) a new ``Shaltiel-free'' measure of quantum query complexity, which we show characterizes the composition behavior of distributional quantum query complexity and satisfies pleasing properties.

quant-pharXiv:2610.06835•Oct 6, 2026•0 citations

Direct Product Theorems for Randomized Query Complexity

Shalev Ben-David, Eric Blais

We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing n copies of a function f, even with a small success probability of $\gamma^{n}$, requires $\Theta(n)$ times the maximum distributional query complexity of f with success parameter $\gamma$. This result holds for all success parameters $\gamma$, even when $\gamma$ is very close to 1/2 or to 1. As a result, it unifies and generalizes Drucker’s direct product theorem (2012) for $\gamma$ bounded away from $\frac{1}{2}$ and 1 as well as the strong direct sum theorem of Blais and Brody (2019) for $\gamma \approx 1-1 / n$. The second establishes a general list decoding direct product theorem that captures many different variants of “partial computation” tasks related to the function $f^{n}$ consisting of n copies of f. Notably, our list decoding direct product theorem yields a new threshold direct product theorem and other new variants such as the labelled-threshold direct product theorem. Both of these direct product theorems are obtained by taking a new approach. Instead of directly analyzing the query complexity of algorithms, we introduce a new measure of complexity of functions that we call discounted score. We show that this measure satisfies a number of useful structural properties, including tensorization, that make it particularly suitable for the study of direct product questions.

Annual Symposium on Foundations of Computer Science•Dec 14, 2025•1 citation

A new quantum lower bound method,: with applications to direct product theorems and time-space tradeoffs

Andris Ambainis, Robert Špalek, Ronald de Wolf

We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct product theorem for 2-sided error quantum algorithms computing k independent instances of a symmetric Boolean function: if the algorithm uses significantly less than k times the number of queries needed for one instance of the function, then its success probability is exponentially small in k. We also use the polynomial method to prove a direct product theorem for 1-sided error algorithms for k threshold functions with a stronger bound on the success probability. Finally, we present a quantum algorithm for evaluating solutions to systems of linear inequalities, and use our direct product theorems to show that the time-space tradeoff of this algorithm is close to optimal.

ACM Symposium on Theory of Computing (STOC)•May 21, 2006•12 citations

Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs

Hartmut Klauck, Robert Špalek, Ronald de Wolf

A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability is exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total functions. We prove a similar result for quantum communication protocols computing k instances of the disjointness function. These results imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors. They also give several tight time-space and communication-space tradeoffs for the problems of Boolean matrix-vector multiplication and matrix multiplication.

arXiv:quant-ph/0402123•Annual Symposium on Foundations of Computer Science•Dec 23, 2004•57 citations
Quantum strong direct-product theorems for specific functions have been known for nearly two decades. These have been extended to general results for function computation and state generation. The proofs of these results use a version of the multiplicative adversary method that does not naturally extend to relations. Standard strong direct-product theorems apply when algorithms must correctly answer every given question. Prior work extended them to equivalent threshold direct-product theorems, which require answers to all questions but only require that most answers are correct.
We focus on two further generalizations. Strong selective direct-products apply to algorithms that adaptively choose, based on what they learn from queries, which questions from a large list to answer. This generalization is relational and useful for proving time-space tradeoffs. We prove a quantum strong selective direct-product theorem for all functions using a relational formulation of the multiplicative adversary method by Jeffery and Zur which we prove, via an equivalent formulation, satisfies a strong selective direct product property and captures any query lower bound for functions proven by negative-weights adversaries.
The second generalization is list-decoding direct product problems introduced by Ben-David and Blais for classical query complexity. These allow an algorithm to produce a large list of possible output vectors such that one of them is fully correct. They proved that such theorems hold for randomized complexity of all Boolean functions. We prove a quantum analogue of this theorem for all partial Boolean-valued functions. We show that strong list-decoding direct-product theorems are implied by a special case of multiplicative adversaries which we show, via a new reduction, can be obtained from negative-weights adversaries for any Boolean-valued function.
The paper asks whether quantum query strong direct-product theorems survive when an algorithm can choose which instances to answer, or output a list containing the correct answer vector. In the selective problem, it receives mmm independent instances and must identify kkk distinct instances together with correct outputs. In the list-decoding problem, it outputs at most ∣Y∣m−k|Y|^{m-k}∣Y∣m−k candidate vectors in YmY^mYm.
For every function fff, including partial functions, the paper proves that selectively answering kkk instances with success probability exp⁡(−Ω(k))\exp(-\Omega(k))exp(−Ω(k)) requires Ω(kQ1/10(f))\Omega(kQ_{1/10}(f))Ω(kQ1/10​(f)) queries, uniformly in m≥km\ge km≥k, for sufficiently large kkk. The analogous list-decoding theorem holds for every partial Boolean-valued function. Explicit bounds are also given for unique search, OR, and parity, with query scales knk\sqrt nkn​, knk\sqrt nkn​, and knknkn, respectively. An application gives a general quantum time-space lower bound T=Ω(n2.5/S)T=\Omega(n^{2.5}/S)T=Ω(n2.5/S) and cumulative-memory lower bound Ω(n2.5)\Omega(n^{2.5})Ω(n2.5) for matrix mapping.
The proofs establish a selective tensor-product property for a relational multiplicative adversary method and convert negative-weight adversaries into matching multiplicative bounds, losing only constant factors. For Boolean outputs, a sharper conversion achieves the threshold parameter η=1/2\eta=1/2η=1/2 needed for list decoding. Fourth-moment bounds, proved through a hypercontractivity-style induction, control the probability captured by an output list without losses depending on m/km/km/k.
The general list-decoding theorem for larger output alphabets remains open, as does an ordinary strong direct-product theorem for arbitrary relations. The paper also explains why these independent-input techniques do not directly remove output-oblivious restrictions from existing sorting and Boolean matrix-multiplication tradeoffs.
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing kkk copies of a function with less than kkk times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in kkk. For a boolean function fff we also show an XOR lemma -- computing the parity of kkk copies of fff with less than kkk times the queries needed for one copy implies that the advantage over random guessing will be exponentially small. We do this by showing that the multiplicative adversary method, which inherently satisfies a strong direct product theorem, characterizes bounded-error quantum query complexity. In particular, we show that the multiplicative adversary bound is always at least as large as the additive adversary bound, which is known to characterize bounded-error quantum query complexity.
We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing nnn copies of a function fff, even with a small success probability of γnγ^nγn, requires Θ(n)Θ(n)Θ(n) times the "maximum distributional" query complexity of fff with success parameter γγγ. This result holds for all success parameters γγγ, even when γγγ is very close to 1/21/21/2 or to 111. As a result, it unifies and generalizes Drucker's direct product theorem (2012) for γγγ bounded away from 12\frac1221​ and 111 as well as the strong direct sum theorem of Blais and Brody (2019) for γ≈1−1/nγ\approx 1-1/nγ≈1−1/n. The second establishes a general "list decoding" direct product theorem that captures many different variants of partial computation tasks related to the function fnf^nfn consisting of nnn copies of fff. Notably, our list decoding direct product theorem yields a new threshold direct product theorem and other new variants such as the labelled-threshold direct product theorem. Both of these direct product theorems are obtained by taking a new approach. Instead of directly analyzing the query complexity of algorithms, we introduce a new measure of complexity of functions that we call "discounted score". We show that this measure satisfies a number of useful structural properties, including tensorization, that make it particularly suitable for the study of direct product questions.
Quantum query complexity enjoys a variety of pleasing joint computation properties: for example, a composition theorem asserting Q(f∘g)=Θ(Q(f)Q(g))Q(f\circ g)=Θ(Q(f)Q(g))Q(f∘g)=Θ(Q(f)Q(g)) for all Boolean functions fff and ggg; a direct sum theorem asserting that computing kkk copies of a function (or search problem) costs Ω(k)Ω(k)Ω(k) times as much as the cost of computing one copy; and a direct product theorem asserting that for Boolean functions, even succeeding at the direct sum problem with exponentially small probability still requires Ω(k)Ω(k)Ω(k) times the cost of computing one copy to bounded error. However, all of these results are strictly for worst-case quantum query complexity. For example, if we have a fixed distribution μμμ over inputs, the direct sum theorem says nothing about the quantum query complexity of computing kkk copies of fff when the input comes from the product distribution μkμ^kμk instead of being worst-case. (Note that while a standard Yao-type minimax theorem guarantees a hard distribution for the direct sum problem, there's no guarantee that this hard distribution is a product distribution.) A similar problem occurs for the direct product theorem and the composition theorem: none of these results respect distributions. In this work, we give distributional joint computation lower bounds for the composition, direct sum, and direct product problems. Along the way, we introduce some new tools for handling quantum query lower bounds, including (a) a new ``multiplicative'' variant of the γ2γ_2γ2​ norm (which we use in place of the multiplicative adversary method for proving the direct product theorem), and (b) a new ``Shaltiel-free'' measure of quantum query complexity, which we show characterizes the composition behavior of distributional quantum query complexity and satisfies pleasing properties.
We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing n copies of a function f, even with a small success probability of γn\gamma^{n}γn, requires Θ(n)\Theta(n)Θ(n) times the maximum distributional query complexity of f with success parameter γ\gammaγ. This result holds for all success parameters γ\gammaγ, even when γ\gammaγ is very close to 1/2 or to 1. As a result, it unifies and generalizes Drucker’s direct product theorem (2012) for γ\gammaγ bounded away from 12\frac{1}{2}21​ and 1 as well as the strong direct sum theorem of Blais and Brody (2019) for γ≈1−1/n\gamma \approx 1-1 / nγ≈1−1/n. The second establishes a general list decoding direct product theorem that captures many different variants of “partial computation” tasks related to the function fnf^{n}fn consisting of n copies of f. Notably, our list decoding direct product theorem yields a new threshold direct product theorem and other new variants such as the labelled-threshold direct product theorem. Both of these direct product theorems are obtained by taking a new approach. Instead of directly analyzing the query complexity of algorithms, we introduce a new measure of complexity of functions that we call discounted score. We show that this measure satisfies a number of useful structural properties, including tensorization, that make it particularly suitable for the study of direct product questions.
We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct product theorem for 2-sided error quantum algorithms computing k independent instances of a symmetric Boolean function: if the algorithm uses significantly less than k times the number of queries needed for one instance of the function, then its success probability is exponentially small in k. We also use the polynomial method to prove a direct product theorem for 1-sided error algorithms for k threshold functions with a stronger bound on the success probability. Finally, we present a quantum algorithm for evaluating solutions to systems of linear inequalities, and use our direct product theorems to show that the time-space tradeoff of this algorithm is close to optimal.
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability is exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total functions. We prove a similar result for quantum communication protocols computing k instances of the disjointness function. These results imply a time-space tradeoff T/sup 2/S = /spl Omega/(N/sup 3/) for sorting N items on a quantum computer, which is optimal up to polylog factors. They also give several tight time-space and communication-space tradeoffs for the problems of Boolean matrix-vector multiplication and matrix multiplication.