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:2312.07516

Learning finitely correlated states: stability of the spectral reconstruction

Marco Fanizza, Niklas Galke, Josep Lumbreras, Cambyse Rouzé, Andreas Winter

Published Dec 12, 2023• 17 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2312.07516

Related papers

Infinite size density matrix renormalization group, revisited

Ian P. McCulloch

I revisit the infinite-size variant of the Density Matrix Renormalization Group (iDMRG) algorithm for obtaining a fixed-point translationally invariant matrix product wavefunction in the context of one-dimensional quantum systems. A crucial ingredient of this algorithm is an efficient transformation for obtaining the matrix elements of the wavefunction as the lattice size is increased, and I introduce here a versatile transformation that is demonstrated to be much more effective than previous versions. The resulting algorithm has a surprisingly close relationship to Vidal's Time Evolving Block Decimation for infinite systems, but allows much faster convergence. Access to a translationally invariant matrix product state allows the calculation of correlation functions based on the transfer matrix, which directly gives the spectrum of all correlation lengths. I also show some advantages of the Matrix Product Operator (MPO) technique for constructing expectation values of higher moments, such as the exact variance $$.

arXiv:0804.2509•Apr 16, 2008•504 citations

Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators

Jian-Feng Cai, Jingyang Li, Xiaoqun Zhang +1 more

Matrix product operators (MPOs) provide a scalable approach for quantum state tomography (QST) by offering a compact representation of many-body mixed states with limited entanglement, using only a number of parameters that scales polynomially with the system size. In this paper, we study QST for quantum density matrices that can be represented by MPOs. We first derive an equivalent characterization of Hermiticity in terms of the MPO core tensors and show that the coefficient tensor of an MPO under the Pauli or generalized Gell-Mann basis admits a real-valued low tensor-train (TT) rank structure. This establishes an explicit connection between MPO-based QST and noisy low-rank tensor completion. Motivated by this formulation, we develop an online Riemannian gradient descent (oRGD) algorithm that sequentially incorporates measurement data during the reconstruction process. With a proper initialization, we prove that oRGD converges linearly to the target MPO and succeeds with a number of distinct measurement settings that scales quadratically with the system size. As a byproduct, our analysis also yields a significantly improved sample complexity bound for the low TT rank tensor completion task. Furthermore, we propose a tailored spectral initialization method and establish its theoretical guarantee. Numerical experiments on several classes of quantum states validate the effectiveness and scalability of the proposed method.

quant-pharXiv:2605.04533•May 7, 2026•2 citations

Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks

Constantin Cedillo Vayson de Pradenne, Jordan Cotler

We establish proper agnostic learning of matrix product states and tree tensor networks. Given copies of an arbitrary quantum state $ρ$, our algorithms return a state $|ψ\rangle$ of chosen bond dimension such that $\langleψ| ρ|ψ\rangle$ is within $\varepsilon$ of the optimum over the model class, without assuming that $ρ$ itself belongs to or is well approximated by that class. The main idea is to use improper learning to compress the mixed-state objective, reducing proper agnostic learning to optimization against a finite collection of explicitly specified pure states. We then introduce a comparator-dual compression procedure that reduces the bond dimension of these targets while uniformly preserving their overlaps with all bounded-bond comparators, with an error independent of system size. For matrix product states, this gives polynomial copy complexity in the system size, local dimension, bond dimension, and $1/\varepsilon$, together with polynomial runtime in the system size for fixed local dimension, bond dimension, and accuracy. The same framework yields proper agnostic learning of tree tensor networks on bounded-degree trees, with both copy complexity and runtime polynomial in the system size when the remaining parameters are fixed.

quant-pharXiv:2609.30148•Sep 25, 2026•0 citations

Entanglement and ground states of gapped Hamiltonians

Spyridon Michalakis

