Counting abelian squares efficiently for a problem in quantum computing

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 a previously known formula but has substantially lower complexity for large d, a key improvement resulting in a practical solution to the original application.