More is Less:Optimal Security for Haar Quantum Money and More
The paper investigates quantum money based on an n-qubit Haar-random state and a reflection oracle to achieve optimal query security against counterfeiting. It proves that holding fewer than $\Omega(2n)$ banknotes prevents an adversary from asymptotically speeding up counterfeiting, meaning existing notes cannot be used to significantly improve their attack capabilities.