Related papers: Bounds On Entanglement Catalysts
The entanglement-assisted (EA) formalism allows arbitrary classical linear codes to transform into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this…
A deep understanding of quantum entanglement is vital for advancing quantum technologies. The strength of entanglement can be quantified by counting the degrees of freedom that are entangled, which results in a quantity called Schmidt…
The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality…
Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often…
The entanglement of collaboration (EoC) quantifies the maximum amount of entanglement, that can be generated between two parties, A and B, given collaboration with N-2 other parties, when the N parties share a multipartite (possibly mixed)…
We find the minimum and the maximum value for the local energy of an arbitrary finite bipartite system for any given amount of entanglement, also identifying families of states reaching these bounds and sharing formal analogies with thermal…
The amount of entanglement that exists in a parametric down-converted state is investigated in terms of all the degrees of freedom of the state. We quantify the amount of entanglement by the Schmidt number of the state, represented as a…
We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key…
Closed formulae for upper bound on three tangles of three-qubit reduced states in terms of three-qubit invariant polynomials of pure four-qubit states are obtained. Our results offer tighter constraints on total three-way entanglement of a…
Code concatenation combines two or more component codes to design larger codes with greater noise resilience. Introducing entanglement assistance to concatenated codes provides a further advantage in terms of improved error rates and…
High-dimensional quantum entanglement can give rise to stronger forms of nonlocal correlations compared to qubit systems, offering significant advantages for quantum information processing. Certifying these stronger correlations, however,…
The squashed entanglement of a quantum channel is an additive function of quantum channels, which finds application as an upper bound on the rate at which secret key and entanglement can be generated when using a quantum channel a large…
It is shown that the order property of pure bipartite states under SLOCC (stochastic local operations and classical communications) changes radically when dimensionality shifts from finite to infinite. In contrast to finite dimensional…
In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…
The entanglement-assisted stabilizer formalism can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs). In this work, we construct some new entanglement-assisted quantum MDS…
We determine all $2\times 2$ quantum states that can serve as useful catalysts for a given probabilistic entanglement transformation, in the sense that they can increase the maximal transformation probability. When higher-dimensional…
Catalysis refers to the possibility of performing an otherwise impossible local state transformation by sharing an additional state, i.e. a catalyst, which is returned at the end of the protocol. There is a stronger version, known as…
We show that a single polynomial entanglement measure is enough to verify equivalence between generic $n$-qubit states under Stochastic Local Operations with Classical Communication (SLOCC). SLOCC operations may be represented geometrically…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties.…