Algebraic Codification and Discrete Isomorphic State Propagation for Exact Synthesis of NCV Quantum Circuits
DOI:
https://doi.org/10.31224/8129Keywords:
Quantum Circuit Synthesis, NCV Gate Library, Cyclic Groups, Mathematical Optimization, Mixed-Integer Linear ProgrammingAbstract
Exact synthesis of quantum circuits seeks depth optimal gate layouts but is fundamentally bottlenecked by the continuous-variable scaling of unitary matrices or complex amplitudes. In this paper, we propose a mathematically novel approach for the exact synthesis of NCV (NOT, CNOT, Controlled- V , Controlled-V †) quantum circuits. We demonstrate that the quantum state evolution of basis vectors under NCV logic does not require continuous variable tracking; instead, it is strictly isomorphic to the additive cyclic group Z4. By codifying quantum amplitudes and relative phases into a single scalar integer S ∈ {0, 1, 2, 3}, we bypass fractional and imaginary components entirely. We further formulate quantum gate interactions natively as modular linear integer additions, completely eliminating the need for binary logic decomposition or XOR parity relaxations. This formulation maps the exact synthesis problem into a highly constrained, pure Mixed-Integer Linear Programming (MILP) model. We mathematically prove the validity of this discrete encoding, demonstrating that it drastically bounds the computational search tree and achieves exponential speedups over prior formulations.
Downloads
Downloads
Posted
Versions
- 2026-11-11 (2)
- 2026-09-03 (1)
License
Copyright (c) 2026 George Papakonstantinou

This work is licensed under a Creative Commons Attribution 4.0 International License.