Searcharxiv⌕ Search

arXiv subjects

Julio I. de Vicente

Publications and source records attributed to Julio I. de Vicente.

At least 19 recordsLinked to original sources

Total Ordering of Resources: A Quantum-Classical Separation

A central goal in quantum information science is understanding which physical states can be converted into others. The ideal scenario would be a totally ordered system, where every state can be ranked by a single value, and a higher-ranked state can always be converted into a lower-ranked one. Such an ordering would provide a complete description of state convertibility, making the resource structure maximally simple to characterize and compare. We prove that such a simple ordering is fundamentally impossible for any quantum system with dimension larger than 2. The underlying properties of quantum mechanics guarantee that some states will always be incomparable. Furthermore, we show this is a uniquely quantum phenomenon by constructing classical systems of any size that can be perfectly ranked. This establishes a rigorous and striking divide between quantum and classical state transformations.

quant-ph↗

Quantum states with the same entanglement and local unitary equivalence

Local operations assisted by classical communication (LOCC) play a fundamental role in the resource-theoretic formulation of entanglement theory inducing an operationally meaningful ordering in the set of entangled states. The particular class within LOCC of local unitary (LU) transformations is obviously closed under inversion. Thus, LU-equivalent states are interconvertible by LOCC and have therefore the same entanglement. For this reason LU-equivalence has been thoroughly studied in the context of entanglement theory. However, as I note here with a simple example, the converse is not true: there exist entangled states that are interconvertible by LOCC but which are not LU-equivalent. This motivates studying under which conditions LOCC interconvertibility is characterized by LU-equivalence. I provide a sufficient condition for this to hold. When one considers multipartite states with full entanglement dimensionality (as quantified by the Schmidt number vector) LOCC interconvertibility can only hold under LU-equivalence.

quant-ph↗

Asymptotic robustness of entanglement in noisy quantum networks and graph connectivity

Quantum networks are promising venues for quantum information processing. This motivates the study of the entanglement properties of the particular multipartite quantum states that underpin these structures. In particular, it has been recently shown that when the links are noisy two drastically different behaviors can occur regarding the global entanglement properties of the network. While in certain configurations the network displays genuine multipartite entanglement (GME) for any system size provided the noise level is below a certain threshold, in others GME is washed out if the system size is big enough for any fixed non-zero level of noise. However, this difference has only been established considering the two extreme cases of maximally and minimally connected networks (i.e. complete graphs versus trees, respectively). In this article we investigate this question much more in depth and relate this behavior to the growth of several graph theoretic parameters that measure the connectivity of the graph sequence that codifies the structure of the network as the number of parties increases. The strongest conditions are obtained when considering the degree growth. Our main results are that a sufficiently fast degree growth (i.e. $Ω(N)$, where $N$ is the size of the network) is sufficient for asymptotic robustness of GME, while if it is sufficiently slow (i.e. $o(\log N)$) then the network becomes asymptotically biseparable. We also present several explicit constructions related to the optimality of these results.

quant-ph↗

Entanglement gain in supercatalytic state transformations

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 supercatalysis, in which the borrowed catalyst is returned in an enhanced form, i.e. more entangled. However, this phenomenon has remained little explored. In this work we introduce the supercatalytic entanglement gain as a figure of merit taking values in [0,1] that quantifies the performance of the protocol (with 0 corresponding to the standard case of catalysis and 1 representing the maximal possible gain) and we study in which cases it can be greater than zero and which strategies can maximize it. While it turns out that every catalytic transformation can be implemented in a supercatalytic fashion with entanglement gain equal to 1 if the state that is borrowed is chosen appropriately, other choices can make the gain strictly less than 1 and even 0. In fact, we prove that a large class of catalytic transformations are not fully supercatalyzable, i.e. there is at least one choice of catalyst for which the entanglement gain vanishes. On the other hand, the construction that shows that supercatalysis is always possible with maximal gain uses artificially highly entangled catalysts. For this reason, we also study minimal supercatalysis, where the entanglement content of the borrowed state is constrained in a precise and natural way. While we consider a scenario where we prove it is impossible to have entanglement gain equal to 1 in this case, we show that there exist minimal supercatalytic transformations with gain as close to 1 as desired. We also explore several examples and observe that, although choosing a catalyst with the least possible entanglement is often an optimal strategy for minimal supercatalysis, this is not necessarily always the case.

quant-ph↗

Nonexistence of maximally entangled mixed states for a fixed spectrum

