Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research refines the Ryu-Takayanagi formula by introducing capacity of entanglement to resolve ambiguities in entropy identification for single quantum states. By establishing dimension-free bounds, the study clarifies how holographic geometries constrain one-shot entropic quantities without relying on asymptotic limits of large Hilbert spaces. These advances deepen our theoretical understanding of the relationship between geometric area and information theoretic measures in quantum gravity.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

The Capacity of Entanglement and Holographic Entropies at Finite Resources

arXiv3 min read

arXiv:2608.26377v1 Announce Type: cross Abstract: The Ryu-Takayanagi formula equates the area of a minimal surface with the von Neumann entropy of a boundary subregion, and leaves two things about that identification open. The first is how sharply a geometry fixes an entropy. Fannes-Audenaert answers with a Hilbert-space dimension, which diverges as the cutoff is removed however close the two states are. We replace it with the capacity of entanglement, the variance of the modular energy, whose square root grows like the square root of the entangling area where the dimensional factor grows like the regulated volume. The bound is dimension-free and saturated, and it makes the ambiguity of the entropy subextensive for any perturbation whose capacity is small compared with $S_{vN}^2$ times the trace norm. The second is what the area means for a single state, since compression and dilution rates are defined only for many copies while a geometry describes one. When a single replica saddle dominates near $\alpha = 1$, every smooth R\'{e}nyi entropy at fixed $\alpha > 1$ agrees with $S_{vN}$ to $\textit{O}(\sqrt{S_{vN}})$, as do the smooth min- and max-entropies. The minimal surface therefore fixes every one-shot entropy of the state at once, with large central charge playing the role of large copy number in the asymptotic equipartition property. As a consequence we bound how far outside the holographic entropy cone a holographic state can appear to fall, leaving estimation and certification open.

Abstract:The Ryu-Takayanagi formula equates the area of a minimal surface with the von Neumann entropy of a boundary subregion, and leaves two things about that identification open. The first is how sharply a geometry fixes an entropy. Fannes-Audenaert answers with a Hilbert-space dimension, which diverges as the cutoff is removed however close the two states are. We replace it with the capacity of entanglement, the variance of the modular energy, whose square root grows like the square root of the entangling area where the dimensional factor grows like the regulated volume. The bound is dimension-free and saturated, and it makes the ambiguity of the entropy subextensive for any perturbation whose capacity is small compared with $S_{vN}^2$ times the trace norm. The second is what the area means for a single state, since compression and dilution rates are defined only for many copies while a geometry describes one. When a single replica saddle dominates near $\alpha = 1$, every smooth Rényi entropy at fixed $\alpha > 1$ agrees with $S_{vN}$ to $\textit{O}(\sqrt{S_{vN}})$, as do the smooth min- and max-entropies. The minimal surface therefore fixes every one-shot entropy of the state at once, with large central charge playing the role of large copy number in the asymptotic equipartition property. As a consequence we bound how far outside the holographic entropy cone a holographic state can appear to fall, leaving estimation and certification open.

arXiv:2608.26377 [hep-th]

(or arXiv:2608.26377v1 [hep-th] for this version)

https://doi.org/10.48550/arXiv.2608.26377 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 322 words

Related coverage