New quantum algorithms for computing quantum entropies and distances
We propose a series of quantum algorithms for computing a wide range of quantum
entropies and distances, including the von Neumann entropy, quantum Rényi entropy, trace …
entropies and distances, including the von Neumann entropy, quantum Rényi entropy, trace …
Optimal trace distance and fidelity estimations for pure quantum states
Q Wang - IEEE Transactions on Information Theory, 2024 - ieeexplore.ieee.org
Measuring the distinguishability between quantum states is a basic problem in quantum
information theory. In this paper, we develop optimal quantum algorithms that estimate both …
information theory. In this paper, we develop optimal quantum algorithms that estimate both …
On estimating the trace of quantum state powers
We investigate the computational complexity of estimating the trace of quantum state powers
tr (ρq) for an n-qubit mixed quantum state ρ, given its state-preparation circuit of size poly (n) …
tr (ρq) for an n-qubit mixed quantum state ρ, given its state-preparation circuit of size poly (n) …
Uniformity testing when you have the source code
We study quantum algorithms for verifying properties of the output probability distribution of
a classical or quantum circuit, given access to the source code that generates the …
a classical or quantum circuit, given access to the source code that generates the …