At the heart of the curious phenomenon of quantum entanglement lies the relation between the whole and its parts. In my thesis, I explore different aspects of this theme in the multipartite setting by drawing connections to concepts from statistics, graph theory, and quantum error-correcting codes: first, I address the case when joint quantum states are determined by their few-body parts and by Jaynes’ maximum entropy principle. This can be seen as an extension of the notion of entanglement, with less complex states already being determined by their few-body marginals. Second, I address the conditions for certain highly entangled multipartite states to exist. In particular, I present the solution of a long-standing open problem concerning the existence of an absolutely maximally entangled state on seven qubits. This sheds light on the algebraic properties of pure quantum states, and on the conditions that constrain the sharing of entanglement amongst multiple particles. Third, I investigate Ulam’s graph reconstruction problems in the quantum setting, and obtain legitimacy conditions of a set of states to be the reductions of a joint graph state. Lastly, I apply and extend the weight enumerator machinery from quantum error correction to investigate the existence of codes and highly entangled states in higher dimensions. This clarifies the physical interpretation of the weight enumerators and of the quantum MacWilliams identity, leading to novel applications in multipartite entanglement.
At the heart of the curious phenomenon of quantum entanglement lies the relation between the whole and its parts. In my thesis, I explore different aspects of this theme in the multipartite setting by drawing connections to concepts from statistics, graph theory, and quantum error-correcting codes: first, I address the case when joint quantum states are determined by their few-body parts and by Jaynes’ maximum entropy principle. This can be seen as an extension of the notion of entanglement, with less complex states already being determined by their few-body marginals. Second, I address the conditions for certain highly entangled multipartite states to exist. In particular, I present the solution of a long-standing open problem concerning the existence of an absolutely maximally entangled state on seven qubits. This sheds light on the algebraic properties of pure quantum states, and on the conditions that constrain the sharing of entanglement amongst multiple particles. Third, I investigate Ulam’s graph reconstruction problems in the quantum setting, and obtain legitimacy conditions of a set of states to be the reductions of a joint graph state. Lastly, I apply and extend the weight enumerator machinery from quantum error correction to investigate the existence of codes and highly entangled states in higher dimensions. This clarifies the physical interpretation of the weight enumerators and of the quantum MacWilliams identity, leading to novel applications in multipartite entanglement.
Abstract Provided a complete set of putative k -body reductions of a multipartite quantum state, can one determine if a joint state exists? We derive necessary conditions for this to be true. In contrast to what is known as the quantum marginal problem, we consider a setting where the labeling of the subsystems is unknown. The problem can be seen in analogy to Ulam’s reconstruction conjecture in graph theory. The conjecture—still unsolved—claims that every graph on at least three vertices can uniquely be reconstructed from the set of its vertex-deleted subgraphs. When considering quantum states, we demonstrate that the non-existence of joint states can, in some cases, already be inferred from a set of marginals having the size of just more than half of the parties. We apply these methods to graph states, where many constraints can be evaluated by knowing the number of stabilizer elements of certain weights that appear in the reductions. This perspective links with constraints that were derived in the context of quantum error-correcting codes and polynomial invariants. Some of these constraints can be interpreted as monogamy-like relations that limit the correlations arising from quantum states. Lastly, we provide an answer to Ulam’s reconstruction problem for generic quantum states.
Subsystems of composite quantum systems are described by reduced density matrices, or quantum marginals. Important physical properties often do not depend on the whole wave function but rather only on the marginals. Not every collection of reduced density matrices can arise as the marginals of a quantum state. Instead, there are profound compatibility conditions -- such as Pauli's exclusion principle or the monogamy of quantum entanglement -- which fundamentally influence the physics of many-body quantum systems and the structure of quantum information. The aim of this thesis is a systematic and rigorous study of the general relation between multipartite quantum states, i.e., states of quantum systems that are composed of several subsystems, and their marginals. In the first part, we focus on the one-body marginals of multipartite quantum states; in the second part, we study general quantum marginals from the perspective of entropy.
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.
Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state for some given marginals. This problem arises in many contexts, ranging from quantum chemistry to entanglement theory and quantum error correcting codes. In this paper, we prove a correspondence of the marginal problem to the separability problem. Based on this, we describe a sequence of semidefinite programs which can decide whether some given marginals are compatible with some pure global quantum state. As an application, we prove that the existence of multiparticle absolutely maximally entangled states for a given dimension is equivalent to the separability of an explicitly given two-party quantum state. Finally, we show that the existence of quantum codes with given parameters can also be interpreted as a marginal problem, hence, our complete hierarchy can also be used.
The study and characterisation of quantum entanglement represents an extended effort within the field of quantum information. This thesis addresses two problems. The first regards entanglement in open systems, where it’s more difficult to define a dichotomic (two outcome) observable due to population loss. The second problem concerns genuine multipartite entanglement, that is entanglement between many particles in states that cannot be separable with respect to any possible bipartition of a system.\nThe first chapter consists of an introduction to the basic elements of quantum mechanics and quantum information theory. We briefly describe a few historical facts about quantum mechanics and the study of entanglement, to help put things into perspective.\nThe second chapter is a detailed discussion of the neutral kaon system. These particles are produced in pairs and are described as a particle-antiparticle system. This system displays some unique properties like the violation of CP-symmetry, and shares some characteristics with other mesons, such as neutral particle oscillation and decay. This makes formulating Bell-type inequalities for them more difficult, but also provides the opportunity for new tests.\nThe third chapter continues with the presentation of an already existent effective formalism for performing Bell tests on neutral kaons. The essence of the formalism is a switch to the Heisenberg picture, transferring the time evolution and dependence on measurement directions to a so-called effective operator. This has many advantages, some of the most important being a proper normalization during population loss (due to decay), an easy application to\nthe case of multiple particles and the fact that it allows one to observe entanglement within the system for a relatively long amount of time. The final part presents a way to simulate neutral kaons with atomic systems, namely with Ytterbium isotopes and discuss what are the differences between these atomic systems and neutral kaons.\nThe second part of the thesis treats the problem of proving genuine multipartite entanglement from separable two-body marginals. For this, an introduction to semidefinite programming is necessary due to the fact that the problem under study can be formulated in terms of this method. We will briefly discuss linear and semidefinite programming as well as the concept of duality and provide some basic examples.\nThe formal description of this problem and previous results are provided in the fifth chapter. Our result shows that, through a cyclic iteration between two SDPs, one obtains states with the desired properties. Using this method we managed to go up to six qubit states for various configurations. From this we can construct higher-dimensional states having the same properties.
One of the key manifestations of quantum mechanics is the phenomenon of quantum entanglement. While the entanglement of bipartite systems is already well understood, our knowledge of entanglement in multipartite systems is still limited. This dissertation covers various aspects of the quantification of entanglement in multipartite states and the role of symmetry in such systems. Firstly, we establish a connection between the classification of multipartite entanglement and knot theory and investigate the family of states that are resistant to particle loss. Furthermore, we construct several examples of such states using the Majorana representation as well as some combinatorial methods. Secondly, we introduce classes of highly-symmetric but not fully-symmetric states and investigate their entanglement properties. Thirdly, we study the well-established class of Absolutely Maximally Entangled (AME) quantum states. On one hand, we provide construction of new states belonging to this family, for instance, an AME state of 4 subsystems with six levels each, on the other, we tackle the problem of equivalence of such states. Finally, we present a novel approach for the general problem of verification of the equivalence between any pair of arbitrary quantum states based on a single polynomial entanglement measure.