Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Applied Sciences

Quantum Field Theory Representation in Quantum Computation

Nicolas Francisco Lori, José Neves, Jose Manuel Machado

Published Nov 28, 2021• 3 citations
Publisher

Abstract

Recently, from the deduction of the result MIP* = RE in quantum computation, it was obtained that Quantum Field Theory (QFT) allows for different forms of computation in quantum computers that Quantum Mechanics (QM) does not allow. Thus, there must exist forms of computation in the QFT representation of the Universe that the QM representation does not allow. We explain in a simple manner how the QFT representation allows for different forms of computation by describing the differences between QFT and QM, and obtain why the future of quantum computation will require the use of QFT.

DOI
10.3390/app112311272

Related papers

QUANTUM FIELD THEORY AND COMPUTATIONAL PARADIGMS

E. V. Krishnamurthy, Vikram Krishnamurthy

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.

International Journal of Modern Physics C•Oct 1, 2001•4 citations

The concept of particle in Quantum Field theory

Eliano Pessa

Despite its name, Quantum Field Theory (QFT) has been built to describe interactions between localizable particles. For this reason the actual formalism of QFT is partly based on a suitable generalization of the one already used for systems of point particles. This circumstance gives rise to a number of conceptual problems, stemming essentially from the fact that the existence within QFT of non-equivalent representations implies the existence of field theories allowing, within the same theory, different, inequivalent, descriptions of particles. This led some authors to claim that in QFT the concept itself of particle should be abandoned. In this paper we will shortly discuss the validity of this claim, as well as the possibilities, so far existing, of building alternative versions of QFT, not designed in advance to allow some kind of particle representation. We will also spend some words about the generalizations of the concept itself of particle which could grant for a better cohabitation of particles and fields within a wider formulation of QFT. The latter is indispensable if we want to extend the range of application of QFT from particle physics or simple condensed matter physics to other domains of scientific research.

arXiv:0907.0178•Jul 1, 2009•18 citations

Beyond Quantum Computation and Towards Quantum Field Computation

A. C. Manoharan

Because the subject of relativistic quantum field theory (QFT) contains all of non-relativistic quantum mechanics, we expect quantum field computation to contain (non-relativistic) quantum computation. Although we do not yet have a quantum theory of the gravitational field, and are far from a practical implementation of a quantum field computer, some pieces of the puzzle (without gravity) are now available. We consider a general model for computation with quantum field theory, and obtain some results for relativistic quantum computation. Moreover, it is possible to see new connections between principal models of computation, namely, computation over the continuum and computation over the integers (Turing computation). Thus we identify a basic problem in QFT, namely Wightman's computation problem for domains of holomorphy, which we call WHOLO. Inspired by the same analytic functions which are central to the famous CPT theorem of QFT, it is possible to obtain a computational complexity structure for QFT and shed new light on certain complexity classes for this problem WHOLO.

arXiv:quant-ph/0304136•Apr 19, 2003•0 citations

Philosophical Foundations of Quantum Field Theory

Nick Huggett

Abstract Much attention has been directed to the philosophical implications of quantum field theory (QFT) in recent years; this paper attempts a survey in low-technical terms. First the relations of QFT to other kinds of theory, classical and quantum, particle and field, are discussed. Then various formulations of QFT are introduced, along with related interpretations. Finally a review is made of some of the most interesting foundational problems. For our discussion of the foundations of quantum field theory (QFT) it will be useful to have a map showing where QFT stands in relation to other physical theories. Figure 1 locates theories as points of a three-dimensional lattice: describing particles or fields, formulated in different spacetimes and either classical or quantum. Consider the classical plane of Figure

•May 1, 2003•2 citations

Method of Quantum Field Theory

Tadashi HASEBE

Quantum field theory (QFT) provides us with one and almost only suitable language (or mathematical tool) for describing not only the motion and interaction of particles but also their “annihilation” and “creation” out of a field considered a priori in a sophisticated way, whose view seems to be suited for describing dislocations, as a particle or a string embedded within a crystalline ordered field. This chapter concisely overviews the method of QFT, emphasizing distinction from the quantum mechanics, conventionally used for a single and/or many particle problems, and its equivalence to the statistical mechanics. The alternative formalism based on Feynman path integral and its imaginary time representation are reviewed, as the foundation for our use in Chapter 10.

Cambridge University Press eBooks•Dec 14, 2023•0 citations

Quantum Topological Field Theory

Jincheng Zhang

