Elucidating the Physical and Mathematical Properties of the Prouhet‐Thue‐Morse Sequence in Quantum Computing

ABSTRACT This study explores the applications of the Prouhet‐Thue‐Morse (PTM) sequence in quantum computing, highlighting its mathematical elegance and practical relevance. We demonstrate the critical role of the PTM sequence in quantum error correction, in noise‐resistant quantum memories, and in providing insights into quantum chaos. Notably, we demonstrate how the PTM sequence naturally appears in Ising X‐X interacting systems, leading to a proposed robust encoding of quantum memories in such systems. Furthermore, connections to number theory, including the Riemann zeta function, bridge quantum computing with pure mathematics. Our findings emphasize the PTM sequence's importance in understanding the mathematical structure of quantum computing systems and the development of the full potential of quantum technologies and invite further interdisciplinary research.