Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

INNER APPROXIMATIONS OF THE ONE-BODY QUANTUM MARGINAL POLYTOPE

D. GROSS

Published Oct 1, 2013• 0 citations
Publisher

Abstract

The one-body quantum marginal problem (1-QMP) asks which single-site reduced density matrices arise from globally pure states. We show that this set allows for an explicit inner approximation, which becomes increasingly accurate as the number of particles grows. The 1-QMP had been a long-standing open problem in quantum many-body theory. Recently, Klyachko recognized the set in question as a moment polytope in the sense of symplectic geometry and gave a recipe for computing its facets. However, both the algorithm and the polytope itself seem to be highly non-trivial and only a few cases have been explored. We present first systematic results on the properties of the polytope for large quantum systems. More precisely: the set of eigenvalues of the one-body reduced density matrices of globally pure states allow for a simple outer approximation. It is obtained by imposing only positivity and normalization constraints. We show that for an n-body system, there is an explicit inner approximation, whose distance to the outer one is bounded by ( log n)/n. For reasons that will become clear (and are by no means connected to the host nation of the present conference), we refer to the inner polytope as a lego simplex . There is a sense in which the construction is tight, up to, possibly, the log-factor. Perhaps surprisingly, the technical analysis rests on an analytic diagonalization of a certain random walk on the representations of the symmetric group. Joint work with Matthias Christandl and Michael Walter, ETH Zürich. Note from Publisher: This article contains the abstract only.

DOI
10.1142/9789814449243_0054

Related papers

Quantum marginals from pure doubly excited states

Tomasz Maciążek, Valdemar V. Tsanov

Abstract The possible spectra of one-particle reduced density matrices that are compatible with a pure multipartite quantum system of finite dimension form a convex polytope. We introduce a new construction of inner- and outer-bounding polytopes that constrain the polytope for the entire quantum system. The outer bound is sharp. The inner polytope stems only from doubly excited states. We find all quantum systems, where the bounds coincide giving the entire polytope. We show, that those systems are: (i) any system of two particles (ii) L qubits, (iii) three fermions on N ⩽ 7 levels, (iv) any number of bosons on any number of levels and (v) fermionic Fock space on N ⩽ 5 levels. The methods we use come from symplectic geometry and representation theory of compact Lie groups. In particular, we study the images of proper momentum maps, where our method describes momentum images for all representations that are spherical.

arXiv:1705.05445•Journal of Physics A Mathematical and Theoretical•Sep 13, 2017•15 citations

Disentangling the marginal problem in quantum chemistry

Carlos L. Benavides-Riveros, José M. Gracia Bondía

