Ordered search is the problem of locating a target element in a sorted list of size $n$ using comparison queries. Classically, binary search requires $\lceil \log_2 n\rceil$ queries, which is optimal. Quantum algorithms offer a constant-factor speedup, but the precise constant has been a longstanding open question. We...
In the quantum state distinguishing problem, an algorithm is given copies of a state $|\psi\rangle$ or $|\phi\rangle$ separated by trace distance $\varepsilon$, and tasked with deciding which is the case. It is a standard result that $\Theta(\varepsilon^{-2})$ copies are required, while having access to a unitary state...
Emma Wang, Joseph Carolan, Andrew M. Childs· 0 citations
Pseudorandom permutations are ubiquitous in theoretical and applied cryptography. PRPs that offer security even against adversaries making quantum queries are of increasing interest, and used in applications ranging from constructing pseudorandom unitaries to separating SZK from BQP. A successful framework for construc...
G. Alagic, J. Carolan, Christian Majenz et al.· arXiv.org· 0 citations
The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $O(N^{1/12})$ queries to permutati...
J. Carolan, Christian Majenz· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.