Related papers: The Quantum Entropy Cone of Hypergraphs
We use a simple holographic toy model to study global quantum quenches in strongly-coupled, hyperscaling-violating-Lifshitz quantum field theories using entanglement entropy as a probe. Generalizing our results in arxiv:1705.10324 , we show…
We revisit the issue of defining the entropy of a spatial region in a broad class of quantum theories. In theories with explicit regularizations, working within an elementary but general algebraic framework applicable to matter and gauge…
In this article, we present a novel approach to investigating entanglement in the context of quantum computing. Our methodology involves analyzing reduced density matrices at different stages of a quantum algorithm's execution and…
The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
We investigate the quantum networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information one part of a network shares with the other part of…
The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the…
While entanglement is a cornerstone of quantum theory and holography, quantum correlations arising from superposition, such as quantum discord, offer a broader perspective that has remained largely unexplored in holography. We construct…
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…
Entanglement entropy quantifies the amount of uncertainty of a quantum state. For quantum fields in curved space, entanglement entropy of the quantum field theory degrees of freedom is well-defined for a fixed background geometry. In this…
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…
The holographic entanglement entropy for the most general higher derivative gravity is investigated. We find a new type of Wald entropy, which appears on entangling surface without the rotational symmetry and reduces to usual Wald entropy…
We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…
The $n$-qubit stabilizer states are those left invariant by a $2^n$-element subset of the Pauli group. The Clifford group is the group of unitaries which take stabilizer states to stabilizer states; a physically--motivated generating set,…
The geometric entanglement entropy of a quantum field in the vacuum state is known to be divergent and, when regularized, to scale as the area of the boundary of the region. Here we introduce an operational definition of the entropy of the…
We compute the entanglement entropy in a composite system separated by a finitely ramified boundary with the structure of a self-similar lattice graph. We derive the entropy as a function of the decimation factor which determines the…
The holographic entanglement entropy is computed for an entangling surface that coincides with the horizon of a boundary de Sitter metric. This is achieved through an appropriate slicing of anti-de Sitter space and the implementation of a…
The valence-bond structure of spin-1/2 Heisenberg antiferromagnets is closely related to quantum entanglement. We investigate measures of entanglement entropy based on transition graphs, which characterize state overlaps in the overcomplete…
The contraction map proof method is the commonly used method to prove holographic entropy inequalities. Existence of a contraction map corresponding to a holographic entropy inequality is a sufficient condition for its validity. But is it…