Related papers: The Complexity of Being Entangled
We study the von Neumann and R\'enyi bipartite entanglement entropies in the thermodynamic limit of many-body quantum states with spin-s sites, that possess full symmetry under exchange of sites. It turns out that there is essentially a…
In this work, we make a connection between two seemingly different problems. The first problem involves characterizing the properties of entanglement in the ground state of gapped local Hamiltonians, which is a central topic in quantum…
We investigate a large-$N$ CFT in a high-energy pure state coupled to a small auxiliary system of $M$ weakly-interacting degrees of freedom, and argue the relative state complexity of the auxiliary system is holographically dual to an…
In quantum systems with infinitely many degrees of freedom, states can be infinitely entangled across a pair of subsystems, but are there different forms of infinite entanglement? To understand entanglement in such systems, we use a…
A long-standing challenge in mixed quantum-classical trajectory simulations is the treatment of entanglement between the classical and quantal degrees of freedom. We present a novel approach which describes the emergence of entangled states…
We argue that the requirement of a finite entanglement entropy of quantum degrees of freedom across a boundary surface is closely related to the phenomenon of running spectral dimension, universal in approaches to quantum gravity. If…
High-dimensional entanglement has been identified as an important resource in quantum information processing, and also as a main obstacle for simulating quantum systems. Its certification is often difficult, and most widely used methods for…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
Recently it has been shown that the complexity of SU($n$) operator is determined by the geodesic length in a bi-invariant Finsler geometry, which is constrained by some symmetries of quantum field theory. It is based on three axioms and one…
Optimization with constraints is a typical problem in quantum physics and quantum information science that becomes especially challenging for high-dimensional systems and complex architectures like tensor networks. Here we use ideas of…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
Bipartite entanglement entropies, calculated from the reduced density matrix of a subsystem, provide a description of the resources available within a system for performing quantum information processing. However, these quantities are not…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded…
The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption…
Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Yet, it is hard to evaluate it, due to the complex structures of quantum states. Here, we introduce a generic method to quantify the k…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
Generic high-dimensional bipartite pure states are overwhelmingly likely to be highly entangled. Remarkably, this ubiquitous phenomenon can already arise in finite-dimensional systems. However, unlike the bipartite setting, the entanglement…
We propose a new classification scheme for quantum entanglement based on topological links. This is done by identifying a non-rigid ring to a particle, attributing the act of cutting and removing a ring to the operation of tracing out the…