Quantum Topological Field Theory (QTF) presents a novel approach to quantum computation, leveraging the principles of quantum field theory and topological quantum mechanics. This paper explores the concept of a "topological field" – a fundamental building block – and its integration with quantum field theory to achieve unprecedented computational capabilities. We detail the core mechanism of constructing a quantum state representation based on quantum entanglement, aiming to fundamentally revolutionize the understanding of quantum entanglement. This research aims to address limitations of existing quantum computing paradigms by introducing a fundamentally new computational architecture predicated on topological properties.

•Aug 31, 2026•0 citations
Recently, from the deduction of the result MIP* = RE in quantum computation, it was obtained that Quantum Field Theory (QFT) allows for different forms of computation in quantum computers that Quantum Mechanics (QM) does not allow. Thus, there must exist forms of computation in the QFT representation of the Universe that the QM representation does not allow. We explain in a simple manner how the QFT representation allows for different forms of computation by describing the differences between QFT and QM, and obtain why the future of quantum computation will require the use of QFT.
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.
Despite its name, Quantum Field Theory (QFT) has been built to describe interactions between localizable particles. For this reason the actual formalism of QFT is partly based on a suitable generalization of the one already used for systems of point particles. This circumstance gives rise to a number of conceptual problems, stemming essentially from the fact that the existence within QFT of non-equivalent representations implies the existence of field theories allowing, within the same theory, different, inequivalent, descriptions of particles. This led some authors to claim that in QFT the concept itself of particle should be abandoned. In this paper we will shortly discuss the validity of this claim, as well as the possibilities, so far existing, of building alternative versions of QFT, not designed in advance to allow some kind of particle representation. We will also spend some words about the generalizations of the concept itself of particle which could grant for a better cohabitation of particles and fields within a wider formulation of QFT. The latter is indispensable if we want to extend the range of application of QFT from particle physics or simple condensed matter physics to other domains of scientific research.
Because the subject of relativistic quantum field theory (QFT) contains all of non-relativistic quantum mechanics, we expect quantum field computation to contain (non-relativistic) quantum computation. Although we do not yet have a quantum theory of the gravitational field, and are far from a practical implementation of a quantum field computer, some pieces of the puzzle (without gravity) are now available. We consider a general model for computation with quantum field theory, and obtain some results for relativistic quantum computation. Moreover, it is possible to see new connections between principal models of computation, namely, computation over the continuum and computation over the integers (Turing computation). Thus we identify a basic problem in QFT, namely Wightman's computation problem for domains of holomorphy, which we call WHOLO. Inspired by the same analytic functions which are central to the famous CPT theorem of QFT, it is possible to obtain a computational complexity structure for QFT and shed new light on certain complexity classes for this problem WHOLO.
Abstract Much attention has been directed to the philosophical implications of quantum field theory (QFT) in recent years; this paper attempts a survey in low-technical terms. First the relations of QFT to other kinds of theory, classical and quantum, particle and field, are discussed. Then various formulations of QFT are introduced, along with related interpretations. Finally a review is made of some of the most interesting foundational problems. For our discussion of the foundations of quantum field theory (QFT) it will be useful to have a map showing where QFT stands in relation to other physical theories. Figure 1 locates theories as points of a three-dimensional lattice: describing particles or fields, formulated in different spacetimes and either classical or quantum. Consider the classical plane of Figure
Quantum field theory (QFT) provides us with one and almost only suitable language (or mathematical tool) for describing not only the motion and interaction of particles but also their “annihilation” and “creation” out of a field considered a priori in a sophisticated way, whose view seems to be suited for describing dislocations, as a particle or a string embedded within a crystalline ordered field. This chapter concisely overviews the method of QFT, emphasizing distinction from the quantum mechanics, conventionally used for a single and/or many particle problems, and its equivalence to the statistical mechanics. The alternative formalism based on Feynman path integral and its imaginary time representation are reviewed, as the foundation for our use in Chapter 10.
Quantum Topological Field Theory (QTF) presents a novel approach to quantum computation, leveraging the principles of quantum field theory and topological quantum mechanics. This paper explores the concept of a "topological field" – a fundamental building block – and its integration with quantum field theory to achieve unprecedented computational capabilities. We detail the core mechanism of constructing a quantum state representation based on quantum entanglement, aiming to fundamentally revolutionize the understanding of quantum entanglement. This research aims to address limitations of existing quantum computing paradigms by introducing a fundamentally new computational architecture predicated on topological properties.