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.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/0304136Apr 19, 20030 citations

A new approach to numerical quantum field theory

Santiago García, GERALD S. GURALNIK, John W. Lawson

arXiv:hep-ph/9312236Physics Letters BFeb 1, 199412 citations

Quantum Field Theory Representation in Quantum Computation

Nicolas Francisco Lori, José Neves, Jose Manuel Machado

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.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.

Applied SciencesNov 28, 20213 citations

Lectures on Quantum Field Theory on a Quantum Computer

Aninda Sinha, Ujjwal Basumatary

The lecture notes cover the basics of quantum computing methods for quantum field theory applications. No detailed knowledge of either quantum computing or quantum field theory is assumed and we have attempted to keep the material at a pedagogical level. We review the anharmonic oscillator, using which we develop a hands-on treatment of certain interesting QFTs in $1+1D$ : $φ^4$ theory, Ising field theory, and the Schwinger model. We review quantum computing essentials as well as tensor network techniques. The latter form an essential part for quantum computing benchmarking. Some error modelling on QISKIT is also done in the hope of anticipating runs on NISQ devices. These lecture notes are the expanded version of a one semester course taught by AS during August-November 2025 at the Indian Institute of Science and TA-ed by UB. The programs written for this course are available in a GitHub repository.The lecture notes cover the basics of quantum computing methods for quantum field theory applications. No detailed knowledge of either quantum computing or quantum field theory is assumed and we have attempted to keep the material at a pedagogical level. We review the anharmonic oscillator, using which we develop a hands-on treatment of certain interesting QFTs in $1+1D$: $φ^4$ theory, Ising field theory, and the Schwinger model. We review quantum computing essentials as well as tensor network techniques. The latter form an essential part for quantum computing benchmarking. Some error modelling on QISKIT is also done in the hope of anticipating runs on NISQ devices. These lecture notes are the expanded version of a one semester course taught by AS during August-November 2025 at the Indian Institute of Science and TA-ed by UB. The programs written for this course are available in a GitHub repository.

quant-pharXiv:2512.02706Dec 3, 20250 citations

On the "principle of the quantumness", the quantumness of Relativity, and the computational grand-unification

Giacomo Mauro D’Ariano

After reviewing recently suggested operational "principles of the quantumness", I address the problem on whether Quantum Theory (QT) and Special Relativity (SR) are unrelated theories, or instead, if the one implies the other. I show how SR can be indeed derived from causality of QT, within the computational paradigm "the universe is a huge quantum computer", reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT SR emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way QT remains the only theory operating the huge computer of the universe. Is QCFT only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.After reviewing recently suggested operational "principles of the quantumness", I address the problem on whether Quantum Theory (QT) and Special Relativity (SR) are unrelated theories, or instead, if the one implies the other. I show how SR can be indeed derived from causality of QT, within the computational paradigm "the universe is a huge quantum computer", reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT SR emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way QT remains the only theory operating the huge computer of the universe. Is QCFT only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.

arXiv:1001.1088Jan 7, 20106 citations

1+1D

φ^4

theory, Ising field theory, and the Schwinger model. We review quantum computing essentials as well as tensor network techniques. The latter form an essential part for quantum computing benchmarking. Some error modelling on QISKIT is also done in the hope of anticipating runs on NISQ devices. These lecture notes are the expanded version of a one semester course taught by AS during August-November 2025 at the Indian Institute of Science and TA-ed by UB. The programs written for this course are available in a GitHub repository.