Tensor-Network Algorithm for Many-Body Trace Norms

This paper introduces a controlled tensor-network algorithm that combines Zolotarev's rational approximation with a variational DMRG-like approach to efficiently and accurately estimate trace norms of matrix product operators in many-body systems, overcoming the computational bottlenecks of full diagonalization and enabling practical studies of mixed-state quantum information quantities like entanglement negativity and quantum fidelity.

The Gist

Imagine you are trying to measure the "size" or "weight" of a complex, invisible object made of quantum particles. In the world of quantum physics, this object is called a Matrix Product Operator (MPO). It's a mathematical way to describe how particles in a system interact, especially when they are messy, mixed up, or interacting with their environment (like a hot cup of coffee cooling down).

Physicists often need to calculate something called the Trace Norm. Think of the Trace Norm as a special ruler that tells you how "different" two quantum states are, or how "entangled" (connected) they are. It's a fundamental tool for understanding quantum information.

The Problem: The Impossible Math
The trouble is, calculating this ruler for a large system is like trying to count every single grain of sand on a beach by lifting the entire beach into the air and sorting it one by one. To get the exact answer, you usually have to "diagonalize" the object. In plain English, this means breaking the object down into its simplest, individual pieces to measure them.

For a small system, this is easy. But for a system with just a few dozen particles, the number of pieces grows so fast (exponentially) that even the world's most powerful supercomputers would take longer than the age of the universe to finish the job. It's a massive computational bottleneck.

The Solution: A Smart Shortcut
The authors of this paper, Seunghun Lee and Eun-Gook Moon, have invented a clever shortcut. Instead of trying to break the object down completely (which is impossible for large systems), they use a Tensor Network, which is like a highly efficient, compressed map of the object.

Their method relies on a mathematical trick involving a "sign function" (a way to tell if a number is positive or negative).

1. The Approximation: They use a specific type of mathematical curve (called a Zolotarev rational approximation) that acts like a very sharp, high-quality lens. This lens can see the "positive" and "negative" parts of the quantum object very clearly, without needing to see every single tiny detail.
2. The Optimization: They turn the problem into a game of "find the best fit." They use an algorithm similar to the famous DMRG (Density Matrix Renormalization Group) method. Imagine trying to fit a flexible, stretchy net (the Tensor Network) over a bumpy rock (the quantum object). The algorithm slowly adjusts the net, pulling it tighter and tighter until it hugs the shape of the rock perfectly.
3. The Result: Once the net is fitted, they can read off the "Trace Norm" directly from the shape of the net, without ever having to lift the whole beach (the full diagonalization).

Why This is a Big Deal
The paper shows that this shortcut is not just a guess; it is a controlled approximation. This means the scientists can dial up the accuracy. If they want a rough estimate, they do a quick calculation. If they need high precision, they tweak a few knobs (parameters) in their math, and the answer gets closer and closer to the truth, with a guaranteed error margin.

What They Tested It On
To prove it works, they tested their method on three specific scenarios:

• Entanglement Negativity: They measured how "connected" two halves of a noisy quantum chain were. They compared their results to a known mathematical answer and found their method was incredibly accurate, even for systems too large for traditional computers to handle.
• Random Mixed States: They tested it on random, messy quantum states. As expected for these types of states, the "entanglement" was zero. Their method correctly calculated a value very close to zero, proving it doesn't invent fake connections.
• Quantum Fidelity: They used the method to measure how similar two different quantum states are (a concept called "fidelity"). They applied this to a noisy "GHZ state" (a specific type of quantum superposition) and successfully calculated a value called the "Quantum Fisher Information," which tells us how precise a quantum sensor could be.

The Bottom Line
This paper introduces a new, powerful tool that allows physicists to measure important quantum properties (like entanglement and similarity) in large, messy systems that were previously too big to study. It turns an impossible math problem into a manageable one by using a smart, flexible mathematical "net" and a high-precision lens, opening the door to studying quantum information in real-world, noisy conditions.

Technical Summary

Technical Summary: Tensor-Network Algorithm for Many-Body Trace Norms

Problem Statement
Trace norms ($\|A\|_1 = \text{Tr}|A|$) are fundamental quantities in quantum information theory, underpinning measures such as trace distance, entanglement negativity, and quantum fidelity. However, evaluating the trace norm for many-body systems represented by Matrix Product Operators (MPOs) is a significant computational bottleneck. The calculation generally requires full diagonalization of exponentially large matrices. Furthermore, computing the trace norm of a general MPO is not solvable in polynomial time (assuming $P \neq NP$). Existing polynomial-based approaches, such as Lanczos methods, often struggle with accuracy and controllability, particularly when dealing with non-analytic functions of the spectrum like the absolute value.

Methodology
The authors propose a controlled tensor-network algorithm to estimate the trace norm of MPOs without full diagonalization. The method relies on three core components:

