Searcharxiv⌕ Search

arXiv subjects

Sixia Yu

Publications and source records attributed to Sixia Yu.

At least 73 records · Page 4Linked to original sources

Quantum channels that preserve the commutativity

We identify and characterize all the local quantum channels that preserves the set of classical states, i.e., does not create any quantum correlations. At first we show that the quantum correlations cannot be created from without if and only if the local quantum channel preserves the commutativity, i.e., the images of any two commuting states also commute. And then we provide an operational necessary and sufficient criterion for a known quantum channel to preserve the commutativity as well as a single observable to witness an arbitrary unknown commutativity-preserving channel. All the distance-based measures for quantum correlations, e.g., the geometric measure, are non-increasing while the quantum discord defined by von Neumann measurements can be increasing or decreasing under local commutativity-preserving channels.

quant-ph↗

Minimal Kochen-Specker theorem in finite dimensions

In [1] we proved a strengthened Kochen-Specker theorem in 3 dimensions: non-contextual hidden variable (NCHV) models cannot reproduce all the quantum correlations of two compatible observables, which is a minimal requirement imposed on the NCHV models. Here we shall exclude the NCHV models with this minimal requirement in $d\ge 4$ dimensions by state-independent and experimentally testable inequalities satisfied by all NCHV models that are required to reproduce only the quantum correlations of at most two compatible observables. Furthermore our proofs use the smallest number of rays known so far, e.g., 25 (instead of 31) rays in $5$ dimensions and $5d-2\lfloor d/3\rfloor$ rays in $d\ge 6$ dimensions.

quant-ph↗

Observable estimation of entanglement of formation and quantum discord for bipartite mixed quantum states

We present observable lower and upper bounds for the entanglement of formation (EOF) and quantum discord (QD), which facilitates estimates of EOF and QD for arbitrary experimental unknown states in finite-dimensional bipartite systems. These bounds can be easily obtained by a few experimental measurements on a twofold copy $\varrho\otimes\varrho$ of the mixed states. Based on our results, we use the experimental measurement data of the real experiment given by Schmid \textit{et al.} [Phys. Rev. Lett. \textbf{101}, 260505 (2008)] to obtain the lower and upper bounds of EOF and QD for the experimental unknown state.

quant-ph↗

Bell Function Values Approach to Topological Quantum Phase Transitions

We investigate the relation between Bell function values (BFV) of the reduced density matrix and the topological quantum phase transitions in the Kitaev-Castelnovo-Chamon model. % [Phys. Rev. B \textbf{77}, %054433 (2008)]. We find that the first order derivative of BFV exhibits singular behavior at the critical point and we propose that it can serve as a good and convenient marker for the transition point. More interestingly, the value of the critical point can be analytically obtained in this approach. Since the BFV serves as a measure of nonlocality when it is greater than the classical bound of the correlation functions, our work has established a link between quantum nonlocality and phase transitions.

quant-ph↗

Quantum discord of two-qubit X-states

Quantum discord provides a measure for quantifying quantum correlations beyond entanglement and is very hard to compute even for two-qubit states because of the minimization over all possible measurements. Recently a simple algorithm to evaluate the quantum discord for two-qubit X-states is proposed by Ali, Rau and Alber [Phys. Rev. A 81, 042105 (2010)] with minimization taken over only a few cases. Here we shall at first identify a class of X-states, whose quantum discord can be evaluated analytically without any minimization, for which their algorithm is valid, and also identify a family of X-states for which their algorithm fails. And then we demonstrate that this special family of X-states provides furthermore an explicit example for the inequivalence between the minimization over positive operator-valued measures and that over von Neumann measurements.

quant-ph↗

Detecting the quantum discord of an unknown state by a single observable

We propose a single observable to witness the nonzero quantum discord of an unknown quantum state provided that we have four copies of the state. The expectation value of this observable provides a necessary and sufficient condition for nonzero quantum discord in $2\times N$ systems and a necessary condition in higher finite-dimensional bipartite systems. Furthermore, a nontrivial lower bound of quantum discord can be obtained from this expectation value. The proposed observable can be experimentally measured in exactly the same easy manner as that of the entanglement witness, moreover a quantum circuit is designed to determine the expectation value of our observable with four simultaneous local qubit-measurements.

quant-ph↗

State-independent proof of Kochen-Specker theorem with 13 rays

Quantum contextuality, as proved by Kochen and Specker, and also by Bell, should manifest itself in any state in any system with more than two distinguishable states and recently has been experimentally verified on various physical systems. However for the simplest system capable of exhibiting contextuality, a qutrit, the quantum contextuality is verified only state-dependently in experiment because too many (at least 31) observables are involved in all the known state-independent tests. Here we report an experimentally testable inequality involving only 13 observables that is satisfied by all non-contextual realistic models while being violated by all qutrit states. Thus our inequality will practically facilitate a state-independent test of the quantum contextuality for an indivisible quantum system. We provide also a record-breaking state-independent proof of the Kochen-Specker theorem with 13 directions determined by 26 points on the surface of a three by three magic cube.

quant-ph↗

All the stabilizer codes of distance 3

