Postselected Quantum Query Complexity

• Postselected quantum query complexity is a model that enhances quantum algorithms by discarding undesired outcomes to achieve tight rational approximations of Boolean functions.
• It establishes an equivalence between the rational approximation degree and query complexity, offering insights into adaptive query limitations and oracle separations.
• Applications include optimal postselection algorithms for functions like MAJ, hardness amplification techniques, and demonstrating barriers to collapsing quantum adaptive complexity classes.

Postselected quantum query complexity investigates the power of quantum algorithms in the query (oracle) model when enhanced with the operation of postselection. Postselection refers to the ability to discard computational paths based on a chosen measurement outcome, retaining only those that yield a specific result. This operation fundamentally elevates the computational strength of quantum algorithms, corresponding to a transition from BQP to PP in the circuit model. In the query complexity setting, postselection is tightly linked to rational approximation of Boolean functions, enabling tight characterizations and establishing connections to core areas in quantum complexity theory, including hardness amplification and oracle separations.

1. Formal Definitions

A postselected quantum query algorithm for $f:\{0,1\}^n \to \{0,1\}$ with error $\epsilon\in[0,1/2)$ is a quantum query algorithm making $T$ queries, producing two output bits $a, b \in \{0,1\}$ so that for all $x$:

• $\Pr[a = 1] > 0$, and
• $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$.

The minimal $T$ for which such an $\epsilon$-error postselection algorithm for $f$ exists is $\epsilon\in[0,1/2)$0. In the adaptive query setting, the algorithm can submit queries that depend adaptively on previous answers.

Rational and polynomial approximations are central. For a Boolean $\epsilon\in[0,1/2)$1, the $\epsilon\in[0,1/2)$2-approximate rational degree $\epsilon\in[0,1/2)$3 is the minimal degree $\epsilon\in[0,1/2)$4 for which there exists a rational function $\epsilon\in[0,1/2)$5 of degree $\epsilon\in[0,1/2)$6 such that $\epsilon\in[0,1/2)$7 for all $\epsilon\in[0,1/2)$8 (Mahadev et al., 2014).

The one-sided low-weight approximate degree, $\epsilon\in[0,1/2)$9, minimizes the degree plus the logarithm of the sum of absolute values of coefficients, over polynomials $T$0 with $T$1 if $T$2 and $T$3 if $T$4 (Chen, 2016).

2. Characterization via Rational Approximation

Postselected quantum query complexity and rational approximation degree are equivalent up to constant factors. For every Boolean function $T$5 and $T$6: $T$7 This equivalence is established by constructing rational approximations from postselection algorithms (via polynomialization of measurement probabilities), and conversely, simulating rational approximations by quantum algorithms that use postselection (Mahadev et al., 2014).

In particular, for each $T$8 and $T$9,

• A postselection quantum query algorithm with $a, b \in \{0,1\}$0 queries yields a rational approximation of $a, b \in \{0,1\}$1 of degree at most $a, b \in \{0,1\}$2.
• A rational approximation of degree $a, b \in \{0,1\}$3 yields a quantum postselection algorithm making $a, b \in \{0,1\}$4 queries.

The one-sided low-weight approximate degree $a, b \in \{0,1\}$5 further characterizes the PP-analogue of postselected quantum query complexity in the oracle model (Chen, 2016).

3. Limits of Postselection for Adaptive Queries

Adaptive versions of Boolean functions, denoted $a, b \in \{0,1\}$6, recursively encode $a, b \in \{0,1\}$7 queries where each is adaptively chosen based on previous outputs, structured as a decision tree of depth $a, b \in \{0,1\}$8.

Main theorems demonstrate that postselection does not efficiently simulate adaptive quantum queries beyond logarithmic depth, assuming the original function $a, b \in \{0,1\}$9 requires super-polylogarithmic query complexity under bounded error:

• If $x$0 is hard for bounded-error quantum or classical query algorithms (i.e., requires $x$1 queries), then so is its adaptive version under postselection, e.g., $x$2 (Chen, 2016).
• Quantitatively, if $x$3, then $x$4.

This establishes a barrier: postselection does not collapse adaptive query complexity in the quantum (nor classical) case, a relativized counterpart to hierarchy separations in Turing machine complexity.

4. Hardness Amplification and Degree Lower Bounds

Postselected query complexity underpins explicit constructions amplifying polynomial hardness. For $x$5 with large one-sided approximate degree, a function $x$6 is constructed such that $x$7 requires high degree to approximate even at error $x$8 for $x$9: $\Pr[a = 1] > 0$0 For $\Pr[a = 1] > 0$1 inputs, this achieves hardness amplification comparable to other approaches, with only $\Pr[a = 1] > 0$2-depth adaptive composition (Chen, 2016).

This demonstrates the quantitative inadequacy of postselection in the face of amplified one-sided hardness: the adaptive function remains hard to approximate for postselection-based algorithms.

5. Oracle Separations and Complexity Implications

The limits of postselected quantum query complexity are leveraged to establish new oracle separations among complexity classes for adaptive queries:

• Taking $\Pr[a = 1] > 0$3 with $\Pr[a = 1] > 0$4 and $\Pr[a = 1] > 0$5, it follows $\Pr[a = 1] > 0$6, while $\Pr[a = 1] > 0$7. Thus, there exists an oracle $\Pr[a = 1] > 0$8 such that $\Pr[a = 1] > 0$9.
• For $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$0 the Permutation Testing Problem, analogous reasoning leads to $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$1.

These results show that adaptive queries can be fundamentally harder than postselection can efficiently resolve, even for quantum algorithms. This suggests limits to relativized collapses to $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$2 in complexity theory (Chen, 2016).

6. Optimality and Explicit Algorithms

An explicit, essentially optimal postselection quantum algorithm for the Majority function ($\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$3) is constructed: $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$4 This matches Sherstov's lower bounds on rational approximation degree up to constants and is achieved by polynomially many logarithmic rounds of "weight elimination" strategies, combining the power of quantum state preparation and postselection to filter Hamming weights (Mahadev et al., 2014).

Additionally, Newman’s theorem for rational approximation of $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$5 on $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$6 (with error $\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$7 for degree-$\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$8 rationals) is recovered from these constructions, illustrating how postselection quantum query models naturally yield classical results in approximation theory.

---

Summary table: Core Concepts and Correspondence

Concept	Formalization	Reference
Postselected quantum query complexity	$\Pr[b = f(x)\mid a = 1] \ge 1-\epsilon$9	(Mahadev et al., 2014, Chen, 2016)
Rational approximation degree	$T$0	(Mahadev et al., 2014)
One-sided low-weight approximate degree	$T$1	(Chen, 2016)
Adaptive function construction	$T$2	(Chen, 2016)
Oracle separation	$T$3, $T$4	(Chen, 2016)
MAJ postselection query complexity	$T$5	(Mahadev et al., 2014)

7. Connections and Outlook

Postselected quantum query complexity serves as a nexus linking quantum computing, complexity theory, and approximation theory. Its characterization by rational approximation situates query algorithms within the broader context of functional analysis. Limitations on adaptive simulation, proven via polynomial degree methods, inform both the power and inherent barriers of postselected computation models. Oracle separation results reaffirm the distinctiveness of adaptive computation beyond postselection, while explicit algorithmic constructions showcase the potential for transferring quantum techniques into classical approximation and hardness amplification.

Key results in (Mahadev et al., 2014) and (Chen, 2016) demonstrate both the breadth and the limitations of postselection as an algorithmic principle in the quantum query setting, establishing a foundation for future advances in quantum complexity and approximation theory.