arXiv · 1805.04226
Thoughts on Holographic Complexity and its Basis-dependence
Abstract
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this minimality, it satisfies the triangle inequality, and can be regarded as a (discrete version of) distance in the Hilbert space. However, we show a no-go theorem that any basis-independent distance cannot reproduce the behavior of the holographic complexity. Therefore, if holographic complexity is dual to a distance in the Hilbert space, it should be basis-dependent, i.e., it is not invariant under a change of the basis of the Hilbert space.
Explore related subjects
Keep this discovery
Koji Hashimoto, Norihiro Iizuka, Sotaro Sugishita. 2018-05-11. Thoughts on Holographic Complexity and its Basis-dependence. https://doi.org/10.1103/physrevd.98.046002
Cite the original work for its findings. Save a collection to share your selection of sources.