As interest in quantum computing evolves, consideration must be given to the development of new methods to improve the current design of quantum computers. Such ideas are not only helping the advance towards practical quantum computation applications, but are also providing clearer understanding of quantum computation itself. Eventually, several new exploratory efforts to increase the efficiency beyond the inherent advantage of quantum computational systems to classical systems will materialize. As a part of these exploration efforts, this paper presents a modified version of the qubit, which we refer to as a "Qubit", that allows a smaller number of Qubits than qubits to reach the same result in applications such as Shor’s algorithm for the factorization of large numbers. The current model of the qubit consists of a quantum bit with two states, a zero and a one in a quantum superposition state. The Qubit, which consists of more than two states, is introduced and explained. A mathematical analysis of the Qubit within Hilbert space is given. We present examples of applications of the Qubit to several quantum computing algorithms, including discussion of the advantages and disadvantages that are involved. Finally a physical model to construct such a Qubit is considered.