Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA sufficient Entanglement Criterion Based On Quantum Fisher Information and Variance
75
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We derive criterion in the form of inequality based on quantum Fisher information and quantum variance to detect multipartite entanglement. It can be regarded as complementary of the well-established PPT criterion in the sense that it can also detect bound entangled states. The inequality is motivated by Y.Akbari-Kourbolagh $et al.$[Phys. Rev A. 99, 012304 (2019)] which introduced a multipartite entanglement criterion based on quantum Fisher information. Our criterion is experimentally measurable for detecting any $N$-qudit pure state mixed with white noisy. We take several examples to illustrate that our criterion has good performance for detecting certain entangled states.
rate research
Read More
Genuine multipartite entanglement plays important roles in quantum information processing. The detection of genuine multipartite entanglement has been long time a challenging problem in the theory of quantum entanglement. We propose a criterion for detecting genuine tripartite entanglement of arbitrary dimensional tripartite states based on quantum Fisher information. We show that this criterion is more effective for some states in detecting genuine tripartite entanglement by detailed example.
Fragile quantum features such as entanglement are employed to improve the precision of parameter estimation and as a consequence the quantum gain becomes vulnerable to noise. As an established tool to subdue noise, quantum error correction is unfortunately overprotective because the quantum enhancement can still be achieved even if the states are irrecoverably affected, provided that the quantum Fisher information, which sets the ultimate limit to the precision of metrological schemes, is preserved and attained. Here, we develop a theory of robust metrological schemes that preserve the quantum Fisher information instead of the quantum states themselves against noise. After deriving a minimal set of testable conditions on this kind of robustness, we construct a family of $2t+1$ qubits metrological schemes being immune to $t$-qubit errors after the signal sensing. In comparison at least five qubits are required for correcting arbitrary 1-qubit errors in standard quantum error correction.
The Quantum Fisher Information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-Quantum Fisher Information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an $n$-qubit state using $2n$ qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmanns fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.
We present a necessary and sufficient condition for the separability of multipartite quantum states, this criterion also tells us how to write a multipartite separable state as a convex sum of separable pure states. To work out this criterion, we need to solve a set of equations, actually it is easy to solve these quations analytically if the density matrix of the given quantum state has few nonzero eigenvalues.
In order to provide a guaranteed precision and a more accurate judgement about the true value of the Cram{e}r-Rao bound and its scaling behavior, an upper bound (equivalently a lower bound on the quantum Fisher information) for precision of estimation is introduced. Unlike the bounds previously introduced in the literature, the upper bound is saturable and yields a practical instruction to estimate the parameter through preparing the optimal initial state and optimal measurement. The bound is based on the underling dynamics and its calculation is straightforward and requires only the matrix representation of the quantum maps responsible for encoding the parameter. This allows us to apply the bound to open quantum systems whose dynamics are described by either semigroup or non-semigroup maps. Reliability and efficiency of the method to predict the ultimate precision limit are demonstrated by {three} main examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
