We give a natural problem over input quantum oracles U which cannot be solved with exponentially many black-box queries to U and U^†, but which can be solved with constant many queries to U and U^*, or U and U^T. We also demonstrate a quantum commitment scheme that is secure against adversaries that query only U and U^†, but is insecure if the adversary can query U^*. These results show that conjugate and transpose queries do give more power to quantum algorithms, lending credence to the idea put forth by Zhandry that cryptographic primitives should prove security against these forms of queries. Our key lemma is that any circuit using q forward and inverse queries to a state preparation unitary for a state σ can be simulated to ε error with n = 𝒪(q^2/ε) copies of σ. Consequently, for decision tasks, algorithms using (forward and inverse) state preparation queries only ever perform quadratically better than sample access. These results follow from straightforward combinations of existing techniques; our contribution is to state their consequences in their strongest, most counter-intuitive form. In doing so, we identify a motif where generically strengthening a quantum resource can be possible if the output is allowed to be random, bypassing no-go theorems for deterministic algorithms. We call this the acorn trick.
原文链接
分享
引用
