Entanglement is one of the fundamental features of quantum information science.\nThough bipartite entanglement has been analyzed thoroughly in theory and shown to\nbe an important resource in quantum computation and communication protocols, the\ntheory of entanglement shared between more than two parties, which is called multipartite\nentanglement, is still not complete. Specifically, the classification of multipartite\nentanglement and the transformation property between different multipartite states by\nlocal operators and classical communications (LOCC) are two fundamental questions in\nthe theory of multipartite entanglement.\nIn this thesis, we present results related to the LOCC transformation between multipartite\nentangled states. Firstly, we investigate the bounds on the LOCC transformation\nprobability between multipartite states, especially the GHZ class states. By analyzing\nthe involvement of 3-tangle and other entanglement measures under weak two-outcome\nmeasurement, we derive explicit upper and lower bound on the transformation probability\nbetween GHZ class states. After that, we also analyze the transformation between\nN-party W type states, which is a special class of multipartite entangled states that\nhas an explicit unique expression and a set of analytical entanglement monotones. We\npresent a necessary and sufficient condition for a known upper bound of transformation\nprobability between two N-party W type states to be achieved.\nWe also further investigate a novel entanglement transformation protocol, the random\ndistillation, which transforms multipartite entanglement into bipartite entanglement\nii\nshared by a non-deterministic pair of parties. We find upper bounds for the random distillation\nprotocol for general N-party W type states and find the condition for the upper\nbounds to be achieved. What is surprising is that the upper bounds correspond to entanglement\nmonotones that can be increased by Separable Operators (SEP), which gives\nthe first set of analytical entanglement monotones that can be increased by SEP.\nFinally, we investigate the idea of a new class of multipartite entangled states, the\nAbsolutely Maximal Entangled (AME) states, which is characterized by the fact that\nany bipartition of the states would give a maximal entangled state between the two sets.\nThe relationship between AME states and Quantum secret sharing (QSS) protocols is\nexhibited and the application of AME states in novel quantum communication protocols\nis also explored.
Entanglement is one of the fundamental features of quantum information science.\nThough bipartite entanglement has been analyzed thoroughly in theory and shown to\nbe an important resource in quantum computation and communication protocols, the\ntheory of entanglement shared between more than two parties, which is called multipartite\nentanglement, is still not complete. Specifically, the classification of multipartite\nentanglement and the transformation property between different multipartite states by\nlocal operators and classical communications (LOCC) are two fundamental questions in\nthe theory of multipartite entanglement.\nIn this thesis, we present results related to the LOCC transformation between multipartite\nentangled states. Firstly, we investigate the bounds on the LOCC transformation\nprobability between multipartite states, especially the GHZ class states. By analyzing\nthe involvement of 3-tangle and other entanglement measures under weak two-outcome\nmeasurement, we derive explicit upper and lower bound on the transformation probability\nbetween GHZ class states. After that, we also analyze the transformation between\nN-party W type states, which is a special class of multipartite entangled states that\nhas an explicit unique expression and a set of analytical entanglement monotones. We\npresent a necessary and sufficient condition for a known upper bound of transformation\nprobability between two N-party W type states to be achieved.\nWe also further investigate a novel entanglement transformation protocol, the random\ndistillation, which transforms multipartite entanglement into bipartite entanglement\nii\nshared by a non-deterministic pair of parties. We find upper bounds for the random distillation\nprotocol for general N-party W type states and find the condition for the upper\nbounds to be achieved. What is surprising is that the upper bounds correspond to entanglement\nmonotones that can be increased by Separable Operators (SEP), which gives\nthe first set of analytical entanglement monotones that can be increased by SEP.\nFinally, we investigate the idea of a new class of multipartite entangled states, the\nAbsolutely Maximal Entangled (AME) states, which is characterized by the fact that\nany bipartition of the states would give a maximal entangled state between the two sets.\nThe relationship between AME states and Quantum secret sharing (QSS) protocols is\nexhibited and the application of AME states in novel quantum communication protocols\nis also explored.
Entanglement is one of the fundamental features of quantum information science. Though bipartite entanglement has been analyzed thoroughly in theory and shown to be an important resource in quantum computation and communication protocols, the theory of entanglement shared between more than two parties, which is called multipartite entanglement, is still not complete. This book contains Dr. Wei Cui's research regarding the classification of multipartite entanglement and the transformation property between different multipartite states by local operators and classical communications (LOCC), which are two fundamental questions in the theory of multipartite entanglement.
Most applications in quantum information processing make either explicit or implicit use of entanglement. It is thus important to have a good understanding of entanglement and the role it plays in these protocols. However, especially when it comes to multipartite entanglement, there still remain a lot of mysteries. This thesis is devoted to getting a better understanding of multipartite entanglement, and its role in various quantum information protocols.\n\nFirst, we investigate transformations between multipartite entangled states that only use local operations and classical communication (LOCC). We mostly focus on three qubit states in the GHZ class, and derive upper and lower bounds for the successful transformation probability between two states.\n\nWe then focus on absolutely maximally entangled (AME) states, which are highly entangled multipartite states that have the property that they are maximally entangled for any bipartition. With them as a resource, we develop new parallel teleportation protocols, which can then be used to implement quantum secret sharing (QSS) schemes. We further prove the existence of AME states for any number of parties, if the dimension of the involved quantum systems is chosen appropriately. An equivalence between threshold QSS schemes and AME states shared between an even number of parties is established, and further protocols are designed, such as constructing ramp QSS schemes and open-destination teleportation protocols with AME states as a resource.\n\nAs a framework to work with AME states, graph states are explored. They allow for efficient bipartite entanglement verification, which makes them a promising candidate for the description of AME states. We show that for all currently known AME states, absolutely maximally entangled graph states can be found, and we were even able to use graph states to find a new AME state for seven three-dimensional systems (qutrits). In addition, the implementation of QSS schemes from AME states can be conveniently described within the graph state formalism.\n\nFinally, we use the insight gained from entanglement in QSS schemes to derive necessary and sufficient conditions for quantum erasure channel and quantum error correction codes that satisfy the quantum Singleton bound, as these codes are closely related to ramp QSS schemes. This provides us with a very intuitive approach to codes for the quantum erasure channel, purely based on the entanglement required to protect information against losses by use of the parallel teleportation protocol.
The phenomenon of quantum entanglement is a fundamental feature of quantum mechanics which, as a counterintuitive and inherently ”quantum” phenomenon (with no classical analogue) has been the subject of much study, especially in quantum information theory. One fruitful approach to the description of entanglement has been in its operational description - that is, in the consideration of what can be achieved using entangled states under certain restrictions, typically the regime of local operations and classical communications.\n\nWe present results here related to the operational characterisation of entanglement in the resource model, in both bipartite and multipartite cases. First, we consider the conversion between pure bipartite entangled states in terms of an often-ignored resource - the classical communication cost. Using prior results for more specific conversions, we derive lower bounds on this cost (and the related quantity of the conversion inefficiency) for general bipartite pure states.\n\nWe also consider pure-state conversions of multipartite entanglement, in particular the class of protocols in which multipartite states are converted to states shared between fewer parties. We have found a previously-unconsidered variety of such conversions, in which the target state of the conversion is a state shared between a random subset of the parties. We find that when such post-selection of parties in the protocol is permitted allows for a wider variety of achievable target states; certain states which can not be reliably obtained between predetermined parties (even some where the probability of doing so is arbitrarily small) can be obtained between random parties. We consider a variety of states in which this phenomenon occurs, as well as bounds on such protocols can achieve.\n\nFinally we consider a practical use of entanglement as a resource, in an experimental implementation of a multipartite QKD protocol. This is based on the tripartite GHZ entangled state, but can be implemented using only bipartite entanglement. We adapt existing QKD results for both the bipartite and multipartite case to derive a secure key rate for this implementation, taking into account the ways in which it differs from the idealised theoretical case.
Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterized by considering transformations under local operations assisted by classical communication (LOCC). However, it has been shown that, for $n\ensuremath{\ge}5$ parties, multipartite pure states are generically isolated, i.e., they can be neither reached nor transformed under LOCC. Nonetheless, in any real laboratory, 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 stochastic LOCC (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.
For a tripartite pure state of three qubits, it is well known that there are two inequivalent classes of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) class and the W class. Any two states within the same class can be transformed into each other with stochastic local operations and classical communication with a nonzero probability. The optimal conversion probability, however, is only known for special cases. Here, lower and upper bounds are derived for the optimal probability of transformation from a GHZ state to other states of the GHZ class. A key idea in the derivation of the upper bounds is to consider the action of the local operations and classical communications (LOCC) protocol on a different input state, namely $1/\sqrt{2}[|000\ensuremath{\rangle}\ensuremath{-}|111\ensuremath{\rangle}]$, and to demand that the probability of an outcome remains bounded by 1. We also find an upper bound for more general cases by using the constraints of the so-called interference term and 3-tangle. Moreover, some of the results are generalized to the case in which each party holds a higher dimensional system. In particular, the GHZ state generalized to three qutrits; that is, $|{\mathrm{GHZ}}_{3}\ensuremath{\rangle}=1/\sqrt{3}[|000\ensuremath{\rangle}+|111\ensuremath{\rangle}+|222\ensuremath{\rangle}]$ shared among three parties can be transformed to any tripartite three-qubit pure state with probability 1 via LOCC. Some of our results can also be generalized to the case of a multipartite state shared by more than three parties.
This thesis studies the manipulation of entanglement in three-qubit quantum systems. I consider the operational setting in which the qubits are distributed to three spatially separated parties. The parties act locally on their quantum systems and share classical communication with one another, a scenario commonly called local operations and classical communication (LOCC). In the LOCC setting, there are two different classes of entanglement in multipartite systems, called the GHZ and W classes, which are inequivalent in the sense that states from one class cannot be transformed into the other without the consumption of additional entanglement. In this thesis, I first show that the LOCC conversion of certain GHZ and W-class states becomes possible by using only one additional ebit (“entangled bit”) of shared entanglement. In many cases, this can be proven as the minimal amount of needed entanglement. I then consider the problem of one-way communication transformations from general three-qubit states into two-qubit maximally entangled states, known as EPR states. An optimal protocol in terms of success probability is provided for W-class states. The success probability of this protocol coincides with the optimal success probability if two of the parties are allowed to act jointly within the same laboratory. In other words, forcing the locality constraint on all three parties does not weaken their capabilities for obtaining bipartite entanglement when starting from a W-class state. I also present that this property holds for certain types of GHZ-class states as well.