În afara temei aiqbench
Această știre a fost preluată de la o sursă pe care o urmărim, dar nu ține de domeniul AI sau cuantic, așa că nu există o perspectivă aiqbench pentru ea.
When does a state-dependent proto-area define a bulk geometry?
arXiv:2606.22598v3 Announce Type: replace-cross Abstract: A holographic code assigns a state-dependent entropy remainder to every boundary region, but such remainders need not be the extremal lengths of any one bulk metric. We study this common-source question for the proto-area of a calibrated recovery, the entropy of a boundary region minus that of the matter recovered from it. At zeroth order the reference values must match the lengths of one reference geometry in a fixed renormalization scheme, and this matching also determines the entropy-to-length factor. On a graph with a fixed minimum-cut chamber the data derivatives must lie in the image of the cut-incidence matrix, whose left null vectors are witnesses. On the hyperbolic disk the first variation of renormalized length is the rank-two geodesic X-ray transform, with closed range in an adapted data space, and the geodesic displacement, fixed by a forced Jacobi equation, enters at second order. The resulting normal Hessian gives a gauge-invariant criterion, necessary and sufficient, for a regular pair of response coefficients to come from one metric two-jet. For the constant-curvature family generated by a boundary reparametrization the Hessian has a nonzero rank-four mode, so the image of the length map is curved. For a fixed recovery the proto-area Hessian is minus the Bogoliubov-Kubo-Mori information lost in recovery, which the Petz map decomposes orthogonally at a product reference, and which, on a finite-dimensional space of logical directions with positive minimum retained fraction, is at most a sharp multiple of the retained information. Geometric realization requires this loss to reproduce the normal length Hessian on every interval. Two codes show that exact regional area operators can fail to sew into one graph geometry, and that a matched reference with vanishing first response can fail at second order. All criteria refer to one recovery branch and one extremal-surface branch.
Title:When does a state-dependent proto-area define a bulk geometry?
Abstract:A holographic code assigns a state-dependent entropy remainder to every boundary region, but such remainders need not be the extremal lengths of any one bulk metric. We study this common-source question for the proto-area of a calibrated recovery, the entropy of a boundary region minus that of the matter recovered from it. At zeroth order the reference values must match the lengths of one reference geometry in a fixed renormalization scheme, and this matching also determines the entropy-to-length factor. On a graph with a fixed minimum-cut chamber the data derivatives must lie in the image of the cut-incidence matrix, whose left null vectors are witnesses. On the hyperbolic disk the first variation of renormalized length is the rank-two geodesic X-ray transform, with closed range in an adapted data space, and the geodesic displacement, fixed by a forced Jacobi equation, enters at second order. The resulting normal Hessian gives a gauge-invariant criterion, necessary and sufficient, for a regular pair of response coefficients to come from one metric two-jet. For the constant-curvature family generated by a boundary reparametrization the Hessian has a nonzero rank-four mode, so the image of the length map is curved. For a fixed recovery the proto-area Hessian is minus the Bogoliubov-Kubo-Mori information lost in recovery, which the Petz map decomposes orthogonally at a product reference, and which, on a finite-dimensional space of logical directions with positive minimum retained fraction, is at most a sharp multiple of the retained information. Geometric realization requires this loss to reproduce the normal length Hessian on every interval. Two codes show that exact regional area operators can fail to sew into one graph geometry, and that a matched reference with vanishing first response can fail at second order. All criteria refer to one recovery branch and one extremal-surface branch.
114 pages, 5 figures. Revised and expanded, added zeroth-order matching, explicit second-order examples, and a discussion of RT phase transitions
arXiv:2606.22598 [hep-th]
(or arXiv:2606.22598v3 [hep-th] for this version)
https://doi.org/10.48550/arXiv.2606.22598 Focus to learn more arXiv-issued DOI via DataCite
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.
Text integral sub licența deschisă a publicației · 414 cuvinte
Subiecte conexe
State-dependent geometries from magic-enriched quantum codes
arXiv · 7 oct. 2026
A Red Line and Oversight Framework for Government AI Contracts
AI Alignment Forum · 18 iul. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026

Coherent (COHR) Q4 2026 Earnings Call Transcript
fool.com · 20 aug. 2026