It is well known that determining the energy of molecules and other quantum many-body systems reduces in the standard approximation to optimizing a simple linear functional of a 12-variable object, the two-electron reduced density matrix (2-RDM). The difficulty is that the variation ensemble for that functional has never been satisfactorily determined. This is known as the N-representability problem of quantum chemistry (which to a large extent is a problem of quantum information theory). The situation has given rise to competing research programs, typically trading more complicated functionals for simpler representability conditions. Chief among them is density functional theory, based on a three-variable object for which the N-representability is trivial, whereas the exact functional is very strange indeed, and probably forever unknowable. An intermediate position is occupied by 1-RDM functional theory. Postulated by Pauli to explain the electronic structure of atoms and molecules, the exclusion principle establishes an upper bound of 1 for the fermionic natural occupation numbers, accordingly allowing no more than one electron in each quantum state. This is a necessary and sufficient condition for a 1-RDM to be the contraction of an ensemble N-body density matrix. The fermionic one-body quantum marginal problem asks whether given natural occupation numbers can arise from an antisymmetric (ensemble or pure) N-particle state. The configuration interaction method affords optimal descriptions of quantum states of atoms and molecules by expanding the wave function in terms of orbital-based configurations of Slater determinants. For these systems, the dimension of the Hilbert space grows binomially with m, the number of spin-orbitals in the basis of the one-particle Hilbert space, and N, the number of electrons of the system. It has been observed that for the rank-six approximation of a pure-state N=3 system, the occupation numbers satisfy some additional constraints, stronger than the Pauli exclusion principle. The recent analysis by Alexander Klyachko and coworkers of the one-body marginal problem of the pure N-fermion state establishes a systematic approach to this type of constraints. In fact, for a pure quantum system of N electrons arranged in m spin-orbitals the occupation numbers satisfy a set of linear inequalities, known as generalized Pauli constraints (GPC). These inequalities define a convex polytope of allowed states in R^m. They are conditions for a 1-RDM to be the contraction of a N-body state. When one of the GPC is completely saturated, the system is said to be pinned, and it lies on one of the facets of the polytope. The nature of those conditions has been explored till now only in a few systems: a model of three spinless fermions confined to a one-dimensional harmonic potential, the lithium isoelectronic series and ground and excited states of some three- and four-electron molecules for the rank being at least twice the number of electrons. For all these systems the inequalities are (quite often) nearly saturated. This is the so-called quasipinning phenomenon. In this PhD thesis we have taken up the challenge of using numerical and analytical methods to examine pinned and quasipinned states, for atoms and molecules, starting from scratch with configuration-interaction and multiconfiguration self-consistent methods. This procedure serves to study the occurrence of quasipinning in realistic systems. A second goal is to show how the subsets of pinned states defined by GPC give rise to the most efficient approach from a computational viewpoint, yielding the leading order of the electron-electron correlations. As a consequence, we underline in this thesis the theoretical and practical importance of Klyachko's approach to the quantum marginal problem and its impact on the competing research programs to determine feasible electronic densities, 1-RDM, 2-RDM, intracular distributions or Wigner density quasiprobabilities. In relation with the above, our research provides a new variational optimization method for few-fermion ground states. We quantitatively confirm its high accuracy for quasipinned systems and derive an upper bound on the error of the correlation energy given by the ratio of the numerical value of the Klyachko inequality and the distance to the Hartree-Fock point. Depending on the details of the algorithm, we are able to reach 98%-99% of the correlation energy for such systems.

•Jan 1, 2015•5 citations

Solving one-body ensemble N-representability problems with spin

Julia Liebert, Federico Castillo, Jean‐Philippe Labbé +2 more

The Pauli exclusion principle is fundamental to understanding electronic quantum systems. It namely constrains the expected occupancies n i of orbitals φ i according to 0 ≤ n i ≤ 2 . In this work, we first refine the underlying one-body N -representability problem by taking into account simultaneously spin symmetries and a potential degree of mixedness w of the N -electron quantum state. We then derive a comprehensive solution to this problem by using basic tools from representation theory, convex analysis and discrete geometry. Specifically, we show that the set of admissible orbital one-body reduced density matrices is fully characterized by linear spectral constraints on the natural orbital occupation numbers, defining a convex polytope Σ N , S ( w ) ⊂ [ 0 , 2 ] d . These constraints are independent of M and the number d of orbitals, while their dependence on N , S is linear, and we can thus calculate them for arbitrary system sizes and spin quantum numbers. Our results provide a crucial missing cornerstone for ensemble density (matrix) functional theory.

arXiv:2412.01805•Quantum•Dec 2, 2025•3 citations

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes

