Multiscale Entanglement Renormalization Ansatz: Causality and Error Correction

: Computational complexity reduction is at the basis of a new formulation of many-body quantum states according to tensor network ansatz, originally framed in one-dimensional lattices. In order to include long-range entanglement characterizing phase transitions, the multiscale entan-glement renormalization ansatz (MERA) deﬁnes a sequence of coarse-grained lattices, obtained by targeting the map of a scale-invariant system into an identical coarse-grained one. The quantum circuit associated with this hierarchical structure includes the deﬁnition of causal relations and unitary extensions, leading to the deﬁnition of ground subspaces as stabilizer codes. The emerging error correcting codes are referred to logical indices located at the highest hierarchical level and to physical indices yielded by redundancy, framed in the AdS-CFT correspondence as holographic quantum codes with bulk and boundary indices, respectively. In a use-case scenario based on errors consisting of spin erasure, the correction is implemented as the reconstruction of a bulk local operator.


Introduction
The quantum advantage refers to a computational complexity scaling with respect to the number of qubits (or in general qudits).For a simulation of a quantum system in a classical computer, this scaling translates into a prohibitively high resource demand.Nevertheless if we relax the most general scenario by focusing on systems characterized by short-range entanglement, tensor network techniques allow us to improve our classical computation capabilities in a stunning way.
The native framework of tensor systems exploits the use of Penrose diagrams [1] in order to pictorially represent tensor indices and their contraction.Tensor diagrams still play a fundamental role, since the optimization of index contraction constitutes a major obstacle in the computational effort minimization required in tensor network algorithms.
A proper formulation of quantum states according to the new ansatz was firstly obtained for one-dimensional spin systems, consisting of matrix product states (MPS) [2] presented in Section 2 and initially used in a completely different framework [3].In the mathematics literature, the same techniques were already known as Tucker (or tensor train) decompositions [4][5][6][7].
The requirement of new numerical approximation in ground states research was driven by the difference with respect to classical statistical mechanics, where the energy of states can be minimized locally, while this procedure breaks down in a general quantum system.The density matrix renormalization group (DMRG) [8,9] provided an incomparable efficiency by truncating the degrees of freedom endowed with less entanglement according to the Schmidt decomposition.This new recipe for the selection of effective subspaces in iterative renormalization group transformations was completely different with respect to the usual truncation over high energy degrees of freedom used in Wilson's renormalization.
The extension of tensor network techniques in a higher number of dimensions is still an ongoing development, leading to new tools as the tree tensor network (TTN), able to manage the observable evaluation at different levels of the hierarchy in an optimized manner with respect to tensor contractions by means of orthogonality centers [10].In Section 3, we will discuss the inclusion of algebraic decay for correlations characterizing phase transitions, which is achieved in MERA [11][12][13][14][15][16], where hierarchical layers include entanglement distillation at the price of introducing loops in the tensor network contraction.Such loops are avoided in augmented TTN [17] if we adopt just one initial layer of disentangler transformations in order to concentrate entanglement within spin blocks.
A widespread application of tensor networks techniques targets lattice gauge theories, concerning the characterization of ground states for both quantum electro-dynamics (QED) [18,19] and non-Abelian interactions [20,21].Time evolution is included as well through the simulations of QED dynamics concerning string-breaking and scattering phenomena [22][23][24], which are targeted also in noisy intermediate-scale quantum (NISQ) devices [24].
NISQ superconducting devices suffer with respect to the inclusion of entanglement among qubit triplets and more complex structures than pairs [25], thus leading to a shortrange entanglement which causes a comparable computational capability of tensor network techniques [26].This successful application for computational complexity reduction in the quantum framework intertwines with widespread applications in data science [27][28][29][30] and hierarchical tensor geometry [31][32][33].Hierarchical structures typify in machine learning some information filtering procedures, thus naturally framing tensor network renormalization for these applications, as made by means of wavelets [34].In general, the relation with statistical analysis is even deeper through the formulation of graphical models in terms of tensor diagrams, built by associating random variables with each node in order to reproduce neural network schemes [35][36][37][38].
In general machine learning procedures pursue the extrapolation of discrete or continuous variables.The last class is generally assessed by means of tomography tools, while the first discrete case is referred to as classification problems, consisting of missing label reconstruction.For our purposes, it is useful to stress that we can equivalently characterize Hamming's codes, which are commonly used in telecommunications.Logical bits play the same role as labels, protected against errors by a certain redundancy, which ensures our ability to recover their value after a transmission in a noisy channel.
The interface between tensor networks and quantum computing applications is enriched by emerging causal relations in MERA because they naturally frame the associated circuits within an error correction perspective.Hamiltonians are built up in Section 4 in terms of stabilizers in order to define the meaningful code space we wish to study as a ground subspace [39].This is the case in pure gauge theories for QED toric code [40], as well as including fermionic matter where the Gauss law defines physically meaningful states [18][19][20][21][22][23].Quantum device realization targets subspace protection against errors as well, like in quantum communications in terms of complexity reduction [41].
In a quantum error correcting code, the subspace we wish to protect by redundancy is referred to logical indices: according to the holographic duality, such inputs live in the bulk, while redundant outputs define the physical lattice at the boundary [42,43] of the holographic codes presented in Section 5.The error correction for a probabilistic spin erasure consists of bulk operator reconstruction, which requires only physical spins at the boundary causally connected with it, as discussed in Section 6.
The main purpose of this paper targets a summary of tensor network methods from both a computational complexity perspective and a coding theory one, bridged together as exemplified by the construction of an anti-de Sitter spacetime disk.Reconstruction of logical labels represents a fruitful topic with respect to possible interfaces among quantum computing, sensing, and data science applications.Simulating hyperbolic spacetime will bring together the aforementioned perspectives, thus leading towards a promising interdisciplinary cross-contamination.

