Related papers: Hypergraph min-cuts from quantum entropies
Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models…
Stabilizer states are a prime resource for a number of applications in quantum information science, such as secret-sharing and measurement-based quantum computation. This motivates us to study the entanglement of noisy stabilizer states…
The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the…
Entanglement for pure bipartite states is most commonly quantified in a state-by-state manner to each pure state of a bipartite system a scalar quantity, such as the von Neumann entropy of a reduced density matrix. This provides a precise…
Even though little is known about the quantum entropy cone for $N\geq4$ subsystems, holographic techniques allow one to get a handle on the subspace of entropy vectors corresponding to states with gravity duals. For static spacetimes and…
The issue of black hole entropy is reexamined within a finite lattice framework along the lines of Wheeler, 't Hooft and Susskind, with an additional criterion to identify physical horizon states contributing to the entropy. As a…
Quantum entanglement entropy has a geometric character. This is illustrated by the interpretation of Rindler space or black hole entropy as entanglement entropy. In general, one can define a "geometric entropy", associated with an event…
We proposed two classes of multiparticle entangled states, the multigraph states and multihypergraph states, defined by unique operations on the edges and hyperedges. A key discovery is the one-to-one correspondence between the proposed…
We show via explicit construction that all the extreme rays of both the three-party quantum entropy cone and the four-party stabilizer entropy cone can be obtained from subsystem coarse grainings of specific higher-party quantum states,…
Hypergraph clustering is a basic algorithmic primitive for analyzing complex datasets and systems characterized by multiway interactions, such as group email conversations, groups of co-purchased retail products, and co-authorship data.…
The operational structure of quantum couplings and entanglements is studied and classified for semifinite von Neumann algebras. We show that the classical-quantum correspondences such as quantum encodings can be treated as diagonal…
We introduce a class of states characterized by proposed conditions of homogeneity and isotropy in loop quantum gravity and construct concrete examples given by Bell-network states on a special class of homogeneous graphs. Such states…
Hypergraph states are generalizations of graph states where controlled-$Z$ gates on edges are replaced with generalized controlled-$Z$ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain…
We show that every holographic entropy inequality can be recast in the form: "some entanglement wedges reach deeper in the bulk than some other entanglement wedges." When the inequality is saturated, the two sets of wedges reach equally…
Neural quantum states (NQS) are a novel class of variational many-body wave functions that are very flexible in approximating diverse quantum states. Optimization of an NQS ansatz requires sampling from the corresponding probability…
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. A cut is relevant if and only if it is the a minimum weight cut between two distinct vertices. Moreover, we give a characterization in terms of…
The minimal-length paradigm, a possible implication of quantum gravity at low energies, is commonly understood as a phenomenological modification of Heisenberg's uncertainty relation. We show that this modification is equivalent to a…