Local Universality and Structural Certificates for Minimal Fixed-Depth Two-Qutrit Gate Decomposition
Yurui Liu, Ruoting Dou, Peng Xu, Xinsheng Tan, Shengjun Wu, Yang Yu, Zeng-Bing Chen
Abstract
We study a dimension-saturating fixed-core ansatz in which four copies of a fixed, non-tunable two-qutrit core K∈ SU(9) are interleaved with five adjustable local layers from L=SU(3) SU(3). Since SU(9)=80 and 5 L=80, this is the shortest fixed-core architecture not excluded by parameter counting. We formulate the smooth map ΦK:L5 SU(9) and use its right-trivialized differential to give verifiable certificates for local universality. We construct an explicit Clifford-word core whose Pauli-label splitting makes the identity-point differential an exact isometry, and we classify all 2304 symplectic actions satisfying the same splitting criterion. We also prove a structural obstruction for an important symmetry class: every complex-symmetric core K=KT, including every core generated by a time-independent real-symmetric Hamiltonian in the chosen computational basis, has identity-point differential rank at most 78; hence any full-rank certificate for such a core must occur away from that point. We then assess a hardware-motivated superconducting core generated by a noncommuting, temporally asymmetric drive. Direct calculation verifies K sc≠ K sc T, and the core achieves F avg 0.999 for all 1000 Haar-random targets tested under the stated restart protocol. We also report favorable sampled Jacobian-rank, structured-target, and robustness diagnostics. These results establish local universality at the parameter-counting-minimal, dimension-saturating depth, with an exact Clifford certificate complemented by a hardware-motivated numerical case study. Throughout, we separate exact local certificates from numerical evidence for broader synthesis performance.
Create a lesson
Related papers
Trading Circuit Depth for Pulse Sparsity in Chromatic Dynamical Decoupling
Amy F. Brown, Daniel A. Lidar
Optimal spectrum estimation
Ainesh Bakshi, Apoorv Vikram Singh, Xinyu Tan
Non-Abelian sheaf quantum LDPC codes: good and magical
Zimu Li, Fuchuan Wei, Zhengyi Han et al.
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
Sharp universal death of entanglement threshold for Pauli Hamiltonians
Bobak T. Kiani
Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks
Constantin Cedillo Vayson de Pradenne, Jordan Cotler