The existence of a maximally entangled pure state is a cornerstone result of entanglement theory that has paramount consequences in quantum information theory. A natural generalization of this property is to consider whether a notion of maximal entanglement is possible among all states with the same spectrum (where the aforementioned case of pure states corresponds to the particular choice in which the spectrum is a delta distribution, i.e., rank-1 states). Despite positive evidence in the past that such a notion might exist at least in the case of two-qubit states, it was recently shown in [Phys. Rev. Lett. 133, 050202 (2024)] that the answer to the above question is negative. This reference proved this for particular choices of the spectrum in the case of rank-2 two-qubit density matrices. While this settles the problem in general, it still leaves open whether there are other choices of the spectrum outside the case of pure states where a maximally entangled state for a fixed spectrum might exist. In this work we extend this impossibility result to all rank-2 and rank-3 two-qubit states as well as for a large class of eigenvalue distributions in the case where the rank equals four.

quant-ph↗

Distillation of multipartite entangled states for arbitrary subsets of parties in noisy quantum networks of increasing size

Quantum network states are multipartite states built from distributing pairwise entanglement among parties and underpin the paradigm of quantum networks for quantum information processing. In this work we introduce the problem of partial distillability in noisy quantum networks. This corresponds to the possibility of distilling by local operations and classical communication an arbitrary pure state for an arbitrary subset of parties starting from a single copy of a quantum network state of an increasing number of parties that share noisy (i.e. mixed) bipartite entangled states. Here, distillation means that the target state is obtained with fidelity as close to 1 as desired as the size of the network increases when the pairwise entangled links support a constant amount of noise. While we prove an obstruction to multipartite distillation protocols after teleportation with channels with constant noise, we show that partial distillability is indeed possible if certain well-established graph-theoretic parameters that measure the connectivity in the network grow fast enough with its size. We give necessary as well as sufficient conditions for partial distillability in terms of these parameters and we moreover provide explicit constructions of networks with partial distillability and a relatively slow connectivity growth.

quant-ph↗

Quantum network-entanglement measures

Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to overcome the limitations of a given network structure. In this work, we introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories, which at the same time have a clear operational interpretation characterizing the extra resources necessary to prepare a targeted quantum state within a given network. In particular, we define the network communication cost and the network round complexity, which turn out to be intimately related to graph-theoretic parameters. We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.

quant-ph↗

Maximally entangled mixed states for a fixed spectrum do not always exist

Entanglement is a resource under local operations assisted by classical communication (LOCC). Given a set of states $S$, if there is one state in $S$ that can be transformed by LOCC into all other states in $S$, then this state is maximally entangled in $S$. It is a well-known result that the $d$-dimensional Bell state is the maximally entangled state in the set of all bipartite states of local dimension $d$. Since in practical applications noise renders every state mixed, it is interesting to study whether sets of mixed states of relevance enable the notion of a maximally entangled state. A natural choice is the set of all states with the same spectrum. In fact, for any given spectrum distribution on two-qubit states, previous work has shown that several entanglement measures are all maximized by one particular state in this set. This has led to consider the possibility that this family of states could be the maximally entangled states in the set of all states with the same spectrum, which should then maximize all entanglement measures. In this work I answer this question in the negative: there are no maximally entangled states for a fixed spectrum in general, i.e. for every possible choice of the spectrum. In order to do so, I consider the case of rank-2 states and show that for particular values of the eigenvalues there exists no state that can be transformed to all other isospectral states not only under LOCC but also under the larger class of non-entangling operations. This in particular implies that in these cases the state that maximizes a given entanglement measure among all states with the same spectrum depends on the choice of entanglement measure, i.e. it cannot be that the aforementioned family of states maximizes all entanglement measures.

quant-ph↗

Identifying families of multipartite states with non-trivial local entanglement transformations

The study of state transformations by spatially separated parties with local operations assisted by classical communication (LOCC) plays a crucial role in entanglement theory and its applications in quantum information processing. Transformations of this type among pure bipartite states were characterized long ago and have a revealing theoretical structure. However, it turns out that generic fully entangled pure multipartite states cannot be obtained from nor transformed to any inequivalent fully entangled state under LOCC. States with this property are referred to as isolated. Nevertheless, the above result does not forbid the existence of particular SLOCC classes that are free of isolation, and therefore, display a rich structure regarding LOCC convertibility. In fact, it is known that the celebrated $n$-qubit GHZ and W states give particular examples of such classes and in this work, we investigate this question in general. One of our main results is to show that the SLOCC class of the 3-qutrit totally antisymmetric state is isolation-free as well. Actually, all states in this class can be converted to inequivalent states by LOCC protocols with just one round of classical communication (as in the GHZ and W cases). Thus, we consider next whether there are other classes with this property and we find a large set of negative answers. Indeed, we prove weak isolation (i.e., states that cannot be obtained with finite-round LOCC nor transformed by one-round LOCC) for very general classes, including all SLOCC families with compact stabilizers and many with non-compact stabilizers, such as the classes corresponding to the $n$-qunit totally antisymmetric states for $n\geq4$. Finally, given the pleasant feature found in the family corresponding to the 3-qutrit totally antisymmetric state, we explore in more detail the structure induced by LOCC and the entanglement properties within this class.

