3 citations · 3 across the 2 of their papers we have counts for
4 papers
Beyond the Threshold: Quantum Query Complexity for Computing Hamming Weight and Symmetric Functions
Yuan Deng, Zihan Hao, Honghao Lin +4
The oracle-interrogation algorithm [van Dam, FOCS '98] computes every -bit Boolean function with bounded error using quantum queries. In contrast, parity can be…
More is Less:Optimal Security for Haar Quantum Money and More
Zihan Hao, Xingjian Li, Qipeng Liu +1
Quantum cryptography leverages unclonability to enable a wide range of cryptographic applications that are impossible classically, such as digital currency protected against counte…
On the Need for (Quantum) Memory with Short Outputs
Zihan Hao, Zikuan Huang, Qipeng Liu
In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially lar…
Predicting Arbitrary State Properties from Single Hamiltonian Quench Dynamics
Zhenhuan Liu, Zihan Hao, Hong-Ye Hu
Analog quantum simulation is an essential routine for quantum computing and plays a crucial role in studying quantum many-body physics. Typically, the quantum evolution of an analo…