Papers › Quantum Resetting Protocols Based on Synchronizing Words

Quantum Resetting Protocols Based on Synchronizing Words

1 Apr 2025arXiv:2504.01106links table onlyarchive 2025-07-28

Jędrzej Stempin, Jan Wójcik, Andrzej Grudka, Marcin Karczewski, Paweł Kurzyński, Antoni Wójcik

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Resetting a system's state plays a fundamental role in physics, engineering, computer science, and many other fields. Here we focus on a method originally proposed in automata theory. The state of an automaton evolves according to a set of rules. These rules form an alphabet, and one can apply these rules one after another. Such a sequence of rules is known as a word. Some particular words, known as synchronizing words, enable a system to evolve into a predetermined state regardless of its initial configuration. This process, which is inherently irreversible, appears at first glance to be incompatible with the unitarity of quantum mechanics. Unitary evolution preserves information, hence forbids such classical resetting to a predetermined state. In this work, we introduce a novel resetting protocol based on quantum-synchronizing words by incorporating auxiliary qubits whose states encode rules of the automaton's alphabet. We further propose a quantum circuit that realizes this protocol and can be implemented on a quantum computer. Additionally, we establish a connection between this approach and Kraus channels, showing that quantum synchronizing words can be achieved without explicit reference to the states of ancillary qubits. Our results bridge classical and quantum notions of synchronizing words, shedding light on the interplay between quantum information processing and non-unitary dynamics.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections