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

arXiv:2608.10365

Symmetrized Block-Product Periodic Marginals in Infinite Translation-Invariant Quantum Chains

Xiao Zeng, Kaiyan Yang, Lingxia Zhang, Zizhu Wang

quant-phcond-mat.str-elSubmitted Aug 11, 2026• Announced Aug 12, 2026• 0 citations
arXivHTMLPDF

Abstract

We study local marginals in one-dimensional translation-invariant quantum systems that may hide finite-period structure. Given an $n$-site reduced density matrix, we ask whether it can be obtained by repeating a finite $p$-site block state along the chain and averaging over the $p$ lattice translations. This defines a symmetrized block-product periodic marginal problem, which provides a route both to diagnosing hidden periodic order from local data and to upper bounding ground-state energy densities of infinite translation-invariant local Hamiltonians. We develop two complementary methods. The first is a semidefinite-programming relaxation based on block permutation symmetry and positive partial transpose constraints, which outer-approximates the convex hull of such marginals and yields certified infeasibility tests. The second is a symmetrized matrix product state ansatz, which constructs explicit block-product periodic states and gives variational upper bounds. We benchmark the framework on the Majumdar-Ghosh model, transverse-field Ising, XX, XXZ, and contextuality-related spin models. The results show that the method captures the expected finite-period structure in exactly solvable cases and gives systematically improving variational energies as the period and bond dimension increase. We also formulate a periodic-NPA relaxation for translation-invariant contextuality witnesses and recover the known quantum limits in the tested examples.

Comments
13 pages, 3 figures

Related papers

Contextuality as a Diagnostic of Translation-Symmetry Breaking in Translation-Invariant 1D Hamiltonians

Xiao Zeng, Kaiyan Yang, Lingxia Zhang +1 more

Bell- and contextuality-type inequalities have become practical probes of many-body quantum correlations, often involving only few-body correlators and quantities with a direct Hamiltonian interpretation such as an energy density. Here we investigate the mechanism by which translation-invariant Hamiltonians generated from representative families of contextuality witnesses organize their ground-state structure in infinite one-dimensional systems. For the witness families considered, maximal quantum violation is realized by ground-state sectors with commensurate enlarged unit cells: the Hamiltonians are invariant under one-site translations, while the optimal ground states are $p$-periodic with $p>1$. At the corresponding classical-bound points, the ground-state sectors are highly degenerate and support many commensurate periods. Along the interpolation paths analyzed in this work, entering the contextual regime is accompanied by the lifting of this classical period degeneracy in favor of a quantum-selected period. We also identify finite periodic-boundary-condition benchmarks at the selected periods: for each model studied, the finite-ring witness reproduces the same classical bound and quantum value as the corresponding infinite-chain witness, and in several cases the resulting finite inequalities are tight. These reductions turn the infinite-chain contextuality certification into compact energy-estimation benchmarks requiring only local correlator measurements. We establish the mechanism analytically in representative two- and three-body witness models and corroborate it more broadly using translation-invariant semidefinite-program relaxations together with variational matrix-product-state calculations.

quant-pharXiv:2606.19033•Jun 18, 2026•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•30 citations

Lower bounds to variational problems with guarantees

Jens Eisert

Variational methods play an important role in the study of quantum many-body problems, both in the flavor of classical variational principles based on tensor networks as well as of quantum variational principles in near-term quantum computing. This work stresses that for translationally invariant lattice Hamiltonians with periodic boundary conditions, one can easily derive efficiently computable lower bounds to ground state energies that can and should be compared with variational principles providing upper bounds. As small technical results, it is shown that (i) the Anderson bound and a (ii) common hierarchy of semidefinite relaxations both provide approximations with performance guarantees that scale as a constant in the energy density for cubic lattices. (iii) Also, the Anderson bound is systematically improved as a hierarchy of semidefinite relaxations inspired by the quantum marginal problem.

arXiv:2301.06142•Physical Review A•Jan 6, 2026•12 citations

An efficient algorithm for translationally invariant finite-size periodic lattice systems in one spatial dimension

Qian‐Qian Shi, Huan-Qiang Zhou

