← Latest papers
🔢 mathematics

Schatten norms and determinants of linear combinations of matrix tensor powers via virtual representations

This paper presents an exact representation-theoretic method utilizing Schur–Weyl duality and Jacobi–Trudi identities to compute Schatten norms and determinants of linear combinations of matrix tensor powers in polynomial time, overcoming the exponential complexity of direct computation for three or more terms.

Original authors: Martin Áron Juhász, Mihály Weiner

Published 2026-09-07
📖 6 min read🧠 Deep dive

Original authors: Martin Áron Juhász, Mihály Weiner

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the world of quantum physics, scientists often need to compare complex states of matter to determine which one is present. Imagine trying to tell the difference between two slightly different clouds of atoms, or two distinct patterns of light. To do this accurately, researchers must analyze these systems not just once, but many times over, stacking copies of the same state on top of each other. This process creates a mathematical object that grows explosively large with every new copy added. If you have a small system and you stack it just a few times, the amount of information required to describe the whole thing becomes so vast that even the most powerful supercomputers cannot hold it in their memory. This is a fundamental bottleneck in testing quantum theories and designing future technologies. For decades, mathematicians have known how to handle these massive stacks when there are only one or two different types of items being combined, but a third type has always thrown the calculation into chaos, making it seem impossible to solve without brute force.

A team of researchers in Budapest has now found a way to bypass this explosion of complexity, at least for systems of a specific size. They developed a new method to calculate the "size" or "weight" of these massive mathematical stacks, even when they are built from three different ingredients. Their approach does not try to build the giant object and then measure it. Instead, it uses a deep symmetry found in nature to break the problem down into many tiny, manageable pieces. By rearranging the problem into these smaller blocks, they can compute the answer in a fraction of the time it would take to store the full object. In a test case where the full object would require more storage space than exists on all the hard drives in the world, their method solved the problem in less than a minute.

The core of the problem lies in how these quantum states are combined. When scientists stack copies of a system, they are creating what is called a tensor power. If you have a single system and you stack it ten times, the mathematical description grows by a factor of the system's size raised to the tenth power. For a system that is already large, this number becomes astronomical. The researchers were interested in a specific type of measurement used to distinguish between different quantum states, a task central to quantum hypothesis testing. This measurement involves adding together several of these massive stacks, each weighted by a different number. When there are only two stacks to add, mathematicians have long known a shortcut to simplify the calculation. However, when a third stack is introduced, the shortcut vanishes. The third term cannot be easily expressed in terms of the others, and the calculation becomes a nightmare of exponential growth.

To solve this, the authors turned to a branch of mathematics called representation theory, which studies how symmetry groups act on spaces. They utilized a principle known as Schur–Weyl duality, which reveals that the massive stack of copies is not a single chaotic block, but rather a collection of smaller, independent blocks that do not interact with each other. Think of it like a massive library that, upon closer inspection, turns out to be a collection of small, separate rooms, each containing a specific type of book. The researchers found a way to identify these rooms without ever having to build the library. They proved that for any set of matrices representing these quantum states, the giant object can be split into these smaller pieces using a single, fixed transformation. This means the complex, high-dimensional problem can be replaced by a sum of many smaller, low-dimensional problems.

The breakthrough came when they combined this splitting technique with another mathematical identity, the Jacobi–Trudi formula. This formula allows the researchers to express the complex blocks as differences of simpler blocks made from symmetric powers. In the case of a three-by-three system, which is the smallest size where this new difficulty appears, every complex block could be reduced to the difference between just two explicitly calculable terms. This reduction is exact; it is not an approximation or a guess. It is a rigorous mathematical proof that the value of the giant object is exactly equal to the sum of these smaller, signed differences. Because the smaller blocks are so much tinier than the original object, they fit easily into computer memory.

The team implemented this method in a software package and tested it against the old, brute-force approach. They used random three-by-three matrices to represent quantum states and compared the results. For small numbers of copies, where both methods could run, the new method produced results that matched the old method to an extremely high degree of precision, with errors so small they were effectively zero. As they increased the number of copies, the old method became impossible. At a level where the full matrix would require roughly 2.4 quintillion bytes of storage—far more than any computer can hold—the new method calculated the answer in about 47 seconds on a standard computer processor. The largest block the new method had to handle was only about 18,000 by 18,000, a size that is trivial for modern computers.

The researchers also checked the stability of their method. Because the calculation involves subtracting two large numbers to get a small result, there is a risk that rounding errors in the computer could ruin the answer. They developed a way to monitor this potential cancellation and confirmed that for the tested range, the results remained stable and accurate. They noted that while the method works perfectly for two or three terms, it does not extend to the operator norm, a different type of measurement that relies on finding a maximum value rather than a sum. This limitation is inherent to the mathematical structure they used. However, for the specific problem of calculating the trace norm and determinants of these combinations, the method is exact and efficient.

This work provides a practical tool for exploring a regime of quantum physics that was previously inaccessible. It allows scientists to simulate and test hypotheses involving multiple quantum states with a level of detail that was previously impossible. The authors emphasize that this is not a magic trick that solves all quantum problems, but a precise mathematical reduction that turns an impossible calculation into a feasible one. By separating the problem into its fundamental symmetric parts, they have opened the door to studying finite copies of quantum states in a way that respects the limits of physical hardware. The code and data used in their study are available for others to verify and build upon, ensuring that this new path forward is open to the entire scientific community.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →