Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing
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
- Algebraic decomposition and topological fibrations of the U(4) → SU(2) quotient space
- NAQsim: Full-Stack Architecture Simulation Framework for Fast and Space-Efficient Neutral Atom Quantum Computing
- Loss-correcting fault-tolerant quantum computing architecture for neutral atoms
- A customizable explicit partitioned FSI coupling framework for Code_Saturne and Code_Aster
- Solution to Double Counting of Zero-Point Energy: Partitioned Quantum Thermal Baths for Mixed Quantum–Classical Dynamics
BibTeX
@misc{silva2026algebraic,
title = {{Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing}},
author = {Wladimir Silva},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.04076},
eprint = {2609.04076},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.04076},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Algebraic Operator Decomposition: A Partitioned Architecture for Noise-Resilient Quantum Computing
AU - Wladimir Silva
PY - 2026
DA - 2026/09/03
PB - arXiv
DO - 10.48550/arxiv.2609.04076
UR - https://arxiv.org/abs/2609.04076
AB - 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.
ER -