Conditions based on calculating traces of matrix powers definitively determine if all eigenvalues of a Hermitian matrix fall within a specific range. This extends beyond proving purity and offers a key new method for characterising matrices using their power-trace relationships. These findings provide ‘witnesses’ capable of confirming whether quantum states are entangled, identifying negative eigenvalues in Hermitian operators, and detecting non-Hermitian behaviour in linear operators.

Calculations involving traces, sums of diagonal elements, of matrix powers definitively identify whether all eigenvalues of a Hermitian matrix fall within a given range. This goes beyond confirming if a quantum state is ‘pure’, offering instead a new way to characterise matrices through these power-trace relationships. Consequently, this provides a set of tools called ‘witnesses’ to confirm entanglement in quantum states; detect negative eigenvalues in operators; and recognise non-Hermitian behaviour in linear operators.

The University of Hong Kong researchers have developed conditions based on calculating traces of matrix powers that definitively identify whether all eigenvalues of a Hermitian matrix fall within a specified range. A Hermitian matrix is one equal to its own transpose; reflecting it across its main diagonal results in an identical original form. The team’s findings create ‘witnesses’ which can confirm properties such as entanglement or negative eigenvalues, but how many trace calculations are truly necessary to reliably characterise these complex systems.

Eigenvalue confinement via high‐order matrix power trace analysis

Specifying the traces of up to eight different integral powers of a matrix yields improved performance compared to previously published results; prior methods lacked such consistently reliable characterisation across uniformly generated matrices. This breakthrough establishes definitive conditions, based on calculating sums of diagonal elements from these matrix powers, to guarantee all eigenvalues of a Hermitian matrix reside within a specified set, extending beyond confirming purity or positivity. These findings generate ‘witnesses’, tools capable of verifying quantum entanglement, identifying negative eigenvalues in operators and detecting non-Hermitian characteristics with greater accuracy than existing techniques.

Calculations utilising traces, sums of diagonal elements, of up to eight distinct powers provide enhanced performance when characterising matrix properties as opposed to previous approaches. The team proved that guaranteeing all eigenvalues, fundamental characteristics of a Hermitian matrix, fall within a defined set is achievable using calculations involving multiple matrix powers; this extends established principles where traditionally determining if a density matrix is pure requires only the trace of its square.

Consequently, these results yield what are termed ‘witnesses’, enabling more accurate verification of quantum entanglement, identification of negative eigenvalues and detection of non-Hermitian behaviour than previously possible. However, translating these mathematical guarantees into strong performance with real-world experimental data containing inherent noise remains an ongoing challenge.

Eigenvalue-free characterisation of quantum states via iterated traces

The technique underpinning these advances centres on calculating traces by summing the diagonal elements of increasingly higher powers of a matrix. This process provides detailed information about eigenvalue distribution, characteristic roots defining state behaviour, rather than merely confirming whether a quantum state is ‘pure’. By examining how trace values change with each power, properties like entanglement or negativity can be deduced without directly solving for those elusive eigenvalues. In particular, this method establishes definitive conditions; it moves beyond suggestion to providing guarantees based solely on readily computable sums of matrix elements and their powers.

A new technique was developed to determine properties of quantum systems through calculations involving powers of matrices, avoiding computationally demanding direct solutions to complex eigenvalue problems. Unlike some previous methods that focused on distance from specific cones or used Hankel matrices, this treats positive and negative eigenvalues equally, offering broader applicability and potentially reducing computational load regardless of system size.

Eigenvalue verification via trace computations addresses limitations in pure state determination

Researchers at the University of Hong Kong have refined methods for determining if all eigenvalues, fundamental characteristics defining a matrix’s behaviour, fall within a specified range by utilising calculations involving traces of matrix powers; this offers an alternative to simply confirming whether a quantum state is ‘pure’. Establishing reliable methods for verifying these properties is vital for validating complex calculations employed in fields like materials science and cryptography where even small inaccuracies can lead to significant consequences. The team briefly acknowledges potential issues with numerical stability, which could limit real-world application when dealing with imprecise measurements or rounding errors during computation. The team from the University of Hong Kong has established a new method for fully defining eigenvalue ranges within Hermitian matrices through trace calculations, sums of diagonal elements, of increasing matrix powers, going beyond merely determining if a matrix is pure. This approach delivers definitive criteria guaranteeing all eigenvalues reside in a specified set without computationally expensive direct solutions.

Researchers at the University of Hong Kong developed a technique to verify whether all eigenvalues of a Hermitian matrix belong to a defined set by calculating traces of its powers. This provides an alternative method for confirming properties like purity, avoiding complex eigenvalue calculations that require significant computational resources. The team demonstrated this process using up to eight such calculations, generating ‘mathematical witnesses’ which can confirm quantum entanglement or identify non-Hermitian operators. They also noted potential limitations arising from numerical instability when dealing with imprecise data during computation.

👉 More information
🗞 From Certifying Rank $k$ Projectors To Non-Positivity, Entanglement, And Non-Hermitian Witnesses Through Traces Of Matrix Powers
✍️ H. F. Chau
🧠 ArXiv: https://arxiv.org/abs/2609.09557

More like this