Related papers: Binding Complexity and Multiparty Entanglement
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after…
For a projective measurement, the Born rule provides the probability for an outcome in terms of the inner product between a projector and a quantum state. If the projector represents a pure entangled state and the state for a composite…
Motivated by holographic complexity proposals as novel probes of black hole spacetimes, we explore circuit complexity for thermofield double (TFD) states in free scalar quantum field theories using the Nielsen approach. For TFD states at t…
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify…
We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to…
We give an introduction to the theory of multi-partite entanglement. We begin by describing the "coordinate system" of the field: Are we dealing with pure or mixed states, with single or multiple copies, what notion of "locality" is being…
Entanglement between three or more parties exhibits a realm of properties unknown to two-party states. Bipartite states are easily classified using the Schmidt decomposition. The Schmidt coefficients of a bipartite pure state encompass all…
We characterize the multipartite entanglement of a system of n qubits in terms of the distribution function of the bipartite purity over balanced bipartitions. We search for maximally multipartite entangled states, whose average purity is…
We introduce systematically with the help of Weyl operators novel classes of multipartite and multidimensional states which are all bound entangled for arbitrary dimension. We find that the entanglement is bound due to different reasons:…
The set of correlations between particles in multipartite quantum systems is larger than those in classical systems. Nevertheless, it is subject to restrictions by the underlying quantum theory. In order to better understand the structure…
In this essay, we consider highly entangled states in theories with a gravity dual, where the entangled degrees of freedom are causally disconnected from each other. Using the basic rules of holography, we argue that there is a…
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we…
It was recently conjectured that the quantum complexity of a holographic boundary state can be computed by evaluating the gravitational action on a bulk region known as the Wheeler-DeWitt patch. We apply this complexity=action duality to…
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…
The variety of multi-partite entangled states enables numerous applications in novel quantum information tasks. In order to compare the suitability of different states from a theoretical point of view classifications have been introduced.…
We derive a family of necessary separability criteria for finite-dimensional systems based on inequalities for variances of observables. We show that every pure bipartite entangled state violates some of these inequalities. Furthermore, a…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
In this paper, we argue that holographic complexity should be a basis-dependent quantity. Computational complexity of a state is defined as a minimum number of gates required to obtain that state from the reference state. Due to this…
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…