Before revision:  We conjecture that this result can be improved to ] T^2 S \geq \Omega(N^3), and we show that it would imply a T^2 S \geq (N^2) tradeoff for Element Distinctness ]  .
After revision:  We conjecture that this result can be improved to ] T^2 S = \Theta(K^2 N). Our result limits the extent to which quantum computing may decrease this tradeoff. We further show that any improvement to our lower bound would imply a T^2 S \geq (N^2) tradeoff for Element Distinctness ] .