On Maximum Complexity in Holography

TL;DR

This paper proposes a new holographic complexity measure that aligns with quantum circuit expectations, reaching maximum complexity exponentially in entropy and satisfying the Lloyd bound.

Contribution

It introduces a novel holographic complexity proposal that achieves exponential maximum complexity, addressing limitations of previous models.

Findings

Holographic complexity now reaches exponential in entropy

The new proposal aligns with quantum circuit complexity expectations

It consolidates the Lloyd bound in holographic complexity

Abstract

In a quantum circuit, it is believed that complexity itself reaches a maximum of order exponential in the number of q-bits or equivalently exponential in entropy of the black hole. However, the current holographic proposals do not meet this criterion. The holographic proposals find the complexity of the very late times to be linear in the entropy, while in the quantum circuit, it is expected that complexity meets within a finite time its maximum value in an exponential in the entropy. These points are required to be altered in holographic proposals of complexity. This paper introduces a new holographic proposal that meets this criterion and consolidates the Lloyd bound.