The oracle-interrogation algorithm [van Dam, FOCS'98] computes every $n$-bit Boolean function with bounded error using $n/2+O(\sqrt n)$ quantum queries. In contrast, parity can be computed exactly using $\lceil n/2\rceil$ queries, but whether an additive overhead beyond $n/2$ is necessary for a single Boolean output ha...
Yuan Deng, Zi-Han Hao, Hong-Hao Lin et al.· 0 citations
A construction of quantum money whose asymptotic query security does not deteriorate as long as the number of banknotes available to a user remains below the scale required for state tomography.
Zi-Han Hao, Xing-Jian Li, Qi-Peng Liu et al.· 0 citations
This work introduces an operator-norm approach for non-uniform security in the quantum random oracle and random permutation models, and proves an optimal generic salting theorem for decision games.
Minki Hhan, Sunghyuk Jo, Qi-Peng Liu· arXiv.org· 0 citations
The simulation theorem is established by proving the stronger statement that parallel-query quantum algorithms cannot distinguish the uniform distribution over oracles from oracles drawn from so-called dense distributions, and a coupling theorem is a coupling theorem that relates the uniform distribution over oracles t...
Qi-Peng Liu, Saachi Mutreja· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.