Time-space lower bounds for breaking quantum cryptography
We prove near-optimal time-space lower bounds for breaking quantum cryptography in the random oracle model. Specifically, we show that a $T$-query adversary with $S$ qubits of non-uniform advice can recover a random key $k$ from the $n$-qubit binary phase state $|\psi_k\rangle \propto \sum_{x} R(k,x) |x\rangle$ with pr...