Related papers: Hypergraph min-cuts from quantum entropies
We analyze few-body quantum states with particular correlation properties imposed by the requirement of maximal bipartite entanglement for selected partitions of the system into two complementary parts. A novel framework to treat this…
Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hypergraph sparsification has recently gained increasing…
Preparation of pure states on networks of quantum systems by controlled dissipative dynamics offers important advantages with respect to circuit-based schemes. Unlike in continuous-time scenarios, when discrete-time dynamics are considered,…
We extend the semiclassical black hole microstate construction to include quantum corrections to the microscopic entropy using a doubly holographic model of black holes. Specifically, we consider a double-sided black hole on a JT brane with…
The algebraic approach to quantum physics emphasizes the role played by the structure of the algebra of observables and its relation to the space of states. An important feature of this point of view is that subsystems can be described by…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…
In classical physics, entropy quantifies the randomness of large systems, where the complete specification of the state, though possible in theory, is not possible in practice. In quantum physics, despite its inherently probabilistic…
We describe the class (semigroup) of quantum channels mapping states with finite entropy into states with finite entropy. We show, in particular, that this class is naturally decomposed into three convex subclasses, two of them are closed…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
The scaling symmetry in conformal quantum mechanics (CQM) can be broken due to the boundary conditions that follow from the requirement of a unitary time evolution of the Hamiltonian. We show that the scaling symmetry of CQM can be restored…
Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In this paper we use their diagrammatic language to study graph states, a computationally interesting class of…
We construct a complete set of Wannier functions which are localized at both given positions and momenta. This allows us to introduce the quantum phase space, onto which a quantum pure state can be mapped unitarily. Using its probability…
We follow arguments of Verlinde and Klinkhamer, and construct two models of the microscopic theory of a holographic screen that allow for the thermodynamical derivation of Newton's law, with Newton's constant expressed in terms of a minimal…
The von Neumann entropy and the subentropy of a mixed quantum state are upper and lower bounds, respectively, on the accessible information of any ensemble consistent with the given mixed state. Here we define and investigate a set of…
We investigate the entanglement of the ground state in the quantum networks that their nodes are considered as quantum harmonic oscillators. To this aim, the Schmidt numbers and entanglement entropy between two arbitrary partitions of a…
The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot increase the information content of a quantum system by acting on it with a local physical operation. When the smooth…
We consider the density matrices derived from combinatorial laplacian matrix of graphs. Specifically, the star-relevant graph, which means adding certain edges on peripheral vertices of star graph, is the focus of this paper. Initially, we…
We investigate some properties of the entanglement of hypergraph states in purely hypergraph theoretical terms. We first introduce an approach for computing local entropic measure on qubit t of a hypergraph state by using the Hamming weight…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…