DOE OSTI · 1971063
Counting abelian squares efficiently for a problem in quantum computing
Abstract
Here, I describe how the number of abelian squares of given length relates to a certain problem in theoretical quantum computing, and I present a recursive formula for calculating the number of abelian squares of length t+t over an alphabet of size d. The presented formula is similar to previously known formula but has substantially lower complexity for large d, a key improvement resulting in a practical solution to the original application.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bennink, Ryan. 2023-04-14. Counting abelian squares efficiently for a problem in quantum computing. https://doi.org/10.4310/joc.2023.v14.n4.a3. https://searchnasa.com/record/osti%3A1971063/counting-abelian-squares-efficiently-for-a-problem-in-quantum-computing
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.