We begin by deriving bounds for the entanglement of a spin with an (adjacent and non-adjacent) interval of spins in an arbitrary pure Finitely Correlated States (FCS). The bounds we derive become exact in the case where one considers the entanglement of a single spin with a half-infinite chain to the right of it. Our result permits a more efficient calculation, numerically and in some cases even analytically, of the entanglement in arbitrary finitely correlated quantum spin chains. We continue the study of entanglement in the setting of ground states of Hamiltonians with a spectral gap. In particular, for $V$ a finite subset of $Z^d$, we let $H_V$ denote a Hamiltonian on $V$ with finite range, finite strength interactions and a unique ground state with a non-vanishing spectral gap. For a density matrix $ρ_A$ that describes the finite-volume restriction to a region $A$ of the unique ground state, we provide a detailed version of a proof by M. Hastings, that the entropy of $ρ_A$ is bounded by a uniform constant $C$. Moreover, we provide a detailed generalization of the 1-dimensional construction of Hastings' approximation to the ground state in dimensions 2 and higher. Finally, we turn our attention to the study of a conjecture central to Quantum Information Theory, the multiplicativity of the maximal output Schatten $p$-norm of quantum channels, for $p > 1$. In particular, we study the output 2-norm for a special class of quantum channels, the depolarized Werner-Holevo channels, and show that multiplicativity holds for a product of two identical channels in this class.

arXiv:0807.4741•Jul 29, 2008•1 citation

Efficient Matrix Product State Learning in Logarithmic Depth

Chia-Ying Lin, Nai-Hui Chia, Hung, Shih-Han

Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following setting: given many copies of an input MPS, the task is to recover a classical description of the state. The best known polynomial-time algorithm, introduced by [LCLP10, CPF+10], requires linear circuit depth and $\widetilde O(n^5)$ samples, and has seen no improvement in over a decade. These costs, neither known to be optimal, renders existing algorithms impractical for near-term quantum devices with limited resources. We introduce parallel disentangling algorithms for MPS learning. For exact MPS learning, our algorithm runs in polynomial time and uses circuit depth $O(\log n)$ and sample complexity $\widetilde O(n^3)$, improving both the depth and the dependence on the system size $n$. The key idea is to exploit the bounded-rank structure of reduced states on middle blocks of an MPS and organize the disentangling operations in a tree structure. We further extend the algorithm to closest MPS learning, improving the sample complexity dependence on $n$ from $n^9$ to $n^7$ and complement the algorithms with an $Ω(n)$ product-state lower bound. We also investigate MPS learning under hardware constraints, including restricted measurements and geometric connectivity. Under the Learning Parity with Noise (LPN) assumption, we show computational hardness for learning an MPS(2) family with non-adaptive single-qubit measurements. Finally, we show that our algorithm can be implemented with depth $O(q n^{1/q})$ on a $q$-dimensional hypercubic lattice, giving an asymptotic reduction in depth. Together, our work provides a complete characterization of the quantum resources needed for efficient MPS learning.

arXiv:2510.07798•Oct 9, 2025•3 citations

Minimax Quantum State Tomography with Periodic Clifford Measurements

Hongru Zhao

Quantum state tomography provides a foundation for characterizing state preparation and predicting measurement outcomes. We characterize the minimax expected trace norm risk of quantum state tomography over classes with polynomial spectral decay under randomized nonadaptive single copy measurements. Under an explicit sufficient block size condition for the two layer periodic Clifford ensemble, we establish statewise expected trace norm oracle inequalities for operator norm minimum distance and measurement weighted projected least squares, with bounds that depend on each state's actual spectral tail, while the estimators require no prior knowledge of the state's structural characteristics, including its rank, eigenbasis, or spectral structure. Over these polynomial spectral decay classes, both estimators attain the minimax expected trace norm rates up to constants. As a direct consequence, the same estimators attain the minimax rate over every fixed rank constrained class, while remaining adaptive to the unknown structural characteristics of the state. For admissible logarithmic block sizes, the periodic Clifford measurements attain these guarantees with logarithmic elementary gate depth. The main technical ingredient is a uniform bound on the fourth moment of projectors for the periodic Clifford ensemble. The bound is sharp in dimension and holds for arbitrary test states, including those entangled across blocks. Covariance concentration and positivity yield adaptive oracle bounds, while a shared rotation information argument on spectral tail packings establishes matching lower bounds. We also provide polynomial time reconstruction algorithms, numerical comparisons, and Lean formalizations of all labeled theoretical results.

