QUANTUM FIELD THEORY AND COMPUTATIONAL PARADIGMS

E. V. Krishnamurthy () and Vikram Krishnamurthy ()
Additional contact information
E. V. Krishnamurthy: Computer Sciences Laboratory, Australian National University, Canberra, ACT 0200, Australia
Vikram Krishnamurthy: Department of Electrical Engineering, University of Melbourne, Victoria 3010, Australia

International Journal of Modern Physics C (IJMPC), 2001, vol. 12, issue 08, 1179-1205

Abstract: We introduce the basic theory of quantization of radiation field in quantum physics and explain how it relates to the theory of recursive functions in computer science. We outline the basic differences between quantum mechanics (QM) and quantum field theory (QFT) and explain why QFT is better suited for a computational paradigm — based on algorithmic requirement, countably infinite degrees of freedom and the creation of macroscopic output objects. The quanta of the radiation field correspond to the non-negative integers and the harmonic oscillator spectra correspond to the recursive computation — with the creation and annihilation operators, respectively, playing the same role as the successor and predecessor in computability theory. Accordingly, this approach relates the classical computational model and the quantum physical model more directly than the Turing machine approach used earlier. Also, the application of Lambda calculus formalism and the associated denotational semantics (that is widely used in the classical computational paradigm involving recursive functions) for applications to computational paradigm based on quantum field theory is described. Finally, we explain where QFT and conventional paradigm depart from each other, and examine the concept of fixed points, phase transitions, programmability, emergent computation and related open problems.

Keywords: Annihilation–Creation; Bosonic Counter; Conrad's Principle; Denotational Semantics; Emergent Computation; Fermionic Switch; Fixed Points; Harmonic Oscillator; Lambda Calculus; Multiset Rule-Based Paradigm; Nonprogrammability; Occupation Numbers; Phase Transitions; Predecessor–Successor; Recursive Function (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183101002437
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:12:y:2001:i:08:n:s0129183101002437

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183101002437

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().