The power of a quantum computer can far exceed that of a classical computer, at least in theory. This power derives from the characteristics of the "qubit," the quantum analog of the classical bit. Typical descriptions of the qubit are built on a detailed mathematical foundation in complex linear vector spaces. I will offer an accurate, but incomplete, description of the qubit in terms familiar to most programmers, regardless of mathematical background. Though incomplete, this approach is sufficient to illustrate the quadratic speed-up (versus classical) of Grover's search algorithm. This conveys a legitimate, basic appreciation of the nature of quantum computing.