Quantum information processing and composite quantum fields

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

RAMGOOLAM Sanjaye SEDLÁK Michal

Year of publication 2019
Type Article in Periodical
Magazine / Source Journal of High Energy Physics
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1007/JHEP01(2019)170
Doi http://dx.doi.org/10.1007/JHEP01(2019)170
Keywords 1; N Expansion; AdS-CFT Correspondence
Attached files
Description Some beautiful identities involving hook contents of Young diagrams have been found in the field of quantum information processing, along with a combinatorial proof. We here give a representation theoretic proof of these identities and a number of generalizations. Our proof is based on trace identities for elements belonging to a class of permutation centralizer algebras. These algebras have been found to underlie the combinatorics of composite gauge invariant operators in quantum field theory, with applications in the AdS/CFT correspondence. Based on these algebras, we discuss some analogies between quantum information processing tasks and the combinatorics of composite quantum fields and argue that this can be fruitful interface between quantum information and quantum field theory, with implications for AdS/CFT.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info