Searcharxiv⌕ Search

arXiv subjects

Xiao-Bin Liang

Publications and source records attributed to Xiao-Bin Liang.

10 recordsLinked to original sources

Characterizing the superposition of arbitrary random quantum states and a known quantum state

The superposition of states is one of the most fundamental issues in the quantum world. Generally there do not exist physical operations to superpose two unknown random states with nonzero probability. We investigate the superposition problem of unknown qubit states with respect to a known qubit state. It is shown that under trace-nonincreasing completely positive operations the superposable state sets are located in some circles on the Bloch sphere. Meanwhile, we prove that the quantum states in a circle on the Bloch sphere are superposable with respect to a known state. Finally, for the high-dimensional case, we illustrate that any superposition transformation protocols will violate the no-cloning principle for almost all the states. Our results also promote the understanding and applications of the superposition principle in view of quantum no-go theorems.

quant-ph↗

Quantum Discord for multiqubit Systems

We evaluate analytically the quantum discord for a large family of multiqubit states. It is interesting to note that the quantum discord of three-qubits and five-qubits is the same, as is the quantum discord of two-qubits and six-qubits. We discover that the quantum discord of this family states can be concluded into three categories. The level surfaces of the quantum discord in the three categories is shown through images. Furthermore, we investigated the dynamic behavior of quantum discord under decoherence. For the odd partite systems, we prove the frozen phenomenon of quantum discord doesn't exist under the phase flip channel, while it can be found in the even partite systems.

quant-ph↗

Photonic implementation of quantum information masking

Masking of quantum information spreads it over nonlocal correlations and hides it from the subsystems. It is known that no operation can simultaneously mask all pure states [Phys. Rev. Lett. 120, 230501 (2018)], so in what sense is quantum information masking useful? Here, we extend the definition of quantum information masking to general mixed states, and show that the resource of maskable quantum states are far more abundant than the no-go theorem seemingly suggests. Geometrically, the simultaneously maskable states lays on hyperdisks in the state hypersphere, and strictly contain the broadcastable states. We devise a photonic quantum information masking machine using time-correlated photons to experimentally investigate the properties of qubit masking, and demonstrate the transfer of quantum information into bipartite correlations and its faithful retrieval. The versatile masking machine has decent extensibility, and may be applicable to quantum secret sharing and fault-tolerant quantum communication. Our results provide some insights on the comprehension and potential application of quantum information masking.

quant-ph↗

Optimal approximations of available states and a triple uncertainty relation

We investigate the optimal convex approximation of the quantum state with respect to a set of available states. By isometric transformation, we have presented the general mathematical model and its solutions together with a triple uncertainty equality relation. Meanwhile, we show a concise inequality criterion for decomposing qubit mixed states. The new results include previous ones as special cases. Our model and method may be applied to solve similar problems in high-dimensional and multipartite scenarios

quant-ph↗

Impossibility of masking a set of quantum states of nonzero measure

We study the quantum information masking based on isometric linear operators that distribute the information encoded in pure states to the correlations in bipartite states. It is shown that a isometric linear operator can not mask any nonzero measure set of pure states. We present a geometric characterization of the maskable sets, and show that any maskable set must be on a spherical circle in certain Euclidean spaces. Detailed examples and potential applications in such as secret sharing and quantum cryptography are analyzed.

quant-ph↗

Complete characterization of qubit masking

We study the problem of information masking through nonzero linear operators that distribute information encoded in single qubits to the correlations between two qubits. It is shown that a nonzero linear operator cannot mask any nonzero measure set of qubit states. We prove that the maximal maskable set of states on the Bloch sphere with respect to any masker is the ones on a spherical circle. Any states on a spherical circle on the Bloch sphere are maskable, which also proves the conjecture on maskable qubit states given by Modi et al. [Phys. Rev. Lett. 120, 230501 (2018)]. we provide explicitly operational unitary maskers for all maskable sets. As applications, different protocols for secret sharing are introduced.

quant-ph↗

Deterministic versus probabilistic quantum information masking

We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of d dimensional states, $\{ |a_1 \rangle_A, |t a_2 \rangle_A, \dots, |a_n \rangle_A \}$, $n \leq d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and derived for the case of two initial states.

quant-ph↗

Comment on "Optimal convex approximations of quantum states"

In a recent paper, M. F. Sacchi [Phys. Rev. A 96, 042325 (2017)] addressed the general problem of approximating an unavailable quantum state by the convex mixing of different available states. For the case of qubit mixed states, we show that the analytical solutions in some cases are invalid. In this Comment, we present complete analytical solutions for the optimal convex approximation. Our solutions can be viewed as correcting and supplementing the results in the aforementioned paper.

quant-ph↗

Complete Optimal Convex Approximations of Qubit States under $B_2$ Distance

We consider the optimal approximation of arbitrary qubit states with respect to an available states consisting the eigenstates of two of three Pauli matrices, the $B_2$-distance of an arbitrary target state. Both the analytical formulae of the $B_2$-distance and the corresponding complete optimal decompositions are obtained. The tradeoff relations for both the sum and the squared sum of the $B_2$-distances have been analytically and numerically investigated.

quant-ph↗