Quantum automata differ from traditional finite automata by potentially having multiple start states, or more accurately, a superposition of start states. This characteristic raises questions about their practical application in physical computing, particularly regarding the challenges of preparing specific start states for quantum computers. The discussion touches on the relationship between finite automata and Turing machines, noting that while finite automata alone do not equate to physical computers, Turing machines serve as a mathematical model for computation. Quantum computers, leveraging quantum bits (qubits), promise significant reductions in computational time, especially for tasks like cryptography. The conversation also references the famous thought experiment of Schrödinger's cat, illustrating the complexities of quantum states, though some participants express confusion over its implications in real-world scenarios. Overall, the dialogue emphasizes the theoretical underpinnings of quantum computation and its potential advantages over classical computing models.