MPS in a Nutshell
The simplest scenario required to frame tensor network methods is referred to onedimensional lattices.Each physical site s of a lattice L hosts a spin, such that the state |ψ ∈ H L = s∈L H s , whose complexity is known to be exponentially hard with respect to the number of spins N, since the Hilbert space dimension is dim In order to face the rapidly increasing demand for computational resources, we need to reduce the number of degrees of freedom by identifying those containing the most relevant amount of information.DMRG numerical methods [8] introduced the efficient cut-off over the Schmidt decomposition components endowed with a coefficient below a certain threshold.This scheme is generalized in terms of MPS [9] based on an iterative reshaping of coefficient arrays and applications of singular value decomposition (SVD).
In general, an SVD corresponds to the Schmidt decomposition for a properly reshaped array of state coefficients: depending on the chosen bipartition of the lattice, uniquely determined in the one-dimensional case where Λ is a diagonal matrix containing Schmidt coefficients (or singular values) λ a .Physical indices grouped within parenthesis, i.e., (. . .), are in general referred to matrix unfolding for tensors [6], such that by introducing the conventional MPS notation used in Figure 1 with rank−3 tensors A with |a a = ∑ s 1 ,...,s A  The reason underlying the dummy index in both rank−3 tensors is related to our choice of an open boundary condition for simplicity.Indeed, we can consider Equation (3) as a first iterative step by imposing = 1 and reshaping The iteration of the reshaping and SVD sequence up to a new generic site s yields further elaborated by adopting the reshaping with the introduction of right-normalized matrices B s N ,1 (7) according to the diagrammatic scheme in Figure 1b.

