scholarly journals Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure

2004 ◽  
Vol 69 (6) ◽  
Author(s):  
Yishai Shimoni ◽  
Daniel Shapira ◽  
Ofer Biham
2020 ◽  
Vol 20 (13&14) ◽  
pp. 1124-1137
Author(s):  
Zhaofang Bai ◽  
Shuanping Shuanping Du

As an important quantum resource, quantum coherence play key role in quantum information processing. It is often concerned with manipulation of families of quantum states rather than individual states in isolation. Given two pairs of coherent states $(\rho_1,\rho_2)$ and $(\sigma_1,\sigma_2)$, we are aimed to study how can we determine if there exists a strictly incoherent operation $\Phi$ such that $\Phi(\rho_i) =\sigma_i,i = 1,2$. This is also a classic question in quantum hypothesis testing. In this note, structural characterization of coherent preorder under strongly incoherent operations is provided. Basing on the characterization, we propose an approach to realize coherence distillation from rank-two mixed coherent states to $q$-level maximally coherent states. In addition, one scheme of coherence manipulation between rank-two mixed states is also presented.


2004 ◽  
Vol 37 (39) ◽  
pp. 9251-9260 ◽  
Author(s):  
Hoshang Heydari ◽  
Gunnar Björk

2021 ◽  
Author(s):  
Kiara Hansenne ◽  
Zhen-Peng xu ◽  
Tristan Kraft ◽  
Otfried Gühne

Abstract Quantum networks are promising tools for the implementation of long-range quantum communication. The characterization of quantum correlations in networks and their usefulness for information processing is therefore central for the progress of the field, but so far only results for small basic network structures or pure quantum states are known. Here we show that symmetries provide a versatile tool for the analysis of correlations in quantum networks. We provide an analytical approach to characterize correlations in large network structures with arbitrary topologies. As examples, we show that entangled quantum states with a bosonic or fermionic symmetry can not be generated in networks; moreover, cluster and graph states are not accessible. Our methods can be used to design certification methods for the functionality of specific links in a network and have implications for the design of future network structures.


2015 ◽  
Vol 15 (7&8) ◽  
pp. 694-720 ◽  
Author(s):  
Srinivasan Arunachalam ◽  
Nathaniel Johnston ◽  
Vincent Russo

The absolute separability problem asks for a characterization of the quantum states $\rho \in M_m\otimes M_n$ with the property that $U\rho U^\dagger$ is separable for all unitary matrices $U$. We investigate whether or not it is the case that $\rho$ is absolutely separable if and only if $U\rho U^\dagger$ has positive partial transpose for all unitary matrices $U$. In particular, we develop an easy-to-use method for showing that an entanglement witness or positive map is unable to detect entanglement in any such state, and we apply our method to many well-known separability criteria, including the range criterion, the realignment criterion, the Choi map and its generalizations, and the Breuer--Hall map. We also show that these two properties coincide for the family of isotropic states, and several eigenvalue results for entanglement witnesses are proved along the way that are of independent interest.


Sign in / Sign up

Export Citation Format

Share Document