© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2209.14154

Reconstructing the whole from its parts

Daniel Uzcátegui Contreras, Dardo Goyeneche

Published Sep 28, 2022• 0 citations

Abstract

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 $\binom{n}{k}$ 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\leq n\leq12$ and $\lfloor(n-1)/\sqrt{2}\rfloor\leq k\leq n-1$, where $\lfloor\cdot\rfloor$ denotes the floor function.

DOI: 10.48550/arxiv.2209.14154

Related papers

Some Ulam's reconstruction problems for quantum states

Huber, F, Simone Severini B

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.

•Oct 26, 2018•5 citations

Quantum channel marginal problem

Chung-Yun Hsieh, Matteo Lostaglio, Antonio Acín

Given a set of local dynamics, are they compatible with a global dynamics? We systematically formulate these questions as quantum channel marginal problems. These problems are strongly connected to the generalization of the no-signaling conditions to quantized inputs and outputs and can be understood as a general toolkit to study notions of quantum incompatibility. In fact, they include as special cases channel broadcasting, channel extendibility, measurement compatibility, and state marginal problems. After defining the notion of compatibility between global and local dynamics, we provide a solution to the channel marginal problem that takes the form of a semidefinite program. Using this formulation, we construct channel incompatibility witnesses, discuss their operational interpretation in terms of an advantage for a state-discrimination task, prove a gap between classical and quantum dynamical marginal problems, and show that the latter is irreducible to state marginal problems.

arXiv:2102.10926•Physical Review Research•Mar 31, 2022•26 citations

Some Ulam’s reconstruction problems for quantum states

Felix Huber, Simone Severini B

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.

arXiv:1802.00783•Journal of Physics A Mathematical and Theoretical•Aug 28, 2018•8 citations

A complete hierarchy for the pure state marginal problem in quantum mechanics

Xiao‐Dong Yu, Timo Simnacher, Nikolai Wyderka +2 more

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.

arXiv:2008.02124•Nature Communications•Feb 12, 2021•37 citations

Mixed States Uniquely Determined by Marginals and Additivity

Xinyu Qiu, Lin Chen, Genwei Li +1 more

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.

quant-pharXiv:2512.20133•IEEE Transactions on Information Theory•Dec 24, 2025•0 citations

The quantum marginal problem for symmetric states: applications to variational optimization, nonlocality and self-testing

Albert Aloy, Matteo Fadel, Jordi Tura

Abstract In this paper, we present a method to solve the quantum marginal problem for symmetric d -level systems. The method is built upon an efficient semi-definite program that uses the compatibility conditions of an m -body reduced density with a global n -body density matrix supported on the symmetric space. We illustrate the applicability of the method in central quantum information problems with several exemplary case studies. Namely, (i) a fast variational ansatz to optimize local Hamiltonians over symmetric states, (ii) a method to optimize symmetric, few-body Bell operators over symmetric states and (iii) a set of sufficient conditions to determine which symmetric states cannot be self-tested from few-body observables. As a by-product of our findings, we also provide a generic, analytical correspondence between arbitrary superpositions of n -qubit Dicke states and translationally-invariant diagonal matrix product states of bond dimension n .

arXiv:2001.04440•New Journal of Physics•Jan 29, 2021•24 citations

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

\binom{n}{k}

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\leq n\leq12

and

\lfloor(n-1)/\sqrt{2}\rfloor\leq k\leq n-1

, where

\lfloor\cdot\rfloor

denotes the floor function.

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.

Given a set of local dynamics, are they compatible with a global dynamics? We systematically formulate these questions as quantum channel marginal problems. These problems are strongly connected to the generalization of the no-signaling conditions to quantized inputs and outputs and can be understood as a general toolkit to study notions of quantum incompatibility. In fact, they include as special cases channel broadcasting, channel extendibility, measurement compatibility, and state marginal problems. After defining the notion of compatibility between global and local dynamics, we provide a solution to the channel marginal problem that takes the form of a semidefinite program. Using this formulation, we construct channel incompatibility witnesses, discuss their operational interpretation in terms of an advantage for a state-discrimination task, prove a gap between classical and quantum dynamical marginal problems, and show that the latter is irreducible to state marginal problems.

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.

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.

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.

Abstract In this paper, we present a method to solve the quantum marginal problem for symmetric d -level systems. The method is built upon an efficient semi-definite program that uses the compatibility conditions of an m -body reduced density with a global n -body density matrix supported on the symmetric space. We illustrate the applicability of the method in central quantum information problems with several exemplary case studies. Namely, (i) a fast variational ansatz to optimize local Hamiltonians over symmetric states, (ii) a method to optimize symmetric, few-body Bell operators over symmetric states and (iii) a set of sufficient conditions to determine which symmetric states cannot be self-tested from few-body observables. As a by-product of our findings, we also provide a generic, analytical correspondence between arbitrary superpositions of n -qubit Dicke states and translationally-invariant diagonal matrix product states of bond dimension n .