From DMRG to MERA
A polynomial growth of computational complexity is obtained by truncating the number of singular values at each step.A constant dimension imposed for virtual indices along links equal to χ is named bond dimension [10].It is chosen with respect to residual error given by the sum of squared neglected singular values, affecting the trace of density matrices.
In general, the efficient selection of degrees of freedom is referred to a renormalization group transformation [11].A block B ⊂ L of neighboring sites is mapped into an effective coarse-grained site s corresponding to a subspace S B ⊆ H B = s∈B H s .An isometry maps the effective lattice L into the original one L w : in DMRG based on the truncation of spectral decompositions of the reduced density matrix [B] = Tr L\B |ψ ψ| on B, such that S B = | 1 , . . ., | χ .The bond dimension χ is referred to the eigenvectors endowed with highest eigenvalues in order to express the amount of entanglement between B and the remaining part of the lattice L \ B: chosen with respect to a threshold ε 1, such that According to the technique presented in Section 2, given a block B = {s 1 , s 2 }, we have to properly reshape the coefficient array c (s 1 ,s 2 ),(s 3 ,...,s N ) in order to select singular values λ i of an SVD and associated left-and right-eigenvectors, schematically represented in Figure 2a.DMRG proved high practical value, but it fails to satisfy the condition related to scale-invariant systems as fixed point, because after a sufficiently high number of iterations the effective sites are unaffordably large.MERA eliminates the growth of the effective site Hilbert space dimension such that a scale-invariant system is mapped to a coarse-grained identical one, unveiling a stratification of entanglement in extended systems [11,12].
This new ansatz is represented in Figure 2b, and it is based on reducing the amount of entanglement between B and L \ B by deforming the boundaries of the former through a unitary transformation.In the aformentioned example of a block B composed by two spins {s 1 , s 2 } with r 1 and r 2 adjacent on the left and right, respectively, we introduce disentanglers In this way, we reduce short-range entanglement such that a smaller effective rank χ < χ is obtained: assuming a lattice composed by N = 4 sites for simplicity.We have to underline that in general, the block B does not become completely disentangled because only entanglement localized near its boundary can be removed.Each layer of a MERA consists of disentanglers U τ = N τ i=1 u i and isometries W τ = N τ i=1 w i , where the index τ identifies in the hierarchical sequence a lattice L τ with N τ spins.We denote each step from a coarse-grained level to a finer-grained one as shown in Figure 3, where for increasing τ, we move towards higher layers in the hierarchy.
Two layers of a MERA acting with disentanglers for qubit pairs.A causal cone in the future or in the past is delimited by a dashed green and red line, respectively.
The evaluation of observable rule optimizations in tensor network contractions are as those made in a TTN by exploiting orthogonality centers [10].Corresponding to each lattice L τ in the hierarchy, observables belong to the algebra su(2 N τ ).A renormalization map (E * ) τ τ−1 lifts an operator O τ−1 into the above layer: thus named the renormalized operator.In general the layer sequence can be framed in a sequence of moments defining a circuit C , where each site is identified with a wire labeled with the same index s.Causal cones consist of sub-circuits ruled by the following partial order relation [12,15].For the spins subset 2 , . . .} ⊆ L τ , we consider those bonds for each s [τ] i ∈ S [τ] connecting to other sites s , . . .for a causal relation in the past or s , . . . in the future.We can introduce causally connected subsets ⊆ L τ±1 and by iteration [42] C [S [τ] ] P = Θ k=τ+1 S [k] , C [S [τ] ] for the causal cone in the past or future, respectively, where Θ = O(log N) is the circuit depth because of the tree structure.
The renormalization map into a lattice with fewer spins targets the lift of the observable O τ−1 evaluation from L τ−1 to L τ by considering sites causally connected in the coarsegrained lattice with those interested by the observable action in the finer-grained one: The sites interested by the evaluation in a lower hierarchical layer can be referred to nonadjacent spin blocks, like in the case of correlations, where we may consider the product of a local observable measured in different regions in order to study a ground state near to a quantum criticality.MERA encodes more efficiently this information since it supports algebraic decay of correlations.
For two sites, s 1 and s 2 , separated by a distance r in the physical lattice L 0 , the corresponding causal cones C [s 1 ] and C [s 2 ] reach a block of contiguous sites at L τ , where τ = log 2 r.In order to compute [s 1 s 2 ] from τ , we use a sequence { τ , . . ., 2 , 1 , [s 1 s 2 ] }, that requires O(log r) transformations.In a scale-invariant critical ground state, each of these transformations reduces correlations by a constant factor z < 1, such that the algebraic decay of correlations is obtained: where q = log 1 z > 0 [11,12].

Encoding by Redundancy
Classical error correction schemes based on data replication cannot be translated straightforwardly into NISQ devices because of the no-cloning theorem.Quantum error correction exploits encoding maps able to establish a one-to-one correspondence between the logical qubits we need to protect from errors and a subspace, named code space, in a higher dimensional Hilbert space obtained by introducing some ancillary qubits [39].A simple example of qubit redundancy consists of a single logical qubit |ψ = α |0 + β |1 , with |α| 2 + |β| 2 = 1, mapped into a two-dimensional code space by means of the encoding where the ancilla represents the CNOT target qubit, while the control one is referred to |ψ .Remaining states {|01 , |10 } span the error subspace, which could be partially populated during the elaboration of E [|ψ ] by a certain circuit.The detection of such events is implemented by measuring Z ⊗ Z, which is said to stabilize the logical qubit since thus named the stabilizer measurement, with any bit-flip error lying in the (−1)-eigenspace.
In general, a stabilizer code takes into account K logical qubits |ψ , with = 1, . . ., K, and N physical qubits obtained by redundancy encoding E , whose Pauli group G N is defined as the set of all operators formed by tensor products of matrices in {±1, ±i1, ±X, ±iX, ±Y, ±iY, ±Z, ±iZ}.
Stabilizers define an Abelian subgroup where any product P i P j is a stabilizer because the property P i P j |ψ = (+1)P i |ψ = (+1) |ψ holds true.In the error detection process, the set of M = N − K measured stabilizers have to define a minimal set: such that any element G i cannot be obtained as a product among remaining elements.

