Bivalent or two-valued logic is presently the foundation of logic in mathematics and computer science, and a cornerstone of software development. To address a number of classical logical paradoxes, such as Russell’s, multi-valued logic, such as balanced ternary logic has shown to be useful. Current methods lead however to information loss. Thus, to theoretically improve the robustness of bivalent logic, this paper proposes the use of quantum states, followed by an example, where the proposed method is shown to be successful in the solution of a problem that is not directly solvable using contemporary methods.