A study of circuit Complexity for Coherent States

Computational complexity is a popular quantity in quantum information theory. It has made huge strides in recent years in the study of black hole dynamics. A brief definition of complexity is the measure of how difficult it is to implement a task. For a quantum system, complexity evaluates the difficulty of preparing a quantum state from a given reference state by unitary transformations. However, in the dual gravity theory complexity has a geometric meaning. In some black hole context, Leonard Susskind and collaborators proposed two holographic conjectures. The Complexity=Volume (CV) states that complexity of the boundary field theory is dual to the volume of a co dimension one maximal surface that extends to the boundary of the Ads space. Complexity=Action (CA) posits that complexity of the boundary is the same as the action evaluated as an action on patch in the bulk defined as the Wheeler De Witt patch. In recent years, these two conjectures have initiated an extensive study of complexity. This thesis is also motivated by these conjectures and will investigate complexity in the field theory side of the story. Specifically, we will explore the complexity for coherent states. We will start with a review of different methods of computing complexity. Finally, we then investigate the complexity for coherent states by using the methods of circuit complexity and operator complexity

Grantor

Department of Mathematics and Applied Mathematics

Year dc:date.issued

2022

Author dc:creator

• Tladi, Mpho

Advisors dc:contributor.advisor

• Haque, Shajid
• Murugan, Jeffrey
• Weltman, Amanda

• Mathematics and Applied Mathematics

Handle dc:identifier.uri

http://hdl.handle.net/11427/37303

OAI identifier oai:identifier

oai:open.uct.ac.za:11427/37303