Unbounded length minimal synchronizing words for quantum channels over qutrits
Abstract
Grudka, Karczewski, Kurzynski, Stempin, Wójcik 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 Černý's conjecture for finite automata.
Fields of Study & Subjects
semigroups and automata theory
Quantum Information and Cryptography
Quantum Computing Algorithms and Architecture
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 1 March 2026
- Language
- EN
- Document type
- Preprint