arXiv subjects

Qing Chen

Publications and source records attributed to Qing Chen.

At least 91 records · Page 5Linked to original sources

arXiv2011

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↗

arXiv2011

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↗

arXiv2011

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↗

arXiv2011

Energy Efficiency and Goodput Analysis in Two-Way Wireless Relay Networks

In this paper, we study two-way relay networks (TWRNs) in which two source nodes exchange their information via a relay node indirectly in Rayleigh fading channels. Both Amplify-and-Forward (AF) and Decode-and-Forward (DF) techniques have been analyzed in the TWRN employing a Markov chain model through which the network operation is described and investigated in depth. Automatic Repeat-reQuest (ARQ) retransmission has been applied to guarantee the successful packet delivery. The bit energy consumption and goodput expressions have been derived as functions of transmission rate in a given AF or DF TWRN. Numerical results are used to identify the optimal transmission rates where the bit energy consumption is minimized or the goodput is maximized. The network performances are compared in terms of energy and transmission efficiency in AF and DF modes.

cs.IT↗

arXiv2011

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↗

arXiv2011

Goodput Maximization in Cooperative Networks with ARQ

In this paper, the average successful throughput, i.e., goodput, of a coded 3-node cooperative network is studied in a Rayleigh fading environment. It is assumed that a simple automatic repeat request (ARQ) technique is employed in the network so that erroneously received codeword is retransmitted until successful delivery. The relay is assumed to operate in either amplify-and-forward (AF) or decode-and-forward (DF) mode. Under these assumptions, retransmission mechanisms and protocols are described, and the average time required to send information successfully is determined. Subsequently, the goodput for both AF and DF relaying is formulated. The tradeoffs and interactions between the goodput, transmission rates, and relay location are investigated and optimal strategies are identified.

cs.IT↗

arXiv2010

Energy Efficiency Analysis in Amplify-and-Forward and Decode-and-Forward Cooperative Networks

In this paper, we have studied the energy efficiency of cooperative networks operating in either the fixed Amplifyand- Forward (AF) or the selective Decode-and-Forward (DF) mode. We consider the optimization of the M-ary quadrature amplitude modulation (MQAM) constellation size to minimize the bit energy consumption under given bit error rate (BER) constraints. In the computation of the energy expenditure, the circuit, transmission, and retransmission energies are taken into account. The link reliabilities and retransmission probabilities are determined through the outage probabilities under the Rayleigh fading assumption. Several interesting observations with practical implications are made. It is seen that while large constellations are preferred at small transmission distances, constellation size should be decreased as the distance increases; the cooperative gain is computed to compare direct transmission and cooperative transmission.

cs.IT↗

arXiv2009

Energy-Efficient Modulation Design for Reliable Communication in Wireless Networks

In this paper, we have considered the optimization of the $M$-ary quadrature amplitude modulation (MQAM) constellation size to minimize the bit energy consumption under average bit error rate (BER) constraints. In the computation of the energy expenditure, the circuit, transmission, and retransmission energies are taken into account. A combined log-normal shadowing and Rayleigh fading model is employed to model the wireless channel. The link reliabilities and retransmission probabilities are determined through the outage probabilities under log-normal shadowing effects. Both single-hop and multi-hop transmissions are considered. Through numerical results, the optimal constellation sizes are identified. Several interesting observations with practical implications are made. It is seen that while large constellations are preferred at small transmission distances, constellation size should be decreased as the distance increases. Similar trends are observed in both fixed and variable transmit power scenarios. We have noted that variable power schemes can attain higher energy-efficiencies. The analysis of energy-efficient modulation design is also conducted in multi-hop linear networks. In this case, the modulation size and routing paths are jointly optimized, and the analysis of both the bit energy and delay experienced in the linear network is provided.

cs.IT↗

arXiv2009

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↗

arXiv2009

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↗

arXiv2008

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↗

arXiv2008

Graphical Nonbinary Quantum Error-Correcting Codes

In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, $[[6,2,3]]_p$, $[[7,3,3]]_p$, $[[8,2,4]]_p$ and $[[8,4,3]]_p$ for any odd dimension $p$ and a family of nonadditive code $((5,p,3))_p$ for arbitrary $p>3$. In the case of composite numbers as dimensions, we also construct a family of stabilizer codes $((6,2\cdot p^2,3))_{2p}$ for odd $p$, whose coding subspace is {\em not} of a dimension that is a power of the dimension of the physical subsystem.

quant-ph↗

arXiv2007

Graphical Quantum Error-Correcting Codes

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

quant-ph↗

arXiv2007

Optimal 1->M universal quantum cloning via spin networks

We present a scheme that transform 1 qubit to M identical copies with optimal fidedelity via free dynamical evolution of spin star networks. We show that the Heisenberg XXZ coupling can fulfill the challenge. The initial state of the copying machine and the parameters of the spin Hamiltonian are discussed in detail. Furthermore we have proposed a feasible method to prepare the initial state of the copying machine.

quant-ph↗

arXiv2007

Nonadditive quantum error-correcting code

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.

quant-ph↗

arXiv2006

Conclusive quantum-state transfer with a single randomly coupled spin chain

We studied the quantum state transfer in randomly coupled spin chains. By using local memories storing the information and dividing the task into transfer portion and decoding portion, conclusive transfer was ingeniously achieved with just one single spin chain. In our scheme, the probability of successful transfer can be made arbitrary close to unity. Especially, our scheme is a good protocol to decode information from memories without adding another spin chain. Compared with Time-reversed protocol, the average decoding time is much less in our scheme.

quant-ph↗

arXiv2006

Repeat-Until-Success Generation of Symmetric States without External Control

In the present paper, we propose a "repeat-until-success" scheme induced by single particle measurement to generate arbitrary symmetric states based on spin network. This protocol requires no modulated controls during the whole process and it provides a persistent approach towards the desired symmetric state. As a special case, we demonstrate that W state can be created with unit probability within this framework.

quant-ph↗

arXiv2005

Optimal quantum cloning via spin networks

In this paper we present an approach to quantum cloning via free dynamical evolution of spin networks. By properly designing the network and the couplings between spins, we show that optimal 1->M phase covariant cloning can be achieved without any external control. Especially, when M is an odd number, the optimal phase-covariant cloning can be achieved without ancillas. Moreover, we demonstrate that the same framework is capable for optimal 1->2 universal cloning.

quant-ph↗