One Weird Trick Tightens the Quantum Adversary Bound, Especially for Success Probability Close to 1/2

03/17/2023
by   Duyal Yolcu, et al.
0

The textbook adversary bound for function evaluation states that to evaluate a function f D→ C with success probability 1/2+δ in the quantum query model, one needs at least ( 2δ -√(1-4δ^2)) Adv(f) queries, where Adv(f) is the optimal value of a certain optimization problem. For δ≪ 1, this only allows for a bound of Θ(δ^2 Adv(f)) even after a repetition-and-majority-voting argument. In contrast, the polynomial method can sometimes prove a bound that doesn't converge to 0 as δ→ 0. We improve the δ-dependent prefactor and achieve a bound of 2δ Adv(f). The proof idea is to "turn the output condition into an input condition": From an algorithm that transforms perfectly input-independent initial to imperfectly distinguishable final states, we construct one that transforms imperfectly input-independent initial to perfectly distinguishable final states in the same number of queries by projecting onto the "correct" final subspaces and uncomputing. The resulting δ-dependent condition on initial Gram matrices, compared to the original algorithm's condition on final Gram matrices, allows deriving the tightened prefactor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2018

Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis

In this paper, we give quantum algorithms for two fundamental computatio...
research
11/29/2022

The Adversary Bound Revisited: From Optimal Query Algorithms to Optimal Control

This note complements the paper "One-Way Ticket to Las Vegas and the Qua...
research
02/10/2019

Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge

We define a new query measure we call quantum distinguishing complexity,...
research
06/02/2023

Efficient Quantum State Synthesis with One Query

We present a polynomial-time quantum algorithm making a single query (in...
research
02/19/2019

A Tight Lower Bound for Index Erasure

The Index Erasure problem asks a quantum computer to prepare a uniform s...
research
09/12/2019

Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm

We demonstrate that with an optimally tuned scheduling function, adiabat...
research
11/15/2022

A Probabilistic Proof of the nCPA to CCA Bound

We provide a new proof of Maurer, Renard, and Pietzak's bound of the CCA...

Please sign up or login with your details

Forgot password? Click here to reset