We develop an efficient algorithm to find a matrix product state representation of the ground-state wavefunctions for translationally invariant finite-size periodic lattice systems in one spatial dimension. This is based on the observation that the efficient computation of the ground-state energy per site only needs to retain a certain number of the largest eigenvalues of the transfer matrix for a matrix product state, without any sacrifice of accuracy. The computational cost is independent of the system's size, and scales as χ 3 with χ being the truncation dimension. The algorithm is tested for the critical quantum Ising model in a transverse field on a finite-size lattice, with the size as large as 4800 for the truncation dimension 200.

Journal of Physics A Mathematical and Theoretical•Jun 17, 2009•7 citations

Learning finitely correlated states: stability of the spectral reconstruction

Marco Fanizza, Niklas Galke, Josep Lumbreras +2 more

Matrix product operators allow efficient descriptions (or realizations) of states on a 1D lattice. We consider the task of learning a realization of minimal dimension from copies of an unknown state, such that the resulting operator is close to the density matrix in trace norm. For finitely correlated translation-invariant states on an infinite chain, a realization of minimal dimension can be exactly reconstructed via linear algebra operations from the marginals of a size depending on the representation dimension. We establish a bound on the trace norm error for an algorithm that estimates a candidate realization from estimates of these marginals and outputs a matrix product operator, estimating the state of a chain of arbitrary length $t$. This bound allows us to establish an $O(t^2)$ upper bound on the sample complexity of the learning task, with an explicit dependence on the site dimension, realization dimension and spectral properties of a certain map constructed from the state. A refined error bound can be proven for $C^*$-finitely correlated states, which have an operational interpretation in terms of sequential quantum channels applied to the memory system. We can also obtain an analogous error bound for a class of matrix product density operators on a finite chain reconstructible by local marginals. In this case, a linear number of marginals must be estimated, obtaining a sample complexity of $\tilde{O}(t^3)$. The learning algorithm also works for states that are sufficiently close to a finitely correlated state, with the potential of providing competitive algorithms for other interesting families of states.

arXiv:2312.07516•Dec 12, 2023•17 citations

Optimal matrix product states for the Heisenberg spin chain

José Ignacio Latorre, Vicent Picó

We present some exact results for the optimal matrix product state (MPS) approximation to the ground state of the infinite isotropic Heisenberg spin-1/2 chain. Our approach is based on the systematic use of Schmidt decompositions to reduce the problem of approximating for the ground state of a spin chain to an analytical minimization. This allows one to show that results of standard simulations, e.g. density matrix renormalization group and infinite time evolving block decimation, do correspond to the result obtained by this minimization strategy and, thus, both methods deliver optimal MPS with the same energy but, otherwise, different properties. We also find that translational and rotational symmetries cannot be maintained simultaneously by the MPS ansatz of minimum energy and present explicit constructions for each case. Furthermore, we analyze symmetry restoration and quantify it to uncover new scaling relations. The method we propose can be extended to any translational invariant Hamiltonian.

