SciPost Submission Page
From black hole interior to quantum complexity through operator rank
by Alexey Milekhin
Submission summary
| Authors (as registered SciPost users): | Alexey Milekhin |
| Submission information | |
|---|---|
| Preprint Link: | scipost_202601_00039v1 (pdf) |
| Date submitted: | Jan. 16, 2026, 7:45 p.m. |
| Submitted by: | Alexey Milekhin |
| Submitted to: | SciPost Physics |
| Ontological classification | |
|---|---|
| Academic field: | Physics |
| Specialties: |
|
| Approach: | Theoretical |
Abstract
It has been conjectured that the size of the black hole interior captures the quantum gate complexity of the underlying boundary evolution. In this short note we aim to provide a further microscopic evidence for this by directly relating the area of a certain codimension-two surface traversing the interior to the depth of the quantum circuit. Our arguments are based on establishing such relation rigorously at early times using the notion of operator Schmidt rank and then extrapolating it to later times by mapping bulk surfaces to cuts in the circuit representation.
Author indications on fulfilling journal expectations
- Provide a novel and synergetic link between different research areas.
- Open a new pathway in an existing or a new research direction, with clear potential for multi-pronged follow-up work
- Detail a groundbreaking theoretical/experimental/computational discovery
- Present a breakthrough on a previously-identified and long-standing research stumbling block
Author comments upon resubmission
I would like to thank the referees for very stimulating questions. There is a considerable overlap in their questions, so let me list all changes in one section.
-
I tried to make the Introduction more clear by stating what assumptions I invoke about the underlying physical system and make the structure of the argument more clear. Inequalities (2) [between entanglement entropy and complexity] are established rigorously for any discrete circuit evolution and are valid beyond holography. Then I invoke the standard holographic dictionary for obtain (3) [area of RT surface and entanglement entropy]. Together, (2) and (3) at early times lead to (1), which is the main statement of the paper. This also allows one to by-pass involved discussions of UV-regularization of field-theoretic complexity mentioned by one of the reviewers. Finally, I give heuristic arguments why (1) must hold for later times.
-
I made some sloppy statements more sharp: I provided the exact value of $r$ for brickwork circuits. Also the approximate sign in (6) (previously (5)) was changed to equality sign. [originally, it meant to symbolize that there is gauge freedom in the decomposition as well as possible omission of very small singular values, but it is too vague and not really needed for the argument]
-
Regarding the tightness of the bound: it is true that in a general situation von Neumann entropy and log of the rank might differ considerably. Surprisingly, holographic complexity and the area of HM surface has the same asymptotic growth: $t/\beta$ up to a constant. So the bound is very close to saturation. I offer more comments on this in the Discussion section.
-
Finally, prompted by one of the referees I discuss the situation with Python's lunch. My conclusion is that the arguments in this paper are sensitive to the presence of the bulge but do not produce exponentially large (in $1/G_N$) factors in the conjecture. It is easy to understand why: the present argument only cares about the number of gates, all of the are assumed to have equal weight. Whereas the Python's lunch conjecture argues that non-unitary gates are very expensive due to post-selection. So, strictly speaking, the lower bound in this paper remains valid, but becomes very loose.