Related papers: The Complexity of Being Entangled
Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify…
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki…
Entanglement is a unique nature of quantum theory and has tremendous potential for application. Nevertheless, the complexity of quantum entanglement grows exponentially with an increase in the number of entangled particles. Here we…
This topical review article reports rapid progress on the generalization and application of entanglement in non-Hermitian free-fermion quantum systems. We begin by examining the realization of non-Hermitian quantum systems through the…
Quantum mechanics exhibits a wide range of nonclassical features, of which entanglement in multipartite systems takes a central place. In several specific settings, it is well known that nonclassicality (e.g., squeezing, spin squeezing,…
The entanglement production in bipartite quantum systems is studied for initially unentangled product eigenstates of the subsystems, which are assumed to be quantum chaotic. Based on a perturbative computation of the Schmidt eigenvalues of…
Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed…
Quantifying quantum entanglement is a pivotal challenge in quantum information science, particularly for high-dimensional systems, due to its computational complexity. This thesis extends the geometric measure of entanglement (GME) to…
We analyze the properties of entangled random pure states of a quantum system partitioned into two smaller subsystems of dimensions $N$ and $M$. Framing the problem in terms of random matrices with a fixed-trace constraint, we establish,…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
We advance holographic constructions for the entanglement negativity of bipartite states in a class of $(1+1)-$dimensional Galilean conformal field theories dual to asymptotically flat three dimensional bulk geometries described by Einstein…
We study Nielsen complexity and Fubini-Study complexity for a class of exactly solvable one dimensional spin systems. Our examples include the transverse XY spin chain and its natural extensions, the quantum compass model with and without…
Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a…
We present a family of correlations constraints that apply to all multipartite quantum systems of finite dimension. The size of this family is exponential in the number of subsystems. We obtain these relations by defining and investigating…
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…
Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main…
Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states.…
We search a simplest and minimal way to determine whether a given quantum system is entangled or separable. For this end, we propose binary correlation measurements in which restricted knowledge of only zero or non-zero correlations is…
We present a new technique to reduce the expected number of measurements to declare an unknown quantum state as entangled. Our method is based on the geometric criterion and so requires only local Pauli measurements. Using concentration of…