Curator's Take
This research tackles a fundamental challenge in quantum computing: efficiently measuring how different two quantum states are from each other, which is crucial for everything from quantum error correction to machine learning algorithms. The proposed quantum algorithm represents a significant computational advance, offering polynomial scaling rather than the exponential costs typically associated with classical approaches to this problem. What makes this particularly exciting is that the team demonstrated their algorithm works on actual IBM quantum hardware, not just in simulation, suggesting it could be practically useful on today's noisy intermediate-scale quantum devices. This type of quantum state comparison capability could prove essential for benchmarking quantum algorithms and validating quantum computations as the field moves toward more complex applications.
— Mark Eatherly
Summary
When it comes to discriminating between two quantum states, trace distance is one of the well-known metrics used in quantum computation and quantum information theory. While there are several quantum algorithms for calculating the trace distance between two quantum states, computing it for any two general density matrices remains computationally demanding. In this paper, we propose a quantum algorithm based on the exponentiation of the density matrix and the improved quantum phase estimation (IQPE) to determine the trace distance for both pure and mixed states, with a time complexity of $O(N^8)$ where $N$ is the number of qubits of the given states. We demonstrate its ability to predict the quantity with proof-of-principle simulations and also quantum hardware computations on the IBM quantum computers, confirming its promise for near-term quantum devices.