Scholarlink

<p>We introduce <i>Triangulated Relativistic Quantum Computation</i> (TRQC), a mathematically consistent framework that integrates relativistic causal constraints with quantum channel dynamics by promoting <i>intrinsic curvature</i> to a first-class control parameter. Spacetime is modeled as an oriented simplicial complex endowed with a time labeling that induces a causal partial order on events. Quantum degrees of freedom are <i>finite-dimensional</i> and attached to vertices, while local evolution along edges is given by completely positive trace-preserving (CPTP) maps generated by a <i>curvature-modulated Lindbladian</i>. Curvature on spacelike slices is estimated from vertex angle deficits of a latent triangulation—intrinsic to the induced piecewise-Euclidean metric of the chosen embedding; this estimator is O(d)-invariant under global orthogonal transformations of the latent embedding, with an explicit per-slice scale convention. We prove: (i) gauge invariance of the angle-deficit and curvature density; (ii) well-posedness and norm-continuity of curvature-modulated CPTP semigroups; (iii) causal factorization and no-signaling across spacelike-separated subcomputations via order-independence within slices; (iv) triangulation invariance under commuting-locality <i>with preserved per-cell generators</i>, and triangulation-independence in a Lie–Trotter refinement limit; (v) a discrete Gauss–Bonnet identity on closed slices; and (vi) quantum speed limits and Lindbladian perturbation bounds with explicit curvature dependence. In the flat limit, TRQC reduces to standard quantum circuits; in an entanglement-breaking limit, it reduces to classical relativistic computation. We outline algorithms for curvature evaluation on moving meshes, causal scheduling, and remeshing-robust Trotterization, and we sketch applications to relativistic quantum networking, analog simulation on curved/hyperbolic lattices, geometry-aware error correction, and transport on curved or fractal nanostructures. Beyond offering new theoretical guarantees, TRQC provides a practical semantics for designing and simulating quantum information processing in nontrivial geometries and time-dilated settings.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Triangulated relativistic quantum computation: a curvature-modulated unification of quantum and relativistic computing

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年12月15日

查看全文
  • Javier Villalba-Díez,
  • Joaquín Ordieres-Meré

摘要

We introduce Triangulated Relativistic Quantum Computation (TRQC), a mathematically consistent framework that integrates relativistic causal constraints with quantum channel dynamics by promoting intrinsic curvature to a first-class control parameter. Spacetime is modeled as an oriented simplicial complex endowed with a time labeling that induces a causal partial order on events. Quantum degrees of freedom are finite-dimensional and attached to vertices, while local evolution along edges is given by completely positive trace-preserving (CPTP) maps generated by a curvature-modulated Lindbladian. Curvature on spacelike slices is estimated from vertex angle deficits of a latent triangulation—intrinsic to the induced piecewise-Euclidean metric of the chosen embedding; this estimator is O(d)-invariant under global orthogonal transformations of the latent embedding, with an explicit per-slice scale convention. We prove: (i) gauge invariance of the angle-deficit and curvature density; (ii) well-posedness and norm-continuity of curvature-modulated CPTP semigroups; (iii) causal factorization and no-signaling across spacelike-separated subcomputations via order-independence within slices; (iv) triangulation invariance under commuting-locality with preserved per-cell generators, and triangulation-independence in a Lie–Trotter refinement limit; (v) a discrete Gauss–Bonnet identity on closed slices; and (vi) quantum speed limits and Lindbladian perturbation bounds with explicit curvature dependence. In the flat limit, TRQC reduces to standard quantum circuits; in an entanglement-breaking limit, it reduces to classical relativistic computation. We outline algorithms for curvature evaluation on moving meshes, causal scheduling, and remeshing-robust Trotterization, and we sketch applications to relativistic quantum networking, analog simulation on curved/hyperbolic lattices, geometry-aware error correction, and transport on curved or fractal nanostructures. Beyond offering new theoretical guarantees, TRQC provides a practical semantics for designing and simulating quantum information processing in nontrivial geometries and time-dilated settings.