Ising Model
In order to frame a MERA in a quantum error-correcting code, we have to consider the top layer Θ with K logical qubits as the circuit input and the bottom layer as the output with N physical qubits, such that the encoding map reads with the action over states E [ ] = V V † consisting of an isometric quantum channel, with a dual channel referred to the renormalization map E * .Each isometry is endowed with a unitary extension w |ψ = U w (|ψ ⊗ |ϕ ), yielding a unitary quantum circuit of depth Θ and width N, called the unitary extension of the MERA [14,15].
A simple example consists of the Ising model without an external field over a onedimensional lattice with periodic boundary conditions: where indices x include the identification N ≡ 0. The Hamiltonian is characterized by a two-dimensional degenerate ground subspace, admitting a simple MERA representation with disentanglers equal to the identity, namely a TTN.The non-required disentanglers are caused on a physical ground by the absence of any phase transition because of the missing external field [11].
The ground subspace is a stabilizer code with stabilizer generators {Z x Z x+1 } N−2 x=0 , so with one term less than those included in Equation ( 24), because ∏ N−1 x=0 Z x Z x+1 = 1 ⊗N for periodic boundaries, thus missing independence for composition of stablizers by multiplication with neutral element 1 ⊗N .The number of independent generators is M = N − 1, such that the code space dimension is 2 K = 2 N−M = 2.The unitary extension of isometries is a CNOT, as shown in Figure 4, where a dangling index in the triangle center is referred to the target qubit, i.e., w |ψ = CNOT |ψ ⊗ |0 , chosen as |0 since it is the (+1)-eigenstate of Z.The conjugation by CNOT towards the higher layer yields the renormalized operators we are interested in: States encoded by this TTN are (+1)-eigenstates of any stabilizer generator, because by exploiting (i) for Z x Z x+1 referred to the same isometry, we obtain in the higher layer 1 ⊗ Z with Z |0 = |0 acting like the identity.Instead, for Z x Z x+1 related with two isometries, in the form 1 ⊗ Z ⊗ Z ⊗ 1, we obtain for the first qubit pair CNOT(1 ⊗ Z)CNOT = Z ⊗ Z, while for the second pair we exploit (ii), thus obtaining in the higher layer Z ⊗ Z ⊗ Z ⊗ 1, where the second operator Z |0 = |0 acts like the identity, namely a coarse-grained spin interaction term.In this way, the number of stabilizer generators is reduced to N 2 − 1 in the higher layer [14].

Toric Code
Topological codes are based on patching together repeated elements, which generates a size scaling still ensuring stabilizer commutativity.In particular, toric (or equivalently surface) codes are promising for current NISQ devices because they require just nearestneighbor interaction [39].
Each layer is a two-dimensional lattice, with disentanglers and isometries acting on blocks composed by 16 qubits [13].The qubits are arranged in an N × N square lattice with periodic boundary conditions, i.e., a torus, and they occupy edges, such that the total number of qubits is 2N 2 , as physically realized in pure gauge theories for QED with a Z 2 discretization [40].
Stabilizer generators consist of star operators, the tensor product of four Pauli X matrices acting on edges connected to the same vertex, and plaquette operators, the tensor product of four Pauli Z matrices acting on edges composing the smallest four-cycle of the lattice.Like the Ising model presented in Section 4.1, we define a Hamiltonian expressed in terms of stabilizer generators: where X + and Z are star and plaquette operators, respectively, such that the ground subspace corresponds to the (+1)-eigenspace of stabilizers.The lattice periodicity imposes 2N 2 − 2 independent generators, thus yielding a code space dimension equal to 2 K = 2 2N 2 −(2N 2 −2) = 4, associated with the degrees of freedom of a torus, consisting of non-contractible cycles depicted in Figure 5a.(c-e) focus on the shifted purple block (isometry), with blue arrows representing CNOT pointing towards target qubits [13].
We need to introduce remaining conjugation by CNOT, because of star operators: where the former motivates the use of |+ as control qubits, the (+1)-eigenstate for X.Lattice blocks in Figure 5b-e for renormalization are tilted and the four qubits referred to a vertex of the coarse-grained layer are denoted in black, while twelve qubits included in the finer-grained layer are depicted in red.Half of the latter are stabilized by X and the remaining one by Z: as presented in Section 4.1 for the Ising model, stabilized qubits will take into account interacting terms which disappear in the coarse-grained layer [14], e.g., plaquette terms in panel (b) by exploiting CNOT conjugation introduced in Section 4.1.
The same is verified for plaquettes in panels (c,d), whose removal leads to the renormalized lattice with a doubled spacing in panel (e).In the opposite encoding direction, it is proved in [13] that the action of CNOTs, endowed with |0 or |+ as target and control qubits, respectively, defines new plaquettes or vertices including the qubits of the coarse-grained layer involved in aforementioned gates, as shown in Figure 5b-e.Among star operators, like the ones which disappear in the higher level by composing conjugations in panels (b,c) or (d,e), there is one term corresponding to the center of disentanglers in panel (b) just acting like the identity on stabilized |+ qubits in panel (e).