We give necessary and sufficient conditions for the existence of stabilizer codes $[[n,k,3]]$ of distance 3 for qubits: $n-k\ge \lceil\log_2(3n+1)\rceil+ε_n$ where $ε_n=1$ if $n=8\frac{4^m-1}3+\{\pm1,2\}$ or $n=\frac{4^{m+2}-1}3-\{1,2,3\}$ for some integer $m\ge1$ and $ε_n=0$ otherwise. Or equivalently, a code $[[n,n-r,3]]$ exists if and only if $n\leq (4^r-1)/3, (4^r-1)/3-n\notin\lbrace 1,2,3\rbrace$ for even $r$ and $n\leq 8(4^{r-3}-1)/3, 8(4^{r-3}-1)/3-n\not=1$ for odd $r$. Given an arbitrary length $n$ we present an explicit construction for an optimal quantum stabilizer code of distance 3 that saturates the above bound.

quant-ph↗

Tight bounds for the quantum discord

Quantum discord quantifies quantum correlations beyond entanglement and assumes nonzero values, which are notoriously hard to compute, for almost all quantum states. Here we provide computable tight bounds for the quantum discord for qubit-qudit states. In the case of two qubits our lower and upper bounds coincide for a 7-parameter family of filtered $X$-states, whose quantum discords can therefore be evaluated analytically. An application to the accessible information of the binary qubit channel is also presented. For the qubit-qudit state output by the circuit of deterministic computation with one qubit, nontrivial lower and upper bounds that respect the zero-discord conditions are obtained for its quantum discord.

quant-ph↗

Witnessing the quantum discord of all the unknown states

Like entanglement, quantum discord quantifies the quantum correlations. Unlike entanglement, whose detection is extremely difficult, the quantum discord of an arbitrary bipartite state allows itself to be detected perfectly by a single observable, the quantum discord witness. In particular, we report a single observable whose expectation value provides a necessary and sufficient condition for the vanishing quantum discord of an arbitrary bipartite unknown state with four copies. A quantum circuit is designed to measure the quantum discord witness by using only local qubit-measurements.

quant-ph↗

Strengthened quantum Hamming bound

We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound is further strengthened via the well-known Lloyd's theorem in classical coding theory, which claims that perfect codes, codes attaining the Hamming bound, do not exist if the Lloyd's polynomial has some non-integer zeros. Our bound characterizes quantitatively the improvement over the Hamming bound via the non-integerness of the zeros of the Lloyd's polynomial. In the case of 1-error correcting codes our bound holds true for impure codes as well, which we conjecture to be always true, and for stabilizer codes there is a 1-logical-qudit improvement for an infinite family of lengths.

quant-ph↗

Duality relation and joint measurement in a Mach-Zehnder Interferometer

The Mach-Zehnder interferometric setup quantitatively characterizing the wave-particle duality implements in fact a joint measurement of two unsharp observables. We present a necessary and sufficient condition for such a pair of unsharp observables to be jointly measurable. The condition is shown to be equivalent to a duality inequality, which for the optimal strategy of extracting the which-path information is more stringent than the Jaeger-Shimony-Vaidman-Englert inequality.

quant-ph↗

Error-Tolerating Bell Inequalities via Graph States

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 construct 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.

quant-ph↗

Entropic uncertainty relation for mutually unbiased bases

We derive new inequalities for the probabilities of projective measurements in mutually unbiased bases of a qudit system. These inequalities lead to wider ranges of validity and tighter bounds on entropic uncertainty inequalities previously derived in the literature.

quant-ph↗

Complementarity of information sent via different bases

We discuss quantitatively the complementarity of information transmitted by a quantum system prepared in a basis state in one out of several different mutually unbiased bases (MUBs). We obtain upper bounds on the information available to a receiver who has no knowledge of which MUB was chosen by the sender. These upper bounds imply a complementarity of information encoded via different MUBs and ultimately ensure the security in quantum key distribution protocols.

quant-ph↗

Two infinite families of nonadditive quantum error-correcting codes

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 bound. All these nonadditive codes can be characterized by a stabilizer-like structure and thus their encoding circuits can be designed in a straightforward manner.

quant-ph↗

Joint measurement of two unsharp observables of a qubit

We present a single inequality as the necessary and sufficient condition for two unsharp observables of a two-level system to be jointly measurable in a single apparatus and construct explicitly the joint observables. A complementarity inequality arising from the condition of joint measurement, which generalizes Englert's duality inequality, is derived as the trade-off between the unsharpnesses of two jointly measurable observables.

quant-ph↗

Quantum Error-Correcting Codes with Preexisting Protected Qubits

We provide a systematic way of constructing entanglement-assisted quantum error-correcting codes via graph states in the scenario of preexisting perfectly protected qubits. It turns out that the preexisting entanglement can help beat the quantum Hamming bound and can enhance (not only behave as an assistance) the performance of the quantum error correction. Furthermore we generalize the error models to the case of not-so-perfectly-protected qubits and introduce the quantity infidelity as a figure of merit and show that our code outperforms also the ordinary quantum error-correcting codes.

quant-ph↗