Pith. sign in

Tensor network decompositions for absolutely maximally entangled states

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Absolutely maximally entangled (AME) states of $k$ qudits (also known as perfect tensors) are quantum states that have maximal entanglement for all possible bipartitions of the sites/parties. We consider the problem of whether such states can be decomposed into a tensor network with a small number of tensors, such that all physical and all auxiliary spaces have the same dimension $D$. We find that certain AME states with $k=6$ can be decomposed into a network with only three 4-leg tensors; we provide concrete solutions for local dimension $D=5$ and higher. Our result implies that certain AME states with six parties can be created with only three two-site unitaries from a product state of three Bell pairs, or equivalently, with six two-site unitaries acting on a product state on six qudits. We also consider the problem for $k=8$, where we find similar tensor network decompositions with six 4-leg tensors.

citation-role summary

background 1

citation-polarity summary

fields

hep-th 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

The thread embodiment of holographic quantum entanglement

hep-th · 2025-01-18 · conditional · novelty 5.0

Holographic entanglement is represented by geodesic threads whose fluxes equal half conditional mutual information, and kinematic space is treated as the input board of a quantum circuit that reproduces holographic complexity.

citing papers explorer

Showing 1 of 1 citing paper.

  • The thread embodiment of holographic quantum entanglement hep-th · 2025-01-18 · conditional · none · ref 42 · internal anchor

    Holographic entanglement is represented by geodesic threads whose fluxes equal half conditional mutual information, and kinematic space is treated as the input board of a quantum circuit that reproduces holographic complexity.