English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Bell-network states are loop-quantum-gravity states that glue quantumpolyhedra with entanglement. We present an algorithm and a code that evaluatesthe reduced density matrix of a Bell-network state and computes itsentanglement entropy. In particular, we use our code for simple graphs to studyproperties of Bell-network states and to show that they are non-typical in theHilbert space. Moreover, we investigate analytically Bell-network states onarbitrary finite graphs. We develop methods to compute the R\'enyi entropy oforder p for a restriction of the state to an arbitrary region. In the uniformlarge-spin regime, we determine bounds on the entanglement entropy and showthat it obeys an area law. Finally, we discuss the implications of our resultsfor correlations of geometric observables.

Entanglement entropy of Bell-network states in LQG: Analytical and numerical results