1. Zolotarev's Rational Approximation:
   The trace norm involves the absolute value function, $|x| = x \cdot \text{sgn}(x)$. The authors utilize Zolotarev's rational approximation, $Z_{\ell,r}(x)$, for the sign function $\text{sgn}(x)$ on the domain $[-1, -\ell] \cup [\ell, 1]$. This approximation is characterized by two parameters: $\ell$ (spectral cutoff) and $r$ (degree of approximation). The error decays exponentially with $r$, offering a significant advantage over polynomial approximations used in Lanczos methods.
   The trace norm estimator is formulated as:
   $$f_{\ell,r}(A) = \text{Tr}[A \cdot Z_{\ell,r}(A)] = M \left( \text{Tr}[A^2] + \sum_{j=1}^r a_j \text{Tr}\left[ \frac{A^2}{A^2 + c_{2j-1}I} \right] \right)$$
   For non-Hermitian MPOs $A$, the method constructs a Hermitian matrix $A'$ of doubled dimension such that $\|A\|_1 = \frac{1}{2}\|A'\|_1$, allowing the application of the same estimator.

2. Variational Formulation:
   Evaluating the trace terms $\text{Tr}[A^2(A^2 + c_{2j-1}I)^{-1}]$ is reformulated as a variational optimization problem. The authors seek to maximize the objective function:
   $$\max_{|X\rangle} \left( \langle A|X\rangle + \langle X|A\rangle - \langle X|[I \otimes (A^2 + c_{2j-1}I)]|X\rangle \right)$$
   where $|X\rangle$ is restricted to the space of Matrix Product States (MPS) with bond dimension $\chi$.

3. DMRG-Like Solver:
   The optimization is solved using a Density Matrix Renormalization Group (DMRG)-like sweeping algorithm. By taking partial derivatives with respect to local tensors, the problem reduces to solving local linear systems. The authors compare two solvers: a matrix-free conjugate gradient method and explicit construction of the local matrix followed by direct solution (e.g., Cholesky factorization). They find that explicit construction is often faster and more accurate in practice for these systems. The algorithm iteratively updates the MPS $|X\rangle$ until the estimated trace value converges within a prescribed threshold.

Key Contributions

• Controlled Approximation: The method provides a systematically improvable approximation where accuracy is controlled by the rational approximation parameters ($\ell, r$) and the spectral weight near zero. An explicit relative error bound is derived, dependent on these parameters and the fraction of the trace norm contributed by eigenvalues below $\ell$.
• Extension to Non-Hermitian MPOs: The framework handles non-Hermitian operators by mapping them to Hermitian counterparts, enabling the calculation of trace norms for general MPOs.
• Generalization to Quantum Fidelity: The framework is extended to estimate quantum fidelity between mixed states, provided their purifications are available as MPSs. This is achieved by expressing fidelity as the squared trace norm of an operator constructed from the purifications.
• Efficiency over Existing Methods: The approach avoids the exponential scaling of exact diagonalization and offers improved accuracy and controllability compared to polynomial-based Lanczos approaches.

Results and Benchmarks
The authors validate the method through several benchmarks:

1. Decohered Cluster States: The entanglement negativity of a decohered cluster state under phase-flip noise was estimated. The results matched exact analytic solutions across various chain lengths and successfully captured the transition of negativity from finite to zero at a critical error rate. The relative error remained small, though it increased with system size due to the accumulation of small eigenvalues below the cutoff $\ell$.
2. Random Separable Mixed States: The method was applied to random separable mixed states (which theoretically have zero entanglement negativity). The estimated negativities were consistently close to zero, with deviations attributable to finite $\ell$ and bond dimension limits, which could be systematically reduced.
3. Quantum Fisher Information (QFI): Using the fidelity estimation extension, the authors estimated the QFI of a noisy GHZ state under amplitude damping noise. By employing Richardson extrapolation on fidelity estimates at different noise parameters, they extracted the QFI with $O(\theta^4)$ error. The results matched the known analytic solution for the noisy GHZ state.

Significance and Claims
The paper establishes trace-norm-based quantities as practical observables for tensor-network simulations of mixed states. The authors claim that their method enables the study of quantum information in mixed states beyond the regime accessible to exact diagonalization.

Specifically, the work suggests that combining this algorithm with recent protocols for learning MPOs directly from experiments could allow for the experimental estimation of entanglement negativity in noisy quantum processors, a task previously limited to small systems or indirect measurements (such as moments of the partially transposed density matrix). The authors also note the potential for using this method to benchmark noise models by computing fidelities from experimentally learned MPOs.

The authors remain modest regarding limitations, acknowledging that for very large systems, the method may face challenges due to the exponential suppression of small eigenvalues and machine precision constraints on the parameter $\ell$. However, they assert the method is effective for moderate-sized MPOs and offers a controlled route to exploring mixed-state regimes. Future directions mentioned include extending the method to higher dimensions, other tensor-network ansatzes, and incorporating symmetries to improve efficiency.