Weak quantum sabotage complexity
Quantum queries to distinguish stars from daggers in a sabotaged input, without access to its completions.
also written:
QS, quantum sabotage complexity, weak decision sabotage
Definition
For $f:D\subseteq\{0,1\}^n\to\{0,1\}$, choose $x\in f^{-1}(0)$ and $y\in f^{-1}(1)$. The sabotaged string $z$ agrees with $x_i=y_i$ at common coordinates and replaces every differing coordinate by the same symbol $b\in\{\ast,\dagger\}$. A query returns $z_i$ only. $\mathrm{QS}_{\mathrm{weak}}(f)$ is the bounded-error quantum query cost of determining $b$, with error at most $1/3$. The completions $x,y$ are hidden; this distinguishes it from \(\mathrm{QS}_{\mathrm{str}}(f)\).
Basic facts
- All four sabotage variants are $O(\sqrt n)$ by Grover search [CMP24].
- $\mathrm{QC}=O(\mathrm{QS}_{\mathrm{weak}})$, even for partial functions [KLLPV26, proof of Theorem 4].
- On \(\mathrm{ADDR}_k\), all four variants are $\Theta(n)$, while $\mathrm{fbs}=n+1$; the square-root fractional-block-sensitivity floor is not always tight [CMP24].
- Its certification transform equals $\Theta(\mathrm{QC})$, as do those of the other three variants [KLLPV26, Theorem 4].
Relations to other measures
A row shows what the zoo knows about the two ordered pairs involving \(\mathrm{QS}_{\mathrm{weak}}(f)\). “\(\mathrm{QS}_{\mathrm{weak}}(f)\) in terms of it” is the pair with \(\mathrm{QS}_{\mathrm{weak}}(f)\) on the left (the matrix row); the other column is the reverse. Each cell gives, per setting, the exponent range a,b of the best bounds known — \(\mathrm{M_1} = \Omega(\mathrm{M_2}^{a})\) below and \(\mathrm{M_1} = O(\mathrm{M_2}^{b})\) above, so \(a = b\) means settled — or a glyph where no polynomial bound exists at all. These are derived, not just read off the exponent table, so they are present for pairs the table does not cover. A cell with no entry for a setting is one where the zoo has nothing at that setting, and a — one where the ordered pair is empty in all three; derived marks a direction with no hand-written relation record behind it, which is the common case and not a hole.
The 6 above are this entry’s hand-picked neighbours; the other 87 are everything else in the zoo, by category.
Known values
| Function | Value | Notes |
|---|---|---|
| OR total | \(\Theta(\sqrt n)\) | CMP24 Section 1.1: the common √fbs lower bound and Grover √n ceiling meet. CMP24 |
| AND total | \(\Theta(\sqrt n)\) | CMP24 Section 1.1: the common √fbs lower bound and Grover √n ceiling meet. CMP24 |
| PARITY total | \(\Theta(\sqrt n)\) | CMP24 Section 1.1: the common √fbs lower bound and Grover √n ceiling meet. CMP24 |
| MAJORITY total | \(\Theta(\sqrt n)\) | CMP24 Section 1.1: the common √fbs lower bound and Grover √n ceiling meet. CMP24 |
| ADDRESS / multiplexer total | \(\Theta(k)\) | CMP24 Theorem 5.3 and Appendix B: all four sabotage variants equal Θ(k). The paper’s parameter n is the address length k used here. CMP24 |