Provide a rigorous mathematical analysis comparing the time complexity of Grover's Algorithm against unstructured classical search algorithms. Specifically, derive the probability amplitude amplification process for a database size of N=2^n. Discuss the implications of oracle construction in practical quantum computing scenarios and analyze the hardware requirements (qubit coherence time and gate fidelity) necessary to achieve a quadratic speedup for a problem size of one billion elements.