arXiv:0812.1761•Journal of Physics A Mathematical and Theoretical•Jun 5, 2009•2 citations
We study local marginals in one-dimensional translation-invariant quantum systems that may hide finite-period structure. Given an nnn-site reduced density matrix, we ask whether it can be obtained by repeating a finite ppp-site block state along the chain and averaging over the ppp lattice translations. This defines a symmetrized block-product periodic marginal problem, which provides a route both to diagnosing hidden periodic order from local data and to upper bounding ground-state energy densities of infinite translation-invariant local Hamiltonians. We develop two complementary methods. The first is a semidefinite-programming relaxation based on block permutation symmetry and positive partial transpose constraints, which outer-approximates the convex hull of such marginals and yields certified infeasibility tests. The second is a symmetrized matrix product state ansatz, which constructs explicit block-product periodic states and gives variational upper bounds. We benchmark the framework on the Majumdar-Ghosh model, transverse-field Ising, XX, XXZ, and contextuality-related spin models. The results show that the method captures the expected finite-period structure in exactly solvable cases and gives systematically improving variational energies as the period and bond dimension increase. We also formulate a periodic-NPA relaxation for translation-invariant contextuality witnesses and recover the known quantum limits in the tested examples.
Bell- and contextuality-type inequalities have become practical probes of many-body quantum correlations, often involving only few-body correlators and quantities with a direct Hamiltonian interpretation such as an energy density. Here we investigate the mechanism by which translation-invariant Hamiltonians generated from representative families of contextuality witnesses organize their ground-state structure in infinite one-dimensional systems. For the witness families considered, maximal quantum violation is realized by ground-state sectors with commensurate enlarged unit cells: the Hamiltonians are invariant under one-site translations, while the optimal ground states are ppp-periodic with p>1p>1p>1. At the corresponding classical-bound points, the ground-state sectors are highly degenerate and support many commensurate periods. Along the interpolation paths analyzed in this work, entering the contextual regime is accompanied by the lifting of this classical period degeneracy in favor of a quantum-selected period. We also identify finite periodic-boundary-condition benchmarks at the selected periods: for each model studied, the finite-ring witness reproduces the same classical bound and quantum value as the corresponding infinite-chain witness, and in several cases the resulting finite inequalities are tight. These reductions turn the infinite-chain contextuality certification into compact energy-estimation benchmarks requiring only local correlator measurements. We establish the mechanism analytically in representative two- and three-body witness models and corroborate it more broadly using translation-invariant semidefinite-program relaxations together with variational matrix-product-state calculations.
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 .
Variational methods play an important role in the study of quantum many-body problems, both in the flavor of classical variational principles based on tensor networks as well as of quantum variational principles in near-term quantum computing. This work stresses that for translationally invariant lattice Hamiltonians with periodic boundary conditions, one can easily derive efficiently computable lower bounds to ground state energies that can and should be compared with variational principles providing upper bounds. As small technical results, it is shown that (i) the Anderson bound and a (ii) common hierarchy of semidefinite relaxations both provide approximations with performance guarantees that scale as a constant in the energy density for cubic lattices. (iii) Also, the Anderson bound is systematically improved as a hierarchy of semidefinite relaxations inspired by the quantum marginal problem.
We develop an efficient algorithm to find a matrix product state representation of the ground-state wavefunctions for translationally invariant finite-size periodic lattice systems in one spatial dimension. This is based on the observation that the efficient computation of the ground-state energy per site only needs to retain a certain number of the largest eigenvalues of the transfer matrix for a matrix product state, without any sacrifice of accuracy. The computational cost is independent of the system's size, and scales as χ 3 with χ being the truncation dimension. The algorithm is tested for the critical quantum Ising model in a transverse field on a finite-size lattice, with the size as large as 4800 for the truncation dimension 200.
Matrix product operators allow efficient descriptions (or realizations) of states on a 1D lattice. We consider the task of learning a realization of minimal dimension from copies of an unknown state, such that the resulting operator is close to the density matrix in trace norm. For finitely correlated translation-invariant states on an infinite chain, a realization of minimal dimension can be exactly reconstructed via linear algebra operations from the marginals of a size depending on the representation dimension. We establish a bound on the trace norm error for an algorithm that estimates a candidate realization from estimates of these marginals and outputs a matrix product operator, estimating the state of a chain of arbitrary length ttt. This bound allows us to establish an O(t2)O(t^2)O(t2) upper bound on the sample complexity of the learning task, with an explicit dependence on the site dimension, realization dimension and spectral properties of a certain map constructed from the state. A refined error bound can be proven for C∗C^*C∗-finitely correlated states, which have an operational interpretation in terms of sequential quantum channels applied to the memory system. We can also obtain an analogous error bound for a class of matrix product density operators on a finite chain reconstructible by local marginals. In this case, a linear number of marginals must be estimated, obtaining a sample complexity of O~(t3)\tilde{O}(t^3)O~(t3). The learning algorithm also works for states that are sufficiently close to a finitely correlated state, with the potential of providing competitive algorithms for other interesting families of states.
We present some exact results for the optimal matrix product state (MPS) approximation to the ground state of the infinite isotropic Heisenberg spin-1/2 chain. Our approach is based on the systematic use of Schmidt decompositions to reduce the problem of approximating for the ground state of a spin chain to an analytical minimization. This allows one to show that results of standard simulations, e.g. density matrix renormalization group and infinite time evolving block decimation, do correspond to the result obtained by this minimization strategy and, thus, both methods deliver optimal MPS with the same energy but, otherwise, different properties. We also find that translational and rotational symmetries cannot be maintained simultaneously by the MPS ansatz of minimum energy and present explicit constructions for each case. Furthermore, we analyze symmetry restoration and quantify it to uncover new scaling relations. The method we propose can be extended to any translational invariant Hamiltonian.