Related papers: Uhlmann fidelities from tensor networks

In [Phys. Rev. A 107, 012427 (2023)], A. J. Baldwin and J. A. Jones proved that Uhlmann-Jozsa's fidelity between two quantum states $\rho$ and $\sigma$, i.e., $F(\rho,\sigma)~:=~(Tr\sqrt{\sqrt{\rho}\sigma\sqrt{\rho}})^2$, can be written in…

Uhlmann's fidelity function is one of the most widely used similarity measures in quantum theory. One definition of this function is that it is the minimum classical fidelity associated with a quantum-to-classical measurement procedure of…

Uhlmann's theorem states that, for any two quantum states $\rho_{AB}$ and $\sigma_A$, there exists an extension $\sigma_{AB}$ of $\sigma_A$ such that the fidelity between $\rho_{AB}$ and $\sigma_{AB}$ equals the fidelity between their…

We analyze the Uhlmann fidelity of a pair of $n$-mode Gaussian states of the quantum radiation field. This quantity is shown to be the product of an exponential function depending on the relative average displacement and a factor fully…

In this paper we discuss the fidelity of states in infinite dimensional systems, give an elementary proof of the infinite dimensional version of Uhlmann's theorem, and then, apply it to generalize several properties of the fidelity from…

Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be…

We introduce and study a one-parameter family of fidelity-type quantities based on the weighted spectral geometric mean, which we call the \emph{weighted spectral fidelity} \(…

The fidelity and local unitary transformation are two widely useful notions in quantum physics. We study two constrained optimization problems in terms of the maximal and minimal fidelity between two bipartite quantum states undergoing…

Computation of Uhlmann fidelity between many-body mixed states generally involves full diagonalization of exponentially large matrices. In this work, we introduce a polynomial-time algorithm to compute certified lower and upper bounds for…

Quantum fidelity between two density matrices, $F(\rho_1,\rho_2)$ is usually defined as the trace of the operator ${\cal F}=\sqrt{\sqrt{\rho_1} \rho_2 \sqrt{\rho_1}}$. We study the logarithmic spectrum of this operator, which we denote by…

Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size $N$, have long a concern. Here we propose the Schmidt tensor network state (Schmidt TNS)…

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we…

Tensor networks are often used to accurately represent ground states of quantum spin chains. Two popular choices of such tensor network representations can be seen to implement linear maps that correspond, respectively, to euclidean time…

For two unknown mixed quantum states $\rho$ and $\sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(\rho,\sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for…

The fidelity estimation between two quantum states is crucial for quantum computation and information science. However, an efficacious method for this, especially for mixed states and higher-dimensional density matrices, remains elusive.…

The entanglement fidelity provides a measure of how well the entanglement between two subsystems is preserved in a quantum process. By using a simple model we show that in some cases this quantity in its original definition fails in the…

Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficult to give good estimates of fidelity, especially when one…

Computing quantum state fidelity will be important to verify and characterize states prepared on a quantum computer. In this work, we propose novel lower and upper bounds for the fidelity $F(\rho,\sigma)$ based on the "truncated fidelity"…

Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…

Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum…