No Arabic abstract
In this paper, based on a matrix norm, we first present a ball of separable unnormalized states around the identity matrix for the bipartite quantum system, which is larger than the separable ball in Frobenius norm. Then the proposed ball is used to get not only simple sufficient conditions for the separability of pseudopure states and the states with strong positive partial transposes, but also a separable ball centered at the identity matrix for the multipartite quantum system.
Absolute separable states is a kind of separable state that remain separable under the action of any global unitary transformation. These states may or may not have quantum correlation and these correlations can be measured by quantum discord. We find that the absolute separable states are useful in quantum computation even if it contains infinitesimal quantum correlation in it. Thus to search for the class of two-qubit absolute separable states with zero discord, we have derived an upper bound for $Tr(varrho^{2})$, where $varrho$ denoting all zero discord states. In general, the upper bound depends on the state under consideration but if the state belong to some particular class of zero discord states then we found that the upper bound is state independent. Later, it is shown that among these particular classes of zero discord states, there exist sub-classes which are absolutely separable. Furthermore, we have derived necessary conditions for the separability of a given qubit-qudit states. Then we used the derived conditions to construct a ball for $2otimes d$ quantum system described by $Tr(rho^{2})leq Tr(X^{2})+2Tr(XZ)+Tr(Z^{2})$, where the $2otimes d$ quantum system is described by the density operator $rho$ which can be expressed by block matrices $X,Y$ and $Z$ with $X,Zgeq 0$. In particular, for qubit-qubit system, we show that the newly constructed ball contain larger class of absolute separable states compared to the ball described by $Tr(rho^{2})leq frac{1}{3}$. Lastly, we have derived the necessary condition in terms of purity for the absolute separability of a qubit-qudit system under investigation.
We define a negative entanglement measure for separable states which shows that how much entanglement one should compensate the unentangled state at least for changing it into an entangled state. For two-qubit systems and some special classes of states in higher-dimensional systems, the explicit formula and the lower bounds for the negative entanglement measure have been presented, and it always vanishes for bipartite separable pure states. The negative entanglement measure can be used as a useful quantity to describe the entanglement dynamics and the quantum phase transition. In the transverse Ising model, the first derivatives of negative entanglement measure diverge on approaching the critical value of the quantum phase transition, although these two-site reduced density matrices have no entanglement at all. In the 1D Bose-Hubbard model, the NEM as a function of $t/U$ changes from zero to negative on approaching the critical point of quantum phase transition.
Two-photon states entangled in continuous variables such as wavevector or frequency represent a powerful resource for quantum information protocols in higher-dimensional Hilbert spaces. At the same time, there is a problem of addressing separately the corresponding Schmidt modes. We propose a method of engineering two-photon spectral amplitude in such a way that it contains several non-overlapping Schmidt modes, each of which can be filtered losslessly. The method is based on spontaneous parametric down-conversion (SPDC) pumped by radiation with a comb-like spectrum. There are many ways of producing such a spectrum; here we consider the simplest one, namely passing the pump beam through a Fabry-Perot interferometer. For the two-photon spectral amplitude (TPSA) to consist of non-overlapping Schmidt modes, the crystal dispersion dependence, the length of the crystal, the Fabry-Perot free spectral range and its finesse should satisfy certain conditions. We experimentally demonstrate the control of TPSA through these parameters. We also discuss a possibility to realize a similar situation using cavity-based SPDC.
A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${rm gp}(G)$ of $G$. It is proved that $Ssubseteq V(G)$ is in general position if and only if the components of $G[S]$ are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of $S$. If ${rm diam}(G) = 2$, then ${rm gp}(G)$ is the maximum of $omega(G)$ and the maximum order of an induced complete multipartite subgraph of the complement of $G$. As a consequence, ${rm gp}(G)$ of a cograph $G$ can be determined in polynomial time. If $G$ is bipartite, then ${rm gp}(G) leq alpha(G)$ with equality if ${rm diam}(G) in {2,3}$. A formula for the general position number of the complement of an arbitrary bipartite graph is deduced and simplified for the complements of trees, of grids, and of hypercubes.
In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also implemented many logical gates (Pauli-X, Hadamard, and Conditional phase-shift gates). Simulation of Hadamard and Conditional phase-shift gates using Proteus Design Suite is also presented and discussed in this work.