Journal
PHYSICAL REVIEW D
Volume 98, Issue 4, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevD.98.046002
Keywords
-
Funding
- JSPS KAKENHI [JP15H03658, JP15K13483, JP17H06462, JP25800143]
- JSPS [JP16J01004]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available