Abstract

In this paper, we relate the complexity for a holographic state to a simple gravitational object of which the growth rate at late times is equal to temperature times black hole entropy. We show that if this is correct, the thermodynamics of anti-de Sitter (AdS) black holes implies that for generic holographic states dual to static AdS black holes the complexity growth rate at late times will saturate the Lloyd bound at the high-temperature limit. In particular, for AdS planar black holes, the result holds at lower temperatures as well. We conjecture that the complexity growth is bounded above as $d\mathcal{C}/dt\ensuremath{\le}\ensuremath{\alpha}TS/\ensuremath{\pi}\ensuremath{\hbar}$ or $d\mathcal{C}/dt\ensuremath{\le}\ensuremath{\alpha}({T}_{+}{S}_{+}\ensuremath{-}{T}_{\ensuremath{-}}{S}_{\ensuremath{-}})/\ensuremath{\pi}\ensuremath{\hbar}$ for black holes with an inner horizon, where $\ensuremath{\alpha}$ is an overall coefficient for our new proposal. The conjecture passes a number of nontrivial tests for black holes in Einstein's gravity. However, we also find that the bound may be violated in the presence of stringy corrections.

Highlights

  • The speed of computation is a central topic in the field of quantum computations

  • We relate the complexity for a holographic state to a simple gravitational object of which the growth rate at late times is equal to temperature times black hole entropy

  • We show that if this is correct, the thermodynamics of anti-de Sitter (AdS) black holes implies that for generic holographic states dual to static AdS black holes the complexity growth rate at late times will saturate the Lloyd bound at the high-temperature limit

Read more

Summary

Introduction

The speed of computation is a central topic in the field of quantum computations. The importation notion that characterizes the computational speed of a quantum computer is called complexity. Complexity is defined by the minimal number of elementary operations (or logic gates) needed to build a target state of interest from a given reference state. One expects that any way to produce the target state through a given quantum circuit has already led to an upper bound on complexity. What the bound is remains a great mystery. Inspired by the Margolus-Levitin theorem [1], it was conjectured by Lloyd that [2]

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call