111 citations · 280 across the 15 of their papers we have counts for
18 papers
Efficient Quantum State Identity Testing
Shih-Han Hung, Ming-Hsien Tsai
We study the following quantum state identity problem: given access to copies of unknown pure quantum states, the goal is to determine whether every pair has fidelity at least…
No Size-Preserving Amplification with Quantum Advice
Shih-Han Hung, Han-Hsuan Lin
Marriott and Watrous showed that quantum Merlin--Arthur games admit generic error reduction without increasing witness size [Computational Complexity, 2005]. In this work, we show…
Random Quantum Circuits Beyond Moment Matching
Shih-Han Hung
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which m…
Certified randomness amplification by dynamically probing remote random quantum states
Minzhao Liu, Pradeep Niroula, Matthew DeCross +49
Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into n…
Certified randomness using a trapped-ion quantum processor
Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29
While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a…
Certified Randomness from Quantum Supremacy
Scott Aaronson, Shih-Han Hung
We propose an application for near-term quantum devices: namely, generating cryptographically certified random bits, to use (for example) in proof-of-stake cryptocurrencies. Our pr…