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.
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.
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.
The quantum marginal problem consists in deciding whether a given set of marginal reductions is compatible with the existence of a global quantum state or not. In this work, we formulate the problem from the perspective of dynamical systems theory and study its advantages with respect to the standard approach. The introduced formalism allows us to analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. In particular, we show that any self-consistent set of multipartite marginal reductions is compatible with the existence of a global quantum state, after passing through a depolarizing channel. This result reveals that the complexity associated to the marginal problem can be drastically reduced when restricting the attention to sufficiently mixed marginals. We also formulate the marginal problem in a compressed way, in the sense that the total number of scalar constraints is smaller than the one required by the standard approach. This fact suggests an exponential speedup in runtime when considering semi-definite programming techniques to solve it, in both classical and quantum algorithms. Finally, we reconstruct n-qubit quantum states from all the (kn) marginal reductions to k parties, generated from randomly chosen mixed states. Numerical simulations reveal that the fraction of cases where we can find a global state equals 1 when 5≤n≤12 and ⌊(n−1)/2⌋≤k≤n−1, where ⌊⋅⌋ denotes the floor function.
The physics of a many-particle system is determined by the correlations in its quantum state. Therefore, analyzing these correlations is the foremost task of many-body physics. Any 'a priori' constraint for the properties of the global vs. the local states-the so-called marginals-would help in order to narrow down the wealth of possible solutions for a given many-body problem, however, little is known about such constraints. We derive an equality for correlation-related quantities of any multipartite quantum system composed of finite-dimensional local parties. This relation defines a necessary condition for the compatibility of the marginal properties with those of the joint state. While the equality holds both for pure and mixed states, the pure-state version containing only entanglement measures represents a fully general monogamy relation for entanglement. These findings have interesting implications in terms of conservation laws for correlations, and also with respect to topology.
We investigate some basic scenarios in which a given set of bipartite quantum states may consistently arise as the set of reduced states of a global N-partite quantum state. Intuitively, we say that the multipartite state ``joins'' the underlying correlations. Determining whether, for a given set of states and a given joining structure, a compatible N-partite quantum state exists is known as the quantum marginal problem. We restrict to bipartite reduced states that belong to the paradigmatic classes of Werner and isotropic states in d dimensions and focus on two specific versions of the quantum marginal problem which we find to be tractable. The first is Alice-Bob, Alice-Charlie joining, with both pairs being in a Werner or isotropic state. The second is m-n sharability of a Werner state across N subsystems, which may be seen as a variant of the N-representability problem to the case where subsystems are partitioned into two groupings of m and n parties, respectively. By exploiting the symmetry properties that each class of states enjoys, we determine necessary and sufficient conditions for three-party joinability and 1-n sharability for arbitrary d. Our results explicitly show that although entanglement is required for sharing limitations to emerge, correlations beyond entanglement generally suffice to restrict joinability, and not all unentangled states necessarily obey the same limitations. The relationship between joinability and quantum cloning as well as implications for the joinability of arbitrary bipartite states are discussed.
Identifying whether a mixed quantum state is uniquely determined among all states (UDA) by its local marginals is a basic problem in quantum information theory. We establish necessary and sufficient conditions under which several classes of multipartite mixed states are UDA by their k-partite marginals. We also prove structural properties based on ranges and marginals, and formulate a recursive procedure for the determination of UDA states. We show that sufficiently high rank rules out unique determination from fixed-order marginals, implying that almost all multipartite mixed states are not UDA from such marginals. Finally, we completely characterize the additivity of bipartite UDA states, three-qubit and several families of n-qubit product UDA states. These results clarify the boundary between UDA and non-UDA mixed states and provide a framework for local-marginal reconstruction and related certification tasks.
Consider the problem of deciding, for a particular multipartite quantum state, whether or not it is realizable in a quantum network with a particular causal structure. This is a fully quantum version of what causal inference researchers refer to as the problem of causal discovery. In this work, we introduce a fully quantum version of the inflation technique for causal inference, which leverages the quantum marginal problem. The primary example by which we illustrate the utility of this method is testing compatibility of tripartite quantum states with the quantum network known as the triangle scenario. We show, in particular, how the method yields a complete classification of pure three-qubit states into those that are and those that are not compatible with the triangle scenario. We also provide some illustrative examples involving mixed-states and some where one or more of the systems is higher dimensional. Furthermore, we examine the question of when the incompatibility of a multipartite quantum state with a causal structure can be inferred from the incompatibility of a joint probability distribution induced by implementing measurements on each subsystem. Finally, we present a family of networks, which includes the triangle scenario as a special case, for which causal compatibility constraints can be derived.