An official website of the United States government
A bstract Negativity is a measure of entanglement that can be used both in pure and mixed states. The negativity spectrum is the spectrum of eigenvalues of the partially transposed density matrix, and characterizes the degree and “phase” of entanglement. For pure states, it is simply determined by the entanglement spectrum. We use a diagrammatic method complemented by a modification of the Ford-Fulkerson algorithm to find the negativity spectrum in general random tensor networks with large bond dimensions. In holography, these describe the entanglement of fixed-area states. It was found that many fixed-area states have a negativity spectrum given by a semi-circle. More generally, we find new negativity spectra that appear in random tensor networks, as well as in phase transitions in holographic states, wormholes, and holographic states with bulk matter. The smallest random tensor network is the same as a micro-canonical version of Jackiw-Teitelboim (JT) gravity decorated with end-of-the-world branes. We consider the semi-classical negativity of Hawking radiation and find that contributions from islands should be included. We verify this in the JT gravity model, showing the Euclidean wormhole origin of these contributions.
more »
« less
Toward random tensor networks and holographic codes in CFT
A bstract In holographic CFTs satisfying eigenstate thermalization, there is a regime where the operator product expansion can be approximated by a random tensor network. The geometry of the tensor network corresponds to a spatial slice in the holographic dual, with the tensors discretizing the radial direction. In spherically symmetric states in any dimension and more general states in 2d CFT, this leads to a holographic error-correcting code, defined in terms of OPE data, that can be systematically corrected beyond the random tensor approximation. The code is shown to be isometric for light operators outside the horizon, and non-isometric inside, as expected from general arguments about bulk reconstruction. The transition at the horizon occurs due to a subtle breakdown of the Virasoro identity block approximation in states with a complex interior.
more »
« less
- Award ID(s):
- 2014071
- PAR ID:
- 10434466
- Date Published:
- Journal Name:
- Journal of High Energy Physics
- Volume:
- 2023
- Issue:
- 5
- ISSN:
- 1029-8479
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
A bstract Holevo information is an upper bound for the accessible classical information of an ensemble of quantum states. In this work, we use Holevo information to investigate the ensemble theory interpretation of quantum gravity. We study the Holevo information in random tensor network states, where the random parameters are the random tensors at each vertex. Based on the results in random tensor network models, we propose a conjecture on the holographic bulk formula of the Holevo information in the gravity case. As concrete examples of holographic systems, we compute the Holevo information in the ensemble of thermal states and thermo-field double states in the Sachdev-Ye-Kitaev model. The results are consistent with our conjecture.more » « less
-
A bstract Since the work of Ryu and Takayanagi, deep connections between quantum entanglement and spacetime geometry have been revealed. The negative eigenvalues of the partial transpose of a bipartite density operator is a useful diagnostic of entanglement. In this paper, we discuss the properties of the associated entanglement negativity and its Rényi generalizations in holographic duality. We first review the definition of the Rényi negativities, which contain the familiar logarithmic negativity as a special case. We then study these quantities in the random tensor network model and rigorously derive their large bond dimension asymptotics. Finally, we study entanglement negativity in holographic theories with a gravity dual, where we find that Rényi negativities are often dominated by bulk solutions that break the replica symmetry. From these replica symmetry breaking solutions, we derive general expressions for Rényi negativities and their special limits including the logarithmic negativity. In fixed-area states, these general expressions simplify dramatically and agree precisely with our results in the random tensor network model. This provides a concrete setting for further studying the implications of replica symmetry breaking in holography.more » « less
-
We provide the first tensor-network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor-network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We also introduce novel weight enumerators and their applications. In particular, we show that these enumerators can be used to compute logical error rates exactly and thus construct (optimal) decoders for any independent and identically distributed single qubit or qudit error channels. The enumerators also provide a more efficient method for computing nonstabilizerness in quantum many-body states. As the power for these speedups rely on a quantum Lego decomposition of quantum codes, we further provide systematic methods for decomposing quantum codes and graph states into a modular construction for which our technique applies. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the two-dimensional Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force. Published by the American Physical Society2024more » « less
-
Conventional holographic tensor networks can be described as toy holographic maps constructed from many small linear maps acting in a spatially local way, all connected together with “background entanglement”, i.e. links of a fixed state, often the maximally entangled state. However, these constructions fall short of modeling real holographic maps. One reason is that their “areas” are trivial, taking the same value for all states, unlike in gravity where the geometry is dynamical. Recently, new constructions have ameliorated this issue by adding degrees of freedom that “live on the links”. This makes areas non-trivial, equal to the background entanglement piece plus a new positive piece that depends on the state of the link degrees of freedom. Nevertheless, this still has the downside that there is background entanglement, and hence it only models relatively limited code subspaces in which every area has a definite minimum value. In this note, we simply point out that a version of these constructions goes one step further: they can be background independent, with no background entanglement in the holographic map. This is advantageous because it allows tensor networks to model holographic maps for larger code subspaces. In addition to pointing this out, we address some subtleties involved in making it work.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1007/JHEP05(2023)109