Peter Bürgisser, Cole Franks, Ankit Garg +3 more

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our algorithm provides an efficient weak membership oracle for the associated moment polytopes, an important family of implicitly-defined convex polytopes with exponentially many facets and a wide range of applications. These include the entanglement polytopes from quantum information theory (in particular, we obtain an efficient solution to the notorious one-body quantum marginal problem) and the Kronecker polytopes from representation theory (which capture the asymptotic support of Kronecker coefficients). Our algorithm can be applied to succinct descriptions of the input tensor whenever the marginals can be efficiently computed, as in the important case of matrix product states or tensor-train decompositions, widely used in computational physics and numerical mathematics. Beyond these applications, the algorithm enriches the arsenal of "numerical" methods for classical problems in invariant theory that are significantly faster than "symbolic" methods which explicitly compute invariants or covariants of the relevant action. We stress that (like almost all past algorithms) our convergence rate is polynomial in the approximation parameter; it is an intriguing question to achieve exponential convergence rate, beating symbolic algorithms exponentially, and providing strong membership and separation oracles for the problems above. We strengthen and generalize the alternating minimization approach of previous papers by introducing the theory of highest weight vectors from representation theory into the numerical optimization framework. We show that highest weight vectors are natural potential functions for scaling algorithms and prove new bounds on their evaluations to obtain polynomial-time convergence. Our techniques are general and we believe that they will be instrumental to obtain efficient algorithms for moment polytopes beyond the ones consider here, and more broadly, for other optimization problems possessing natural symmetries.

arXiv:1804.04739•Annual Symposium on Foundations of Computer Science•Oct 1, 2018•51 citations

Dimension-free marginal inequalities for pure three-party states

Simon Morelli

The quantum marginal problem, concerned with the compatibility of local and global properties of a multipartite quantum system, is arguably one of the fundamental questions in quantum theory. In this article we introduce a novel family of inequalities bounding the allowed local spectra of a pure tripartite state. The number of inequalities in this family grows with the dimension of the system. Most importantly, the inequalities hold for arbitrary dimensions. For equal local dimension at most 4, they generate the complete set of eigenvalue inequalities.

quant-pharXiv:2610.28162•Oct 21, 2026•0 citations

When is a pure state of three qubits determined by its single-particle reduced density matrices?

Adam Sawicki, Michael Walter, Marek Kuś

Using techniques from symplectic geometry, we prove that a pure state of three qubits is up to local unitaries uniquely determined by its one-particle reduced density matrices exactly when their ordered spectra belong to the boundary of the so-called Kirwan polytope. Otherwise, the states with given reduced density matrices are parameterized, up to local unitary equivalence, by two real variables. Given inevitable experimental imprecision, this means that already for three qubits a pure quantum state can never be reconstructed from single-particle tomography. We moreover show that the knowledge of the reduced density matrices is always sufficient if one is given the additional promise that the quantum state is not convertible to the Greenberger–Horne–Zeilinger state by stochastic local operations and classical communication, and discuss generalizations of our results to an arbitrary number of qubits.