Holographic Error Correcting Codes
In the AdS-CFT correspondence, the radial direction can be regarded as a renormalization scale and spacial slices have a hyperbolic geometry, like the exponentially growing MERA tensor network [42].In general, an anti-de Sitter space is characterized by the metric denoted as a (µ + ν)-dimensional space.We will focus on fixed time slices with periodic boundary of a cylindrical (1 + 2)-dimensional de Sitter space, as represented in Figure 6.Each fixed-time slice is a geometric manifold Σ, whose boundary contains the physical degrees of freedom of the spin lattice.
The considered periodic lattice composed of 2N qudits, a general case for d-dimensional spins, is described by a pure quantum state |ψ .The set of indices of its coefficients tensor c s 1 ...s 2N is divided into a subset A and its complement B, with |A| + |B| = 2N.In this way we map the span of indices in A to the one of those in B. A tensor is perfect if, for any bipartition with |A| ≤ |B|, it is proportional to an isometric tensor from A to B, i.e., ∑ b (c ba ) † c ba ∝ δ a a .If c is a unitary transformation when |A| = |B| = N, then it is perfect.States described by perfect tensors are called absolutely maximally mixed.If |A| = 1 and |B| = 2N − 1, the perfect tensor is an isometric encoding map of a quantum error correcting code, which encodes a single logical spin in a 2N − 1 physical block, with code distance equal to N. A holographic quantum state is related to a MERA composed of perfect tensors, which cover some geometric manifold Σ associated with a fixed-time slice, where all the interior indices are contracted and physical degrees of freedom are referred to uncontracted legs at the boundary.If there are some open uncontracted legs consisting of bulk indices or logical inputs, like in the case of unitary extensions of isometries, the MERA describes a holographic quantum code, giving rise to an isometric map from bulk to boundary indices.
Holographic states reproduce key properties of the AdS-CFT correspondence, as expressed by the Ryu-Takayanagi formula: in any static state the entropy S A of a boundary block A at fixed time is where G is the Newton's gravitational constant and γ A is the minimal area bulk surface whose boundary matches ∂A.In our simple example, we are dealing with γ A consisting of a bulk geodesic, whose length correspond to Area (γ A ).
In the discrete tensor network setting, γ A is a cut partitioning into two disjoint sets of perfect tensors.Such sets will be denoted with P and Q, as in Figure 7, with some contracted legs along the cut γ, whose number is called the length of γ, namely |γ|.Let A be a subset of uncontracted physical legs along the boundary corresponding to P, and its complement B is referred to Q, such that the boundary of the cut γ is said to match with the boundary of A.
The minimal bulk geodesic γ A bounded by A corresponds to the cut γ with shortest length.The non-normalized holographic state is expressed in terms of bases |a and |b of A and B, respectively where runs over all possible values of indices contracted along γ.The trace over B yields the reduced density operator on A: whose rank is equal at most to d |γ| , the number of terms in the sum over contracted indices.The maximal Von Neumann entropy is bounded by choosing the shortest length cut γ = γ A : which is saturated if P and Q are isometries from the cut to A and B, respectively.For a simply connected planar tensor network of perfect tensors ruled by a non-positive curvature graph, any connected block A on the boundary saturates the inequality in Equation (30).
The research of a bulk cut γ * representing a local minimum of the length is implemented by a greedy algorithm.The iterative scheme generates a sequence of cuts {γ α } bounded by A, with corresponding isometries {P α }, such that a local move in the bulk drives the following step from the previous one.Initially, the trivial cut corresponding the boundary block A itself is considered, followed by the inclusion in a new isometry P α+1 of a perfect tensor characterized by at least half of its legs contracted with P α , as shown in Figure 7. Once the stopping condition is reached, with no more possible local moves, the optimal bulk geodesic γ * is obtained.Given a connected boundary region A, the set of bulk points reached in the greedy algorithm defines the causal wedge C [A], shown in Figure 6b [42].

