4 papers · 1 filter
Small-Bias Quantum Approximate Counting via the Multiplicative Adversary Method
Albert Lin, Han-Hsuan Lin
We study the two-weight decision version of quantum approximate counting: given oracle access to , distinguish from with success probability $1/2+ζ…
Efficient learning of -doped stabilizer states with single-copy measurements
Nai-Hui Chia, Ching-Yi Lai, Han-Hsuan Lin
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier i…
Constant-round Blind Classical Verification of Quantum Sampling
Kai-Min Chung, Yi Lee, Han-Hsuan Lin +1
In a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untr…
On the Quantum Complexity of Closest Pair and Related Problems
Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin +2
The closest pair problem is a fundamental problem of computational geometry: given a set of points in a -dimensional space, find a pair with the smallest distance. A classic…