3 citations · 10 across the 11 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
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…
quant-ph2023
Quantum Logspace Computations are Verifiable
Uma Girish, Ran Raz, Wei Zhan
In this note, we observe that quantum logspace computations are verifiable by classical logspace algorithms, with unconditional security. More precisely, every language in BQL has…
quant-ph2023
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory
Qipeng Liu, Ran Raz, Wei Zhan
In a work by Raz (J. ACM and FOCS 16), it was proved that any algorithm for parity learning on bits requires either bits of classical memory or an exponential number (…