Discussion and Conclusions
Any bulk operator φ(x) referred to a point x ∈ C [A] can be represented as some non-local operators on the boundary region A. The reconstruction of φ(x) is interpreted as correcting spin erasure in B: operators near the bulk center are protected because a large boundary block has to be erased in order to prevent their reconstruction.
Causally connected regions in MERA with a spin block A in the physical lattice establishes the relation with quantum error correction based on the no-cloning theorem.Indeed, the expectation of an observable referred to the physical lattice block A can be reconstructed as the one of an observable lifted by a sequence of isometries and disentanglers: such correspondence is related with holographic AdS-CFT duality between bulk and boundary.The causal relation imposes a condition: if the remaining part of the physical lattice B is not correlated, any spin erasure in the latter does not concern the information shared by the aforementioned observables, the initial and the lifted one.This statement is caused by the no-cloning theorem because it is not possible to clone any information in the remaining part of the lattice as a third party: the information in the bulk lifted observable is protected by any erasure of spins in a product state.
The reconstruction of an operator φ(x) referred to a fixed bulk point changes by moving the block of sites on the boundary: the non-uniqueness of the operator on the boundary leads to the perspective of the bulk operator as a logical one, preserving a code space of the boundary Hilbert space.This code space can be interpreted as the low-energy sector, because local bulk operators correspond to non-local boundary ones.
As a use-case scenario, we consider a probabilistic noise model, where each spin in the boundary is erased with probability p, such that the connected block A breaks into many connected islands.We would like to characterize a code able to correct errors if p is less than a threshold.The greedy algorithm propagates erasure of spins in the boundary towards the bulk center, where local operators cannot be reconstructed if the number of errors exceeds a threshold, since the recovery is not possible if a non-trivial logical operator has support on the erased qudits.
To obtain more resilient codes, we have to modify the holographic code by thinning out the algebra of bulk logical operators, thus reducing the code rate, namely the number of logical qudits over the number of physical ones.A useful strategy consists of alternating tensors with a dangling index with those completely contracted, thus mimicking unitary extensions of MERA, as shown in Figure 6a for the pentagon/hexagon code [42].
A properly defined limit of continuous MERA leads to the study of continuous de Sitter space [15,[44][45][46], which is potentially simulated by means of a quantum optics tensor network technique making use of the same real-space renormalization [47].

Figure 1 .
Figure 1.Diagrammatic notation: (a) contraction of the virtual index for a single SVD as expressed in Equation (3) and (b) a mixed-canonical MPS in Equation (7) obtained by means of SVD iterations.Non-contracted physical indices are explicitly shown.

Figure 2 .
Figure 2. Coarse-graining schemes for a block B composed of two spins {s 1 , s 2 } implemented according to DMRG and MERA in panel (a) and (b), respectively.

Figure 4 .
Figure 4. Representation of a TTN for the Ising model without external field through unitary extensions (a) obtained by including a new dangling index denoted with a black circle in each isometry.The TTN is equivalent to the circuit is in (b).

Figure 5 .
Figure5.Non-contractible cycles related to a torus degrees of freedom in (a), where black qubits are in a spin down state, while spin up is associated with blue ones.Sequence of disentanglers and isometries in (b-e): panel (b) is centered on the orange block (disentangler), while remaining ones (c-e) focus on the shifted purple block (isometry), with blue arrows representing CNOT pointing towards target qubits[13].

Figure 6 .
Figure 6.Holographic code with alternating layers of pentagons, with a bulk index and completely contracted hexagons in (a).Given a boundary time slice Σ, the green lines identify the spacetime extent of a causal wedge C [A] referred to a boundary block A in (b), where it is possible to reconstruct operators at x, since x ∈ C [A].Any bulk operator acts on dangling indices of holographic code isometries in (a), which is a tensorial representation of a time slice Σ [42].

Figure 7 .
Figure 7. Representation of a cut pair {γ α , γ α+1 } in the greedy algorithm bounded by the boundary block A for contracted internal legs between tensors P and Q [42].