arXiv:1207.3849•Journal of Physics A Mathematical and Theoretical•Jan 21, 2013•41 citations
The one-body quantum marginal problem (1-QMP) asks which single-site reduced density matrices arise from globally pure states. We show that this set allows for an explicit inner approximation, which becomes increasingly accurate as the number of particles grows. The 1-QMP had been a long-standing open problem in quantum many-body theory. Recently, Klyachko recognized the set in question as a moment polytope in the sense of symplectic geometry and gave a recipe for computing its facets. However, both the algorithm and the polytope itself seem to be highly non-trivial and only a few cases have been explored. We present first systematic results on the properties of the polytope for large quantum systems. More precisely: the set of eigenvalues of the one-body reduced density matrices of globally pure states allow for a simple outer approximation. It is obtained by imposing only positivity and normalization constraints. We show that for an n-body system, there is an explicit inner approximation, whose distance to the outer one is bounded by ( log n)/n. For reasons that will become clear (and are by no means connected to the host nation of the present conference), we refer to the inner polytope as a lego simplex . There is a sense in which the construction is tight, up to, possibly, the log-factor. Perhaps surprisingly, the technical analysis rests on an analytic diagonalization of a certain random walk on the representations of the symmetric group. Joint work with Matthias Christandl and Michael Walter, ETH Zürich. Note from Publisher: This article contains the abstract only.
Abstract The possible spectra of one-particle reduced density matrices that are compatible with a pure multipartite quantum system of finite dimension form a convex polytope. We introduce a new construction of inner- and outer-bounding polytopes that constrain the polytope for the entire quantum system. The outer bound is sharp. The inner polytope stems only from doubly excited states. We find all quantum systems, where the bounds coincide giving the entire polytope. We show, that those systems are: (i) any system of two particles (ii) L qubits, (iii) three fermions on N ⩽ 7 levels, (iv) any number of bosons on any number of levels and (v) fermionic Fock space on N ⩽ 5 levels. The methods we use come from symplectic geometry and representation theory of compact Lie groups. In particular, we study the images of proper momentum maps, where our method describes momentum images for all representations that are spherical.
It is well known that determining the energy of molecules and other quantum many-body systems reduces in the standard approximation to optimizing a simple linear functional of a 12-variable object, the two-electron reduced density matrix (2-RDM). The difficulty is that the variation ensemble for that functional has never been satisfactorily determined. This is known as the N-representability problem of quantum chemistry (which to a large extent is a problem of quantum information theory). The situation has given rise to competing research programs, typically trading more complicated functionals for simpler representability conditions. Chief among them is density functional theory, based on a three-variable object for which the N-representability is trivial, whereas the exact functional is very strange indeed, and probably forever unknowable. An intermediate position is occupied by 1-RDM functional theory. Postulated by Pauli to explain the electronic structure of atoms and molecules, the exclusion principle establishes an upper bound of 1 for the fermionic natural occupation numbers, accordingly allowing no more than one electron in each quantum state. This is a necessary and sufficient condition for a 1-RDM to be the contraction of an ensemble N-body density matrix. The fermionic one-body quantum marginal problem asks whether given natural occupation numbers can arise from an antisymmetric (ensemble or pure) N-particle state. The configuration interaction method affords optimal descriptions of quantum states of atoms and molecules by expanding the wave function in terms of orbital-based configurations of Slater determinants. For these systems, the dimension of the Hilbert space grows binomially with m, the number of spin-orbitals in the basis of the one-particle Hilbert space, and N, the number of electrons of the system. It has been observed that for the rank-six approximation of a pure-state N=3 system, the occupation numbers satisfy some additional constraints, stronger than the Pauli exclusion principle. The recent analysis by Alexander Klyachko and coworkers of the one-body marginal problem of the pure N-fermion state establishes a systematic approach to this type of constraints. In fact, for a pure quantum system of N electrons arranged in m spin-orbitals the occupation numbers satisfy a set of linear inequalities, known as generalized Pauli constraints (GPC). These inequalities define a convex polytope of allowed states in R^m. They are conditions for a 1-RDM to be the contraction of a N-body state. When one of the GPC is completely saturated, the system is said to be pinned, and it lies on one of the facets of the polytope. The nature of those conditions has been explored till now only in a few systems: a model of three spinless fermions confined to a one-dimensional harmonic potential, the lithium isoelectronic series and ground and excited states of some three- and four-electron molecules for the rank being at least twice the number of electrons. For all these systems the inequalities are (quite often) nearly saturated. This is the so-called quasipinning phenomenon. In this PhD thesis we have taken up the challenge of using numerical and analytical methods to examine pinned and quasipinned states, for atoms and molecules, starting from scratch with configuration-interaction and multiconfiguration self-consistent methods. This procedure serves to study the occurrence of quasipinning in realistic systems. A second goal is to show how the subsets of pinned states defined by GPC give rise to the most efficient approach from a computational viewpoint, yielding the leading order of the electron-electron correlations. As a consequence, we underline in this thesis the theoretical and practical importance of Klyachko's approach to the quantum marginal problem and its impact on the competing research programs to determine feasible electronic densities, 1-RDM, 2-RDM, intracular distributions or Wigner density quasiprobabilities. In relation with the above, our research provides a new variational optimization method for few-fermion ground states. We quantitatively confirm its high accuracy for quasipinned systems and derive an upper bound on the error of the correlation energy given by the ratio of the numerical value of the Klyachko inequality and the distance to the Hartree-Fock point. Depending on the details of the algorithm, we are able to reach 98%-99% of the correlation energy for such systems.
The Pauli exclusion principle is fundamental to understanding electronic quantum systems. It namely constrains the expected occupancies n i of orbitals φ i according to 0 ≤ n i ≤ 2 . In this work, we first refine the underlying one-body N -representability problem by taking into account simultaneously spin symmetries and a potential degree of mixedness w of the N -electron quantum state. We then derive a comprehensive solution to this problem by using basic tools from representation theory, convex analysis and discrete geometry. Specifically, we show that the set of admissible orbital one-body reduced density matrices is fully characterized by linear spectral constraints on the natural orbital occupation numbers, defining a convex polytope Σ N , S ( w ) ⊂ [ 0 , 2 ] d . These constraints are independent of M and the number d of orbitals, while their dependence on N , S is linear, and we can thus calculate them for arbitrary system sizes and spin quantum numbers. Our results provide a crucial missing cornerstone for ensemble density (matrix) functional theory.
We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our algorithm provides an efficient weak membership oracle for the associated moment polytopes, an important family of implicitly-defined convex polytopes with exponentially many facets and a wide range of applications. These include the entanglement polytopes from quantum information theory (in particular, we obtain an efficient solution to the notorious one-body quantum marginal problem) and the Kronecker polytopes from representation theory (which capture the asymptotic support of Kronecker coefficients). Our algorithm can be applied to succinct descriptions of the input tensor whenever the marginals can be efficiently computed, as in the important case of matrix product states or tensor-train decompositions, widely used in computational physics and numerical mathematics. Beyond these applications, the algorithm enriches the arsenal of "numerical" methods for classical problems in invariant theory that are significantly faster than "symbolic" methods which explicitly compute invariants or covariants of the relevant action. We stress that (like almost all past algorithms) our convergence rate is polynomial in the approximation parameter; it is an intriguing question to achieve exponential convergence rate, beating symbolic algorithms exponentially, and providing strong membership and separation oracles for the problems above. We strengthen and generalize the alternating minimization approach of previous papers by introducing the theory of highest weight vectors from representation theory into the numerical optimization framework. We show that highest weight vectors are natural potential functions for scaling algorithms and prove new bounds on their evaluations to obtain polynomial-time convergence. Our techniques are general and we believe that they will be instrumental to obtain efficient algorithms for moment polytopes beyond the ones consider here, and more broadly, for other optimization problems possessing natural symmetries.
The quantum marginal problem, concerned with the compatibility of local and global properties of a multipartite quantum system, is arguably one of the fundamental questions in quantum theory. In this article we introduce a novel family of inequalities bounding the allowed local spectra of a pure tripartite state. The number of inequalities in this family grows with the dimension of the system. Most importantly, the inequalities hold for arbitrary dimensions. For equal local dimension at most 4, they generate the complete set of eigenvalue inequalities.
Using techniques from symplectic geometry, we prove that a pure state of three qubits is up to local unitaries uniquely determined by its one-particle reduced density matrices exactly when their ordered spectra belong to the boundary of the so-called Kirwan polytope. Otherwise, the states with given reduced density matrices are parameterized, up to local unitary equivalence, by two real variables. Given inevitable experimental imprecision, this means that already for three qubits a pure quantum state can never be reconstructed from single-particle tomography. We moreover show that the knowledge of the reduced density matrices is always sufficient if one is given the additional promise that the quantum state is not convertible to the Greenberger–Horne–Zeilinger state by stochastic local operations and classical communication, and discuss generalizations of our results to an arbitrary number of qubits.