quant-ph↗

State transformations within entanglement classes containing permutation-symmetric states

The study of state transformations under local operations and classical communication (LOCC) plays a crucial role in entanglement theory. While this has been long ago characterized for pure bipartite states, the situation is drastically different for systems of more parties: generic pure qudit states cannot be obtained from nor transformed to any state (i.e., they are isolated), which contains a different amount of entanglement. We consider here the question of LOCC convertibility for permutation-symmetric pure states of an arbitrary number of parties and local dimension, a class of clear interest both for physical and mathematical reasons and for which the aforementioned result does not apply given that it is a zero-measure subset in the state space. While it turns out that generic $n$-qubit symmetric states are also isolated, we consider particular families for which we can determine to be, on the contrary, endowed with a rich local stabilizer, a necessary requirement for LOCC convertibility to be possible. This allows us to identify classes in which LOCC transformations among permutation-symmetric states are possible. Notwithstanding, we provide several results that indicate severe obstructions to LOCC convertibility in general even within these highly symmetrical classes. In the course of the study of LOCC transformations, we also characterize the local symmetries of symmetric states.

quant-ph↗

Approximate and ensemble local entanglement transformations for multipartite states

Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterised by considering transformations under Local Operations assisted by Classical Communication (LOCC). However, it has been shown that, for $n\ge5$ parties, multipartite pure states are generically isolated, i.e., they can neither be reached nor transformed under LOCC. Nonetheless, in any real lab, one never deterministically transforms a pure initial state exactly to a pure target state. Instead, one transforms a mixed state near the initial state to an ensemble that is on average close to the target state. This motivates studying approximate LOCC transformations. After reviewing in detail the known results in the bipartite case, we present the gaps that remain open in the multipartite case. While the analysis of the multipartite setting is much more technically involved due to the existence of different SLOCC classes, certain features simplify in the approximate setting. In particular, we show that it is sufficient to consider pure initial states, that it is sufficient to consider LOCC protocols with finitely-many rounds of communication and that approximate transformations can be approximated by ensemble transformations within an SLOCC class. Then, we formally define a hierarchy of different forms of approximate transformations that are relevant from a physical point of view. Whereas this hierarchy collapses in the bipartite case, we show that this is not the case for the multipartite setting, which is fundamentally richer. To wit, we show that optimal multipartite approximate transformations are not generally deterministic, that ensemble transformations within an SLOCC class can achieve a higher fidelity than deterministic transformations within an SLOCC class, and that there are approximate transformations with no deterministic transformations nearby.

quant-ph↗

Asymptotic survival of genuine multipartite entanglement in noisy quantum networks depends on the topology

The study of entanglement in multipartite quantum states plays a major role in quantum information theory and genuine multipartite entanglement signals one of its strongest forms for applications. However, its characterization for general (mixed) states is a highly nontrivial problem. We introduce a particularly simple subclass of multipartite states, which we term pair-entangled network (PEN) states, as those that can be created by distributing exclusively bipartite entanglement in a connected network. We show that genuine multipartite entanglement in a PEN state depends on both the level of noise and the network topology and, in sharp contrast to the case of pure states, it is not guaranteed by the mere distribution of mixed bipartite entangled states. Our main result is a markedly drastic feature of this phenomenon: the amount of connectivity in the network determines whether genuine multipartite entanglement is robust to noise for any system size or whether it is completely washed out under the slightest form of noise for a sufficiently large number of parties. This latter case implies fundamental limitations for the application of certain networks in realistic scenarios, where the presence of some form of noise is unavoidable. To illustrate the applicability of PEN states to study the complex phenomenology behind multipartite entanglement, we also use them to prove superactivation of genuine multipartite nonlocality for any number of parties.

quant-ph↗

Genuine multipartite entanglement of quantum states in the multiple-copy scenario

Genuine multipartite entanglement (GME) is considered a powerful form of entanglement since it corresponds to those states that are not biseparable, i.e.\ a mixture of partially separable states across different bipartitions of the parties. In this work we study this phenomenon in the multiple-copy regime, where many perfect copies of a given state can be produced and controlled. In this scenario the above definition leads to subtle intricacies as biseparable states can be GME-activatable, i.e.\ several copies of a biseparable state can display GME. We show that the set of GME-activatable states admits a simple characterization: a state is GME-activatable if and only if it is not partially separable across one bipartition of the parties. This leads to the second question of whether there is a general upper bound in the number of copies that needs to be considered in order to observe the activation of GME, which we answer in the negative. In particular, by providing an explicit construction, we prove that for any number of parties and any number $k\in\mathbb{N}$ there exist GME-activatable multipartite states of fixed (i.e.\ independent of $k$) local dimensions such that $k$ copies of them remain biseparable.

