Skip to content
Preprint

Finite-Precision Algebraic Quantum Field Theory

Jul 2026 · 1 citation
Physics Mathematics

Abstract

Recent work introduced Interval Quantum Mechanics (IQM), a finite-precision framework in which physical information is represented by sets of possible states rather than exact states. We extend this approach to algebraic quantum field theory (AQFT) by introducing Interval Algebraic Quantum Field Theory (IAQFT), whose basic objects are quantum parcels: weak* open convex regions of state space encoding finite-precision information obtained from finitely many local observations. We develop parcel reduction and measurement update, establish finite-dimensional information-contraction results, and formulate locality through compatible parcel nets. Major structural features of AQFT are recast in parcel-theoretic terms, including the Reeh--Schlieder property, Haag's theorem, modular theory, the KMS condition, and the Unruh effect. We show that spacelike vacuum correlations and strict Bell violations persist under finite precision, and that lattice approximations are compatible with the parcel framework. Finally, we recover the Murray--von Neumann classification of factors together with the trace and projection equivalence in Type~$\mathrm{II}_1$ factors from the geometry of limiting parcels. IAQFT thus provides a unified finite-precision formulation of the operational, modular, and operator-algebraic structures of relativistic quantum theory.

View source

Similar papers

Preprint Jul 2026

Quantum Computational Resources and Conformal Field Theory: Unifying Spins, Bosons, and Fermions

This work introduces a unified measure, the magic R\'enyi entropy (MRE), to quantify computational resources in spins, bosons, and fermions on an equal footing and shows that the MRE is a resource monotone under stabilizer and Gaussian protocols involving measurements and feedforward operations.

Ryota Matsuda, Masahiro Hoshino, Yuto Ashida · 4 citations
Preprint Jul 2026

Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information

This work presents a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis, and formalizes the DPI for the sandwiched R\'enyi relative entropy for positive semidefinite operators on finite-dimensional quantum systems.

Kazumi Kasaura, Kei Tsukamoto, Kento Mori et al. · 2 citations
Preprint Aug 2026

Spin-coherent quantum designs

Coherent states bridge the gap between quantum and classical physics, but their overcomplete and nonorthogonal nature makes it difficult to identify the minimal discrete set needed to reconstruct quantum information. Finite spin-coherent tomography and discrete coherent-state operator bases are known, but here we addre...

Marcin Rudziński, A. Goldberg, A. B. Klimov et al. · 0 citations
Preprint Jul 2026

The Infinitesimal Structure of Quantum Information

This paper establishes a rigorous, unified geometric framework for quantum state spaces by constructing smooth, regular embeddings into higher-order dual number algebras $\mathcal{Q}_N \equiv \mathbb{R}[\varepsilon]/(\varepsilon^{N^2-1})$, wherein every quantum state is faithfully represented as a non-reduced scheme-th...

L. Barbieri-Viale · 0 citations
Preprint Aug 2026

State Diagnostics of Complexity in Open Quantum Systems

We study the emergence of complexity in finite-size quantum systems as their dynamics transition from closed and coherent evolution to interacting and effectively open behavior. Using a state-based geometric framework, we represent mixed quantum states as probability measures on complex projective Hilbert space. This r...

Komal Sah, F. Anzà, Alexandra M. Jurgens et al. · 0 citations
Preprint Jul 2026

Covariant Approximate Quantum Codes for Protected Analog Computation

Quantum error correction compatible with continuous symmetries is a fundamental problem in quantum information and a possible route to robust analog quantum simulation. Because the Eastin-Knill theorem forbids exact codes with continuous transversal symmetries, we construct explicit $SU(d)$-covariant approximate codes...

Mariia Elovenkova, Hong-Ye Hu, Susanne F. Yelin · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.