Related papers: Binding Complexity and Multiparty Entanglement
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…
The degree of entanglement is determined for an arbitrary state of a broad class of PT-symmetric bipartite composite systems. Subsequently we quantify the rate with which entangled states are generated and show that this rate can be…
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…
An extension to computational mechanics complexity measure is proposed in order to tackle quantum states complexity quantification. The method is applicable to any $n-$partite state of qudits through some simple modifications. A Werner…
Entanglement of formation is a fundamental measure that quantifies the entanglement of bipartite quantum states. This measure has recently been extended into multipartite states taking the name $\alpha$-entanglement of formation. In this…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
The unambiguous detection and quantification of entanglement is a hot topic of scientific research, though it is limited to low dimensions or specific classes of states. Here we identify an additional class of quantum states, for which…
The entanglement entropy of a pure quantum state of a bipartite system $A \cup B$ is defined as the von Neumann entropy of the reduced density matrix obtained by tracing over one of the two parts. Critical ground states of local…
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…
Classifying states as entangled or separable is a highly challenging task, while it is also one of the foundations of quantum information processing theory. This task is higly nontrivial even for relatively simple cases, such as two-qutrit…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
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…
We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…
Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable -- a task referred to as the separability problem -- poses a…
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…
Entanglement represents a pure quantum effect involving two or more particles. Spin systems are good candidates for studying this effect and its relation with other collective phenomena ruled by quantum mechanics. While the presence of…
We show that entanglement of pure multi-party states can be quantified by means of quantum uncertainties of certain basic observables through the use of measure that has been initially proposed in [10] for bipartite systems.
Complexity in quantum physics measures how difficult a state can be reached from a reference state and more precisely it is the number of fundamental unitary gates we have to operate to transform the reference state to the state we are…
The geometric measure of entanglement of a pure quantum state is defined to be its distance to the space of product (seperable) states. Given an $n$-partite system composed of subsystems of dimensions $d_1,\ldots, d_n$, an upper bound for…
Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy…