Nearly tight bounds for testing tree tensor network states
Benjamin Lovitz, Angus Lowe

TL;DR
This paper establishes nearly tight bounds on the number of copies needed to test whether a quantum state is a tree tensor network state with bounded bond dimension, advancing understanding of quantum state property testing.
Contribution
It provides the first tight bounds for testing TTNS, including both upper and lower bounds, and analyzes measurement restrictions for such testing.
Findings
O(nr^2) copies suffice for testing TTNS with one-sided error.
Omega(n r^2 / log n) copies are necessary when r ≥ 2 + log n.
Theta(√n) copies are needed and sufficient for testing low Schmidt-rank bipartite states.
Abstract
Tree tensor network states (TTNS) generalize the notion of having low Schmidt-rank to multipartite quantum states, through a parameter known as the bond dimension. This leads to succinct representations of quantum many-body systems with a tree-like entanglement structure. In this work, we study the task of testing whether an unknown pure state is a TTNS on qudits with bond dimension at most , or is far in trace distance from any such state. We first establish that, independent of the dimension of the state, copies suffice to accomplish this task with one-sided error. We then prove that copies are necessary for any test with one-sided error whenever . In particular, this closes a roughly quadratic gap in the previous bounds for testing matrix product states in this setting. On the other hand, when we show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Graph Theory and Algorithms · Advanced Graph Neural Networks
