Estimation of trace distance between two arbitrary quantum states
Sanchita Ghosh, Anumita Mukhopadhyay, Anindita Bera, Prasenjit Deb, Shibdas Roy

TL;DR
This paper introduces a quantum algorithm utilizing exponentiation and IQPE to estimate trace distance between quantum states, demonstrating its effectiveness on simulations and IBM quantum hardware.
Contribution
It presents a novel quantum algorithm for calculating trace distance with proof-of-principle validation on quantum hardware.
Findings
Algorithm can estimate trace distance for pure and mixed states.
Demonstrated successful implementation on IBM quantum computers.
Achieves a time complexity of O(N^8) for N qubits.
Abstract
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 where 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.
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.
