Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing
- URL: http://arxiv.org/abs/2609.04076v1
- Date: Thu, 03 Sep 2026 16:44:39 GMT
- Title: Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing
- Abstract summary: We present an operator-decomposition architecture that mathematically maps a global operator into independently executable local operators.<n>AOD complements quantum error correction and error-mitigation approaches by performing algebraic decomposition before quantum execution.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present an operator-decomposition architecture that mathematically maps a global operator into independently executable local operators, reducing the maximum quantum circuit depth at the cost of classical reconstruction and sampling overhead. By framing complex Quantum Circuits around an operator in a vector space that can be algebraically pre-decomposed, AOD complements quantum error correction and error-mitigation approaches by performing algebraic decomposition before quantum execution. Our approach leans in the computer science definition of a Monoid: a design pattern and mathematical concept consisting of a data type, a combining function that is associative, and a safe identity (neutral) element that does not change other values when combined. Simulation wise we define a MapReduce programming model where the addition (+) is the reducer, thus leveraging a naturally stable commutative monoid which carries zero "negative-probability tax" or phase conflicts. Furthermore, we define a Vector Space of Linear Operators over Additive Abelian Groups that benefit from this paradigm, including: Inner Products, Series expansions, Traces and Convolutions. Finally, we present the mathematical foundations and simulation results for this paradigm.
Related papers
- Quantum algorithms for second-order boundary value problems [0.0]
We introduce a framework for explicitly constructing finite-dimensional counterparts of continuous differential operators in a form compatible with quantum computation.<n>We derive discrete realizations of second-order operators on primal--dual cell complexes and reformulate them as star-local update rules.<n>This yields simple, uniform, and scalable quantum circuits.
arXiv Detail & Related papers (2026-07-13T11:17:35Z) - A Lie-Jordan Geometric Formulation of Lindblad Dynamics [35.18016233072556]
We develop a Lie-Jordan geometric formulation of finite-dimensional open quantum dynamics.<n>We identify a basis-independent universal trilinear dissipative map.<n>We also derive its Hilbert-Schmidt adjoint and illustrate the formalism for a qubit with pure dephasing and amplitude-damping channels.
arXiv Detail & Related papers (2026-07-04T23:16:57Z) - Algebraic structures of the Lindblad equation [32.505127447635864]
We show that dissipative dynamics requires a substantially richer algebraic structure than purely unitary evolution.<n>The proposed framework provides both a general mathematical description of finite-dimensional Lindblad dynamics and a practical foundation for efficient analytical and numerical implementations.
arXiv Detail & Related papers (2026-06-25T00:28:13Z) - Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
arXiv Detail & Related papers (2026-03-12T14:47:16Z) - Deep Delta Learning [91.75868893250662]
We introduce Deep Delta Learning (DDL), a novel architecture that generalizes the standard residual connection.<n>We provide a spectral analysis of this operator, demonstrating that the gate $(mathbfX)$ enables dynamic between identity mapping, projection, and geometric reflection.<n>This unification empowers the network to explicitly control the spectrum of its layer-wise transition operator, enabling the modeling of complex, non-monotonic dynamics.
arXiv Detail & Related papers (2026-01-01T18:11:38Z) - RedCarD: A Quantum Assisted Algorithm for Fixed-Depth Unitary Synthesis via Cartan Decomposition [0.6999740786886536]
Unitaries of the form $e-itH$, such as time-independent Hamiltonian simulation, have depth that does not depend on simulation time $t$.<n>In this work, by further partitioning the dynamical Lie algebra, we break down the optimization problem into smaller independent subproblems.<n>As an application of the new hybrid algorithm, we synthesize the time evolution unitary for the 4-site transverse field Ising model on several IBM devices and Quantinuum's H1-1 quantum computer.
arXiv Detail & Related papers (2025-12-05T19:00:00Z) - Irreducible matrix representations for the walled Brauer algebra [0.9374652839580183]
This paper investigates the representation theory of the algebra of partially transposed permutation operators, $mathcalAd_p,p$.<n>It provides a matrix representation for the abstract walled Brauer algebra.<n>This algebra has recently gained significant attention due to its relevance in quantum information theory.
arXiv Detail & Related papers (2025-01-22T18:22:20Z) - Sufficient condition for universal quantum computation using bosonic
circuits [44.99833362998488]
We focus on promoting circuits that are otherwise simulatable to computational universality.
We first introduce a general framework for mapping a continuous-variable state into a qubit state.
We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
arXiv Detail & Related papers (2023-09-14T16:15:14Z) - Compressing Many-Body Fermion Operators Under Unitary Constraints [0.6445605125467573]
We introduce a numerical algorithm for performing factorization that has an complexity no worse than single particle basis transformations of the two-body operators.
As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators.
arXiv Detail & Related papers (2021-09-10T17:42:18Z) - Neural Operator: Learning Maps Between Function Spaces [75.93843876663128]
We propose a generalization of neural networks to learn operators, termed neural operators, that map between infinite dimensional function spaces.
We prove a universal approximation theorem for our proposed neural operator, showing that it can approximate any given nonlinear continuous operator.
An important application for neural operators is learning surrogate maps for the solution operators of partial differential equations.
arXiv Detail & Related papers (2021-08-19T03:56:49Z) - Abelian Neural Networks [48.52497085313911]
We first construct a neural network architecture for Abelian group operations and derive a universal approximation property.
We extend it to Abelian semigroup operations using the characterization of associative symmetrics.
We train our models over fixed word embeddings and demonstrate improved performance over the original word2vec.
arXiv Detail & Related papers (2021-02-24T11:52:21Z) - Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range.
For a large part of the presentation, infinite scattering length will be considered.
arXiv Detail & Related papers (2020-06-03T17:54:43Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.