2 papers
quant-ph2026
On the Addressability Problem on CSS Codes
Jérôme Guyot, Samuel Jaques
Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on t…
cs.FL2024
On state complexity for subword-closed languages
Jérôme Guyot
This paper investigates the state complexities of subword-closed and superword-closed languages, comparing them to regular languages. We focus on the square root operator and the s…