quant-pharXiv:2610.00210•Sep 22, 2026•0 citations
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.
I revisit the infinite-size variant of the Density Matrix Renormalization Group (iDMRG) algorithm for obtaining a fixed-point translationally invariant matrix product wavefunction in the context of one-dimensional quantum systems. A crucial ingredient of this algorithm is an efficient transformation for obtaining the matrix elements of the wavefunction as the lattice size is increased, and I introduce here a versatile transformation that is demonstrated to be much more effective than previous versions. The resulting algorithm has a surprisingly close relationship to Vidal's Time Evolving Block Decimation for infinite systems, but allows much faster convergence. Access to a translationally invariant matrix product state allows the calculation of correlation functions based on the transfer matrix, which directly gives the spectrum of all correlation lengths. I also show some advantages of the Matrix Product Operator (MPO) technique for constructing expectation values of higher moments, such as the exact variance $$.
Matrix product operators (MPOs) provide a scalable approach for quantum state tomography (QST) by offering a compact representation of many-body mixed states with limited entanglement, using only a number of parameters that scales polynomially with the system size. In this paper, we study QST for quantum density matrices that can be represented by MPOs. We first derive an equivalent characterization of Hermiticity in terms of the MPO core tensors and show that the coefficient tensor of an MPO under the Pauli or generalized Gell-Mann basis admits a real-valued low tensor-train (TT) rank structure. This establishes an explicit connection between MPO-based QST and noisy low-rank tensor completion. Motivated by this formulation, we develop an online Riemannian gradient descent (oRGD) algorithm that sequentially incorporates measurement data during the reconstruction process. With a proper initialization, we prove that oRGD converges linearly to the target MPO and succeeds with a number of distinct measurement settings that scales quadratically with the system size. As a byproduct, our analysis also yields a significantly improved sample complexity bound for the low TT rank tensor completion task. Furthermore, we propose a tailored spectral initialization method and establish its theoretical guarantee. Numerical experiments on several classes of quantum states validate the effectiveness and scalability of the proposed method.
We establish proper agnostic learning of matrix product states and tree tensor networks. Given copies of an arbitrary quantum state ρρρ, our algorithms return a state ∣ψ⟩|ψ\rangle∣ψ⟩ of chosen bond dimension such that ⟨ψ∣ρ∣ψ⟩\langleψ| ρ|ψ\rangle⟨ψ∣ρ∣ψ⟩ is within ε\varepsilonε of the optimum over the model class, without assuming that ρρρ itself belongs to or is well approximated by that class. The main idea is to use improper learning to compress the mixed-state objective, reducing proper agnostic learning to optimization against a finite collection of explicitly specified pure states. We then introduce a comparator-dual compression procedure that reduces the bond dimension of these targets while uniformly preserving their overlaps with all bounded-bond comparators, with an error independent of system size. For matrix product states, this gives polynomial copy complexity in the system size, local dimension, bond dimension, and 1/ε1/\varepsilon1/ε, together with polynomial runtime in the system size for fixed local dimension, bond dimension, and accuracy. The same framework yields proper agnostic learning of tree tensor networks on bounded-degree trees, with both copy complexity and runtime polynomial in the system size when the remaining parameters are fixed.
We begin by deriving bounds for the entanglement of a spin with an (adjacent and non-adjacent) interval of spins in an arbitrary pure Finitely Correlated States (FCS). The bounds we derive become exact in the case where one considers the entanglement of a single spin with a half-infinite chain to the right of it. Our result permits a more efficient calculation, numerically and in some cases even analytically, of the entanglement in arbitrary finitely correlated quantum spin chains. We continue the study of entanglement in the setting of ground states of Hamiltonians with a spectral gap. In particular, for VVV a finite subset of ZdZ^dZd, we let HVH_VHV​ denote a Hamiltonian on VVV with finite range, finite strength interactions and a unique ground state with a non-vanishing spectral gap. For a density matrix ρAρ_AρA​ that describes the finite-volume restriction to a region AAA of the unique ground state, we provide a detailed version of a proof by M. Hastings, that the entropy of ρAρ_AρA​ is bounded by a uniform constant CCC. Moreover, we provide a detailed generalization of the 1-dimensional construction of Hastings' approximation to the ground state in dimensions 2 and higher. Finally, we turn our attention to the study of a conjecture central to Quantum Information Theory, the multiplicativity of the maximal output Schatten ppp-norm of quantum channels, for p>1p > 1p>1. In particular, we study the output 2-norm for a special class of quantum channels, the depolarized Werner-Holevo channels, and show that multiplicativity holds for a product of two identical channels in this class.
Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following setting: given many copies of an input MPS, the task is to recover a classical description of the state. The best known polynomial-time algorithm, introduced by [LCLP10, CPF+10], requires linear circuit depth and O~(n5)\widetilde O(n^5)O(n5) samples, and has seen no improvement in over a decade. These costs, neither known to be optimal, renders existing algorithms impractical for near-term quantum devices with limited resources. We introduce parallel disentangling algorithms for MPS learning. For exact MPS learning, our algorithm runs in polynomial time and uses circuit depth O(log⁡n)O(\log n)O(logn) and sample complexity O~(n3)\widetilde O(n^3)O(n3), improving both the depth and the dependence on the system size nnn. The key idea is to exploit the bounded-rank structure of reduced states on middle blocks of an MPS and organize the disentangling operations in a tree structure. We further extend the algorithm to closest MPS learning, improving the sample complexity dependence on nnn from n9n^9n9 to n7n^7n7 and complement the algorithms with an Ω(n)Ω(n)Ω(n) product-state lower bound. We also investigate MPS learning under hardware constraints, including restricted measurements and geometric connectivity. Under the Learning Parity with Noise (LPN) assumption, we show computational hardness for learning an MPS(2) family with non-adaptive single-qubit measurements. Finally, we show that our algorithm can be implemented with depth O(qn1/q)O(q n^{1/q})O(qn1/q) on a qqq-dimensional hypercubic lattice, giving an asymptotic reduction in depth. Together, our work provides a complete characterization of the quantum resources needed for efficient MPS learning.
Quantum state tomography provides a foundation for characterizing state preparation and predicting measurement outcomes. We characterize the minimax expected trace norm risk of quantum state tomography over classes with polynomial spectral decay under randomized nonadaptive single copy measurements. Under an explicit sufficient block size condition for the two layer periodic Clifford ensemble, we establish statewise expected trace norm oracle inequalities for operator norm minimum distance and measurement weighted projected least squares, with bounds that depend on each state's actual spectral tail, while the estimators require no prior knowledge of the state's structural characteristics, including its rank, eigenbasis, or spectral structure. Over these polynomial spectral decay classes, both estimators attain the minimax expected trace norm rates up to constants. As a direct consequence, the same estimators attain the minimax rate over every fixed rank constrained class, while remaining adaptive to the unknown structural characteristics of the state. For admissible logarithmic block sizes, the periodic Clifford measurements attain these guarantees with logarithmic elementary gate depth. The main technical ingredient is a uniform bound on the fourth moment of projectors for the periodic Clifford ensemble. The bound is sharp in dimension and holds for arbitrary test states, including those entangled across blocks. Covariance concentration and positivity yield adaptive oracle bounds, while a shared rotation information argument on spectral tail packings establishes matching lower bounds. We also provide polynomial time reconstruction algorithms, numerical comparisons, and Lean formalizations of all labeled theoretical results.