Related papers: The Complexity of Being Entangled
Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends…
We show how Gromov's spaces of bounded geometries provide a general mathematical framework for addressing and solving many of the issues of $3D$-simplicial quantum gravity. In particular, we establish entropy estimates characterizing the…
A general framework is developed for separating classical and quantum correlations in a multipartite system. Entanglement is defined as the difference in the correlation information encoded by the state of a system and a suitably defined…
The area law for entanglement entropy fundamentally reflects the complexity of quantum many-body systems, demonstrating ground states of local Hamiltonians to be represented with low computational complexity. While this principle is…
We show that any pseudoentangled state ensemble with a gap of $t$ bits of entropy requires $\Omega(t)$ non-Clifford gates to prepare. This bound is tight up to polylogarithmic factors if linear-time quantum-secure pseudorandom functions…
We show that the manifold of quantum states is endowed with a rich and nontrivial geometric structure. We derive the Fubini-Study metric of the projective Hilbert space of a multi-qubit quantum system, endowing it with a Riemannian metric…
We compute an upper bound on the circuit complexity of quantum states in $3d$ Chern-Simons theory corresponding to certain classes of knots. Specifically, we deal with states in the torus Hilbert space of Chern-Simons that are the knot…
We study experimentally accessible lower bounds on entanglement measures based on entropic uncertainty relations. Experimentally quantifying entanglement is highly desired for applications of quantum simulation experiments to fundamental…
Entanglement is at the heart of most quantum information tasks, and therefore considerable effort has been made to find methods of deciding the entanglement content of a given bipartite quantum state. Here, we prove a fundamental limitation…
There has been a surge of progress in recent years in developing algorithms for testing and learning quantum states that achieve optimal copy complexity. Unfortunately, they require the use of entangled measurements across many copies of…
We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed, in more detail. Based on Nielsen's geometric approach to quantum circuit complexity, we find the…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
We investigate boundary critical phenomena from a quantum information perspective. Bipartite entanglement in the ground state of one-dimensional quantum systems is quantified using the Renyi entropy S_alpha, which includes the von Neumann…
We introduce a family of highly symmetric bipartite quantum states in arbitrary dimensions. It consists of all states that are invariant under local phase rotations and local cyclic permutations of the basis. We solve the separability…
Is entanglement an exclusive feature of quantum systems, or is it common to all non-classical theories? And if this is the case, how strong is quantum mechanical entanglement as compared to that exhibited by other theories? The first part…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, using local operations and…
The work is intended to represent some interesting and apparently peculiar features of entangled system in both pure as well as mixed states level. In the pure state level, we are largely concerned about the existence and characteristics of…
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity…
Beyond computer science, quantum complexity theory can potentially revolutionize multiple branches of physics, ranging from quantum many-body systems to quantum field theory. In this paper, we investigate the relationship between the sample…