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

Elsevier eBooks

Field computation

Bruce James MacLennan

Published Oct 7, 2016• 2 citations
Publisher
DOI
10.1016/b978-0-12-804409-4.00003-6

Related papers

Field quantisation

J T Mendonça

Institute of Physics eBooks•Sep 1, 2022•0 citations

Quansistor Field Computing

101research.group, Enter Yourname, Karel Cápek +3 more

Quansistor Field Computing (QFC) is an ongoing research compendium proposing a novel operator- and field-based paradigm of computation. Rather than treating computation as a sequence of discrete logical steps, QFC models computation as the evolution of structured computational fields governed by spectral operators. At the core of QFC lies the concept of the Quansistor — a generalized computational entity whose state is defined by operator-valued relations within a field, rather than by binary logic or classical quantum gates. This framework aims to unify perspectives from mathematics, theoretical physics, distributed systems, and verifiable computation. The compendium introduces and develops several tightly connected layers, including: Quansistor Field Mathematics (QFM) — a mathematical framework describing operator-defined computational fields and their spectral properties. Quantum / Quansistor Virtual Machine (QVM) — a virtual execution environment for instantiating, simulating, and observing field-based computation. Transistor Field Computing (TFC) — a conceptual bridge between abstract field computation and realizable hardware or substrate-dependent implementations. SMRK Probe and SMRK Network — a verification and observation layer enabling deterministic replay, spectral verification, and audit-native computation across independent execution contexts. This work is not presented as a finalized system, but as a foundational research corpus intended to define a coherent conceptual and architectural space within which new forms of computation may be rigorously explored, implemented, and verified. The QFC Compendium is designed as a living document, with ongoing revisions and extensions. Zenodo’s versioning mechanism is used to ensure long-term citability, reproducibility, and archival integrity, while allowing the framework to evolve. Keywords Quansistor, Field Computing, Operator-Based Computation, Spectral Operators, Quantum Virtual Machine, QVM, QFM, TFC, Verifiable Computation, Deterministic Replay, Computational Fields Notes This record represents a versioned release of the QFC Compendium.For persistent referencing of the project as a whole, use the concept DOI associated with this record.For citation of a specific revision, use the version-specific DOI.

•Jan 7, 2026•0 citations

Field—Field Interactions

Luigi Accardi, Igor Vasil'evich Volovich, Yun Gang Lu

Springer eBooks•Jan 1, 2002•0 citations

The unity between quantum field computation, real computation, and quantum computation

A. C. Manoharan

It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum field computation (as enhanced by Wightman's model of quantum field theory) involves computation over the continuum which is remarkably related to the real computation model of Smale. The latter model was established as a generalization of Turing computation. All this is not surprising since it is well known that the physics of quantum field theory (which includes Einstein's special relativity) contains quantum mechanics which in turn contains classical mechanics. The unity of these computing models, which seem to have grown largely independently, could shed new light into questions of computational complexity, into the central P (Polynomial time) versus NP (Non-deterministic Polynomial time) problem of computer science, and also into the description of Nature by fundamental physics theories.

arXiv:quant-ph/0109015•Sep 4, 2001•4 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

Field-Theoretical Methods

Robert Alicki

Lecture notes in physics•Jan 1, 2010•16 citations
Quansistor Field Computing (QFC) is an ongoing research compendium proposing a novel operator- and field-based paradigm of computation. Rather than treating computation as a sequence of discrete logical steps, QFC models computation as the evolution of structured computational fields governed by spectral operators. At the core of QFC lies the concept of the Quansistor — a generalized computational entity whose state is defined by operator-valued relations within a field, rather than by binary logic or classical quantum gates. This framework aims to unify perspectives from mathematics, theoretical physics, distributed systems, and verifiable computation. The compendium introduces and develops several tightly connected layers, including: Quansistor Field Mathematics (QFM) — a mathematical framework describing operator-defined computational fields and their spectral properties. Quantum / Quansistor Virtual Machine (QVM) — a virtual execution environment for instantiating, simulating, and observing field-based computation. Transistor Field Computing (TFC) — a conceptual bridge between abstract field computation and realizable hardware or substrate-dependent implementations. SMRK Probe and SMRK Network — a verification and observation layer enabling deterministic replay, spectral verification, and audit-native computation across independent execution contexts. This work is not presented as a finalized system, but as a foundational research corpus intended to define a coherent conceptual and architectural space within which new forms of computation may be rigorously explored, implemented, and verified. The QFC Compendium is designed as a living document, with ongoing revisions and extensions. Zenodo’s versioning mechanism is used to ensure long-term citability, reproducibility, and archival integrity, while allowing the framework to evolve. Keywords Quansistor, Field Computing, Operator-Based Computation, Spectral Operators, Quantum Virtual Machine, QVM, QFM, TFC, Verifiable Computation, Deterministic Replay, Computational Fields Notes This record represents a versioned release of the QFC Compendium.For persistent referencing of the project as a whole, use the concept DOI associated with this record.For citation of a specific revision, use the version-specific DOI.
It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum field computation (as enhanced by Wightman's model of quantum field theory) involves computation over the continuum which is remarkably related to the real computation model of Smale. The latter model was established as a generalization of Turing computation. All this is not surprising since it is well known that the physics of quantum field theory (which includes Einstein's special relativity) contains quantum mechanics which in turn contains classical mechanics. The unity of these computing models, which seem to have grown largely independently, could shed new light into questions of computational complexity, into the central P (Polynomial time) versus NP (Non-deterministic Polynomial time) problem of computer science, and also into the description of Nature by fundamental physics theories.
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.