quant-ph↗

Characterization of preorders induced by positive maps in the set of Hermitian matrices

Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.

math.FA↗

Genuine multipartite nonlocality is intrinsic to quantum networks

Quantum entanglement and nonlocality are inextricably linked. However, while entanglement is necessary for nonlocality, it is not always sufficient in the standard Bell scenario. We derive sufficient conditions for entanglement to give rise to genuine multipartite nonlocality in networks. We find that any network where the parties are connected by bipartite pure entangled states is genuine multipartite nonlocal, independently of the amount of entanglement in the shared states and of the topology of the network. As an application of this result, we also show that all pure genuine multipartite entangled states are genuine multipartite nonlocal in the sense that measurements can be found on finitely many copies of any genuine multipartite entangled state to yield a genuine multipartite nonlocal behaviour. Our results pave the way towards feasible manners of generating genuine multipartite nonlocality using any connected network.

quant-ph↗

Unbounded Bell violations for quantum genuine multipartite non-locality

The violations of Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality and express the advantage of using quantum resources over classical ones for certain information-theoretic tasks. The relative degree of quantum violations has been well studied in the bipartite scenario and in the multipartite scenario with respect to fully local behaviours. However, the multipartite setting entails a more complex classification in which different notions on non-locality can be established. In particular, genuine multipartite non-local distributions apprehend truly multipartite effects, given that these behaviours cannot be reproduced by bilocal models that allow correlations among strict subsets of the parties beyond a local common cause. We show here that, while in the so-called correlation scenario the relative violation of bilocal Bell inequalities by quantum resources is bounded, i.e. it does not grow arbitrarily with the number of inputs, it turns out to be unbounded in the general case. We identify Bell functionals that take the form of non-local games for which the ratio of the quantum and bilocal values grows unboundedly as a function of the number of inputs and outputs.

quant-ph↗

Measurement outcomes that do not occur and their role in entanglement transformations

The characterization of transformations among entangled pure states via local operations assisted by classical communication (LOCC) is a crucial problem in quantum information theory for both theoretical and practical reasons. As LOCC has a highly intricate structure, sometimes the larger set of separable (SEP) maps is considered, which has a mathematically much simpler description. In the literature, mainly SEP maps consisting of invertible Kraus operators have been taken into account. In this paper we show that the consideration of those maps is not sufficient when deciding whether a state can be mapped to another via general SEP transformations. This is done by providing explicit examples of transformations among pure 3- and 5- qubits states, which are feasible via SEP maps containing singular Kraus operators, however, not possible via SEP maps containing solely regular Kraus operators. The key point that allows to construct the SEP maps is to introduce projective measurements that occur with probability zero on the input state. The fact that it is not sufficient to consider SEP maps composed out of regular Kraus operators even in the case of pure state transformations, also affects the results on LOCC transformations among pure states. However, we show that non-invertible Kraus operators do not help in state transformations under LOCC with finitely many rounds of classical communication, i.e. the necessary and sufficient condition for SEP transformations with invertible Kraus operators is still a necessary condition for convertibility under finite-round LOCC. Moreover, we show that the results on transformations via SEP that are not possible with LOCC (including infinitely many rounds of classical communication) presented in M. Hebenstreit, C. Spee, and B. Kraus, Phys. Rev. A 93, 012339 (2016) are not affected.

quant-ph↗

Entanglement manipulation and distillability beyond LOCC

When a quantum system is distributed to spatially separated parties, it is natural to consider how the system evolves when the parties perform local quantum operations with classical communication (LOCC). However, the structure of LOCC channels is exceedingly complex leaving many important physical problems unsolved. In this paper we consider generalized resource theories of entanglement based on different relaxations to the class of LOCC. The behavior of various entanglement measures is studied under non-entangling channels, as well as the newly introduced classes of dually non-entangling and PPT-preserving channels. In an effort to better understand the nature of LOCC bound entanglement, we study the problem of entanglement distillation in these generalized resource theories. We first show that unlike LOCC, general non-entangling maps can be superactivated, in the sense that two copies of the same non-entangling map can nevertheless be entangling. On the single-copy level, we demonstrate that every NPT entangled state can be converted into an LOCC-distillable state using channels that are both dually non-entangling and having a PPT Choi representation and that every state can be converted into an LOCC-distillable state using operations belonging to any family of polytopes that approximate LOCC. We then turn to the stochastic convertibility of multipartite pure states and show that any two states can be interconverted by any polytope approximation to the set of separable channels. Finally, as an analog to $k$-positive maps, we introduce and analyze the set of $k$-non-entangling channels.

quant-ph↗