Counting abelian squares efficiently for a problem in quantum computing

DOI10.4310/JOC.2023.V14.N4.A3MaRDI QIDQ2699853zbMATH OpenOpenAlexFDO

Authors Ryan Bennink

Publication date 19 April 2023

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/joc.2023.v14.n4.a3

zbMATH Keywords

abelian squaresquantum circuit expressivenessquantum computingvariational methods

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Counting abelian squares
• scientific article; zbMATH DE number 6670068
• scientific article; zbMATH DE number 6792663
• An improved lower bound on the number of ternary squarefree words
• Efficient lower bounds on the number of repetition-free words

This page was built for publication: Counting abelian squares efficiently for a problem in quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2699853)