Browsing by Author "Haque, Shajid"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Open Access
    A study of circuit Complexity for Coherent States
    (2022) Tladi, Mpho; Haque, Shajid; Murugan, Jeffrey; Weltman, Amanda
    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
  • No Thumbnail Available
    Item
    Open Access
    A study on complexity
    (2023) Rapotu, Dimakatso; Haque, Shajid; Murugan Jeffrey
    This thesis explores quantum complexity for various quantum systems. Quantum complexity is a well defined quantity in quantum information theory that measures the difficulty of constructing a quantum state from a given reference state and so far, various methods within high energy physics communities have been proposed for computing complexity. In this thesis, we will first review the computations of the different methods used for computing complexity, such as the circuit complexity that uses the wave function, Fubini-Study complexity, and finally the recently proposed Krylov complexity for closed quantum systems. We then extend our investigation and review the complexity for some open quantum systems that have already been explored in literature and finally, we will make some progress by also extending the investigation towards computing the complexity of a new open quantum system, namely the non-gaussian random matrix model.