Preprint / Version 2

Algebraic Codification and Discrete Isomorphic State Propagation for Exact Synthesis of NCV Quantum Circuits

##article.authors##

  • George Papakonstantinou National Technical University of Athens

DOI:

https://doi.org/10.31224/8129

Keywords:

Quantum Circuit Synthesis, NCV Gate Library, Cyclic Groups, Mathematical Optimization, Mixed-Integer Linear Programming

Abstract

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

Download data is not yet available.

Downloads

Posted

2026-09-03 — Updated on 2026-11-11

Versions

Version justification

The introduction of a novel discrete modular mathematical formulation drastically bounds the MILP search space, leading to significantly improved experimental results and computational speedups.