Besides their use for efficient computation, quantum computers and quantum robots form a base for studying quantum systems that create valid physical theories using mathematics and physics. If quantum mechanics is universally applicable, then quantum mechanics must describe its own validation by these quantum systems. An essential part of this process is the development of a coherent theory of mathematics and quantum-mechanics together. It is expected that such a theory will include a coherent combination of mathematical logical concepts with quantum mechanics. That this might be possible is shown here by defining truth, validity, consistency, and completeness for a quantum-mechanical version of a simple (classical) expression enumeration machine described by Smullyan. Some of the expressions are chosen as sentences denoting the presence or absence of other expressions in the enumeration. Two of the sentences are self-referential. It is seen that, for an interpretation based on a Feynman path sum over expression paths, truth, consistency, and completeness for the quantum system have different properties than for the classical system. For instance, the truth of a sentence S is defined only on those paths containing S. It is undefined elsewhere. Also S and its negation can both be true provided they appear on separate paths. This satisfies the definition of consistency. The definitions of validity and completeness connect the dynamics of the system to the truth of the sentences. It is proved that validity implies consistency. It is seen that the requirements of validity and maximal completeness strongly restrict the allowable dynamics for the quantum system. Aspects of the existence of a valid, maximally complete dynamics are discussed. An exponentially efficient quantum computer is described that is also valid and complete for the set of sentences considered here.
- Received 19 November 1998
- Published in the issue dated June 1999
© 1999 The American Physical Society