Unbounded length minimal synchronizing words for quantum channels over qutrits
Discrete Mathematics
2026-03-03 v1 Formal Languages and Automata Theory
Mathematical Physics
math.MP
Abstract
Grudka, Karczewski, Kurzynski, Stempin, W\'ojcik and Wojcik (2025) constructed quantum channels with synchronizing words of length 3 for qutrits. We extend their result to arbitrarily long minimal synchronizing words, providing a contrast to \v{C}ern\'y's conjecture for finite automata.
Cite
@article{arxiv.2603.00861,
title = {Unbounded length minimal synchronizing words for quantum channels over qutrits},
author = {Bjørn Kjos-Hanssen and Swarnalakshmi Lakshmanan},
journal= {arXiv preprint arXiv:2603.00861},
year = {2026}
}
Comments
Quantum Communication, Networking and Computation (QCNC) 2026