ترغب بنشر مسار تعليمي؟ اضغط هنا

We present observable lower bounds for several bipartite entanglement measures including entanglement of formation, geometric measure of entanglement, concurrence, convex-roof extended negativity, and G-concurrence. The lower bounds facilitate estima tes of these entanglement measures for arbitrary finite-dimensional bipartite states. Moreover, these lower bounds can be calculated analytically from the expectation value of a single observable. Based on our results, we use several real experimental measurement data to get lower bounds of entanglement measures for these experimentally realized states. In addition, we also study the relations between entanglement measures.
By using spontaneous Raman processes in the high gain regime, we produce two independent Raman Stokes fields from an atomic ensemble. Temporal beating is observed between the two directly generated Stokes fields in a single realization. The beat freq uency is found to be a result of an AC Stark frequency shift effect. However, due to the spontaneous nature of the process, the phases of the two Stokes fields change from one realization to another so that the beat signal disappears after average over many realizations. On the other hand, the beat signal is recovered in a two-photon correlation measurement, showing a two-photon interference effect. The two-photon beat signal enables us to obtain dephasing information in the Raman process. The dephasing effect is found to depend on the temperature of the atomic medium.
284 - Qing Chen , Sixia Yu , 2009
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we constru ct a family of valid Bell inequalities tolerating arbitrary $t$-qubit errors involving $3(t+1)$ qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.
102 - Sixia Yu , Qing Chen , C.H. Oh 2009
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear programming bo und. All these nonadditive codes can be characterized by a stabilizer-like structure and thus their encoding circuits can be designed in a straightforward manner.
Let $D$ be an unbounded domain in $RR^d$ with $dgeq 3$. We show that if $D$ contains an unbounded uniform domain, then the symmetric reflecting Brownian motion (RBM) on $overline D$ is transient. Next assume that RBM $X$ on $overline D$ is transient and let $Y$ be its time change by Revuz measure ${bf 1}_D(x) m(x)dx$ for a strictly positive continuous integrable function $m$ on $overline D$. We further show that if there is some $r>0$ so that $Dsetminus overline {B(0, r)}$ is an unbounded uniform domain, then $Y$ admits one and only one symmetric diffusion that genuinely extends it and admits no killings. In other words, in this case $X$ (or equivalently, $Y$) has a unique Martin boundary point at infinity.
Consider a reflecting diffusion in a domain in $R^d$ that acquires drift in proportion to the amount of local time spent on the boundary of the domain. We show that the stationary distribution for the joint law of the position of the reflecting proce ss and the value of the drift vector has a product form. Moreover, the first component is the symmetrizing measure on the domain for the reflecting diffusion without inert drift, and the second component has a Gaussian distribution. We also consider processes where the drift is given in terms of the gradient of a potential.
89 - Sixia Yu , Qing Chen , C.H. Oh 2007
We introduce a purely graph-theoretical object, namely the coding clique, to construct quantum errorcorrecting codes. Almost all quantum codes constructed so far are stabilizer (additive) codes and the construction of nonadditive codes, which are pot entially more efficient, is not as well understood as that of stabilizer codes. Our graphical approach provides a unified and classical way to construct both stabilizer and nonadditive codes. In particular we have explicitly constructed the optimal ((10,24,3)) code and a family of 1-error detecting nonadditive codes with the highest encoding rate so far. In the case of stabilizer codes a thorough search becomes tangible and we have classified all the extremal stabilizer codes up to 8 qubits.
333 - Sixia Yu , Qing Chen , C. H. Lai 2007
We report the first nonadditive quantum error-correcting code, namely, a $((9,12,3))$ code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors.
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا