Advertisement

International Journal of Theoretical Physics

, Volume 34, Issue 8, pp 1813–1821 | Cite as

Logic programming as quantum measurement

  • Roman R. Zapatrin
Article

Abstract

We juxtapose (quantum theorem) proving versus quantum (theorem proving). The logical content of verification of statements concerning quantum systems is outlined. The Zittereingang (trembling input) principle is introduced to enhance the resolution of the predicate satisfiability problem provided the processor is in a position to perform operations with continuous input. A realization of a Zittereingang machine by a quantum system is suggested.

Keywords

Field Theory Elementary Particle Quantum Field Theory Quantum System Logic Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bennett, C. H. (1993). Quantum computers: Certainty from uncertainty,Nature,362, 694.Google Scholar
  2. Deutsch, D. (1989). Quantum computational networks,Proceedings of the Royal Society A,425, 73.Google Scholar
  3. Deutsch, D., and Jozsa, R. (1992). Rapid solution of problems by quantum computation,Proceedings of the Royal Society of London A,439, 553.Google Scholar
  4. Gabbay, D. (n.d.)(LDS-Labelled Deductive Systems, Oxford University Press, Oxford.Google Scholar
  5. Grib, A. A., and Zapatrin, R. R. (1990). Automata simulating quantum logics,International Journal of Theoretical Physics,29, 113.Google Scholar

Copyright information

© Plenum Publishing Corporation 1995

Authors and Affiliations

  • Roman R. Zapatrin
    • 1
  1. 1.Friedmann Laboratory for Theoretical PhysicsSPb UEFSt. PetersburgRussia

Personalised recommendations