Robust Decomposition of Quantum States

Gianni Cassinelli, Ernesto De Vito, Alberto Levrero

Peyman Azodi, Alireza Khayatian, Peyman Setoodeh +1 more

This paper presents a systematic method to decompose uncertain linear quantum input-output networks into uncertain and nominal subnetworks, when uncertainties are defined in SLH representation. To this aim, two decomposition theorems are stated, which show how an uncertain quantum network can be decomposed into nominal and uncertain subnetworks in cascaded connection and how uncertainties can be translated from SLH parameters into state-space parameters. As a potential application of the proposed decomposition scheme, robust stability analysis of uncertain quantum networks is briefly introduced. The proposed uncertainty decomposition theorems take account of uncertainties in all three parameters of a quantum network and bridge the gap between SLH modeling and state-space robust analysis theory for linear quantum networks.

Peyman Azodi, Peyman Setoodeh, Alireza Khayatian +1 more

Summary This paper presents a systematic method to decompose uncertain linear quantum input‐output networks into uncertain and nominal subnetworks, when uncertainties are defined in SLH representation. To this aim, two decomposition theorems are stated, which show how an uncertain quantum network can be decomposed into nominal and uncertain subnetworks in cascaded connection and how uncertainties can be translated from SLH parameters into state‐space parameters. As a potential application of the proposed decomposition scheme, robust stability analysis of uncertain quantum networks is briefly introduced. The proposed uncertainty decomposition theorems take account of uncertainties in all three parameters of a quantum network and bridge the gap between SLH modeling and state‐space robust analysis theory for linear quantum networks.

I. Raptis, Petros Wallden, Romàn R. Zapatrin

Seyed Javad Akhtarshenas, M. A. Jafarizadeh

By considering the decomposition of a generic two qubit density matrix presented by Wootters [W. K. Wootters, Phys. Rev. Lett. {\bf 80} 2245 (1998)], the robustness of entanglement for any mixed state of two qubit systems is obtained algebraically. It is shown that the robustness of entanglement is proportional to concurrence and in Bell decomposable density matrices it is equal to the concurrence. We also give an analytic expression for two separable states which wipe out all entanglement of these states. Since thus obtained robustness is function of the norm of the vectors in the decomposition we give an explicit parameterization for the decomposition.

Stefan Weigert