How does quantum computing challenge the foundational principles of classical computer science?

Quantum computing is emerging as a revolutionary paradigm, fundamentally different from classical computing's binary approach. While classical computers rely on bits, quantum computers use qubits, which can exist in multiple states simultaneously due to superposition and entanglement. This potential allows quantum computers to solve certain problems exponentially faster than classical computers. How do these differences challenge the established theories and practices in computer science, particularly in areas such as algorithms, data structures, and computational complexity? What implications does this have for future developments in computational theories and technologies?