arXiv subjects

Qiao-Yan Wen

Publications and source records attributed to Qiao-Yan Wen.

At least 37 records · Page 2Linked to original sources

arXiv2016

Coherence of Superpositions

Quantum coherence is important in quantum mechanics, and its essence is from superposition principle. We study the coherence of any two pure states and that of their arbitrary superposition, and obtain the relationship between them. In the case that the two states have support on orthogonal subspaces, the relationship is simple, that is, the difference between the coherence of their superposition state and the average coherence of them is smaller than 1. In other cases, we obtain different and a little more complicated relationships. Furthermore, we also obtain the lower bound of coherence of superpositions.

quant-ph↗

arXiv2016

Generic Quantum Walks with Memory

Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the potential of QWM. In this work, through presenting the one-to-one correspondence between QWM on a regular graph and quantum walks without memory(QWoM) on line digraph of the regular graph, we construct a generic model of QWM on regular graphs. This construction gives a general scheme for building all possible standard QWM on regular graphs and makes it possible to study properties of different kinds of QWM. Here, by taking the simplest example which is QWM with 1 memory on the line, we analyze some properties of QWM, such as variance, occupancy rate and localization.

quant-ph↗

arXiv2016

Quantum algorithm for association rules mining

Association rules mining is one of the most important problems in knowledge discovery and data mining. The goal of it is to acquire consumption habits of customers by discovering the relationships between items from a transaction database that has a large number of transactions and items. The most compute intensive process for ARM is to find out the frequent 1-itemsets and 2-itemsets. In this paper, we propose a quantum algorithm for finding out the frequent 1-itemsets and 2-itemsets. In our algorithm, to mine the frequent 1-itemsets efficiently, we use the technique of amplitude amplification. To mine the frequent 2-itemsets efficiently, we propose a new tomography scheme, i.e., pure-state-based quantum state tomography. It is shown that our algorithm is potential to achieve exponential speedup in the number of transactions and polynomial speedup in the number of items over the classical algorithm.

quant-ph↗

arXiv2015

Constructing locally indistinguishable orthogonal product bases in an $m \otimes n$ system

Recently, Zhang et al [Phys. Rev. A 92, 012332 (2015)] presented $4d-4$ orthogonal product states that are locally indistinguishable and completable in a $d\otimes d$ quantum system. Later, Zhang et al. [arXiv: 1509.01814v2 (2015)] constructed $2n-1$ orthogonal product states that are locally indistinguishable in $m\otimes n$ ($3\leq m \leq n$). In this paper, we construct a locally indistinguishable and completable orthogonal product basis with $4p-4$ members in a general $m\otimes n$ ($3\leq m \leq n$) quantum system, where $p$ is an arbitrary integer from $3$ to $m$, and give a very simple but quite effective proof for its local indistinguishability. Specially, we get a completable orthogonal product basis with $8$ members that cannot be locally distinguished in $m\otimes n$ ($3\leq m \leq n$) when $p=3$. It is so far the smallest completable orthogonal product basis that cannot be locally distinguished in a $m\otimes n$ quantum system. On the other hand, we construct a small locally indistinguishable orthogonal product basis with $2p-1$ members, which is maybe uncompletable, in $m\otimes n$ ($3\leq m \leq n$ and $p$ is an arbitrary integer from $3$ to $m$). We also prove its local indistinguishability. As a corollary, we give an uncompletable orthogonal product basis with $5$ members that are locally indistinguishable in $m\otimes n$ ($3\leq m \leq n$). All the results can lead us to a better understanding of the structure of a locally indistinguishable product basis in $m \otimes n$.

quant-ph↗

arXiv2015

Local indistinguishability of orthogonal product states

In the general bipartite quantum system $m \otimes n$, Wang \emph{et al.} [Y.-L Wang \emph{et al.}, Phys. Rev. A \textbf{92}, 032313 (2015)] presented $3(m+n)-9$ orthogonal product states which cannot be distinguished by local operations and classical communication (LOCC). In this paper, we aim to construct less locally indistinguishable orthogonal product states in $m\otimes n $. First, in $3\otimes n (3< n)$ quantum system, we construct $3n-2$ locally indistinguishable orthogonal product states which are not unextendible product bases. Then, for $m\otimes n (4\leq m\leq n)$, we present $3n+m-4$ orthogonal product states which cannot be perfectly distinguished by LOCC. Finally, in the general bipartite quantum system $m\otimes n(3\leq m\leq n)$, we show a smaller set with $2n-1$ orthogonal product states and prove that these states are LOCC indistinguishable using a very simple but quite effective method. All of the above results demonstrate the phenomenon of nonlocality without entanglement.

quant-ph↗

arXiv2015

Multi-user quantum key distribution with collective eavesdropping detection over collective-noise channels

A multi-user quantum key distribution protocol is proposed with single particles and the collective eavesdropping detection strategy on a star network. By utilizing this protocol, any two users of the network can accomplish quantum key distribution with the help of a serving center. Due to the utilization of collective eavesdropping detection strategy, the users of the protocol just need have the ability of performing certain unitary operations. Furthermore, we present three fault-tolerant versions of the proposed protocol, which can combat with the errors over different collective-noise channels. The security of all the proposed protocols is guaranteed by the theorems on quantum operation discrimination.

quant-ph↗

arXiv2015

Semi-device-independent randomness expansion with partially free random sources

By proposing device-independent protocols, S. Pironio et al. [Nature 464, 1021-1024 (2010)] and R. Colbeck et al. [Nature Physics 8, 450-453 (2012)] proved that new randomness can be generated by using perfectly free random sources or partially free ones as seed. Subsequently, Li et al. [Phys. Rev. A 84, 034301 (2011)] studied this topic in the framework of semi-device-independent and proved that new randomness can be obtained from perfectly free random sources. Here we discuss whether and how partially free random sources bring us new randomness in semi-device-independent scenario. We propose a semi-device-independent randomness expansion protocol with partially free random sources, and obtain the condition that the partially free random sources should satisfy to generate new randomness. In the process of analysis, we acquire a new 2-dimensional quantum witness. Furthermore, we get the analytic relationship between the generated randomness and the 2-dimensional quantum witness violation.

quant-ph↗

arXiv2014

General bounds for quantum discord and discord distance

For any bipartite state, how strongly can one subsystem be quantum correlated with another? Using the Koashi-Winter relation, we study the upper bound of purified quantum discord, which is given by the sum of the von Neumann entropy of the unmeasured subsystem and the entanglement of formation shared between the unmeasured subsystem with the environment. In particular, we find that the Luo et al.'s conjecture on the quantum correlations and the Lindblad conjecture are all ture, when the entanglement of formation vanishes. Let the difference between the left discord and the right discord be captured by the discord distance. If the Lindblad conjecture is true, we show that the joint entropy is a tight upper bound for the discord distance. Further, we obtain a necessary and sufficient condition for saturating upper bounds of purified quantum discord and discord distance separately with the equality conditions for the Araki-Lieb inequality and the Lindblad conjecture. Furthermore, we show that the subadditive relation holds for any bipartite quantum discord.

quant-ph↗

arXiv2014

Necessary and sufficient conditions for positive semidefinite quantum mutual information matrices

For any $n$-partite state $ρ_{A_{1}A_{2}\cdot\cdot\cdot A_{n}}$, we define its quantum mutual information matrix as an $n$ by $n$ matrix whose $(i,j)$-entry is given by quantum mutual information $I(ρ_{A_{i}A_{j}})$. Although each entry of quantum mutual information matrix, like its classical counterpart, is also used to measure bipartite correlations, the similarity ends here: quantum mutual information matrices are not always positive semidefinite even for collections of up to 3-partite states. In this work, we obtain necessary and sufficient conditions for the positive semidefinite quantum mutual information matrix. We further define the \emph{genuine} $n$-partite mutual information which can be easily calculated. This definition is symmetric, nonnegative, bounded and more accurate for measuring multipartite states.

quant-ph↗

arXiv2014

Post-processing of the oblivious key in quantum private queries

Quantum private query (QPQ) is a kind of quantum protocols to protect both users' privacy in their communication. There is an interesting example, that is, Alice wants to buy one item from Bob's database, which is composed of a quantity of valuable messages. QPQ protocol is the communication procedure ensuring that Alice can get only one item from Bob, and at the same time, Bob cannot know which one was taken by Alice. Owing to its practicability, quantum-key-distribution-based QPQ has draw much attention in recent years. However, the post-processing of the key in such protocols, called oblivious key, remains far from being satisfactorily known. Especially, the error correction method for such special key is still missing. Here we focus on the post-processing of the oblivious key, including both dilution and error correction. On the one hand, we demonstrate that the previous dilution method, which greatly reduces the communication complexity, will bring Alice the chance to illegally obtain much additional information about Bob's database. Simulations show that by very limited queries Alice can obtain the whole database. On the other hand, we present an effective error-correction method for the oblivious key, which completes its post-processing and makes such QPQ more practical.

quant-ph↗

arXiv2014

Security flaw of counterfactual quantum cryptography in practical setting

Recently, counterfactual quantum cryptography proposed by T. G. Noh [Phys. Rev. Lett. 103, 230501 (2009)] becomes an interesting direction in quantum cryptography, and has been realized by some researchers (such as Y. Liu et al's [Phys. Rev. Lett. 109, 030501 (2012)]). However, we find out that it is insecure in practical high lossy channel setting. We analyze the secret key rates in lossy channel under a polarization-splitting-measurement attack. Analysis indicates that the protocol is insecure when the loss rate of the one-way channel exceeds $50%$.

quant-ph↗

arXiv2014

Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement

In this paper, we present a semi-loss-tolerant strong quantum coin-flipping (QCF) protocol with the best bias of 0.3536. Our manuscript applies Quantum non-demolition (QND) measurement to quantum coin-flipping protocol. Furthermore, a single photon as a single qubit is used to avoid the difficult implementation of EPR resources. We also analyze the security of our protocol obtaining the best result among all coin-flipping protocols considering loss. A semi-loss-tolerant Quantum Dice Rolling (QDR) protocol is first proposed, and the security of corresponding three-party QDR is analyzed to better demonstrate the security of our QCF.

quant-ph↗

arXiv2013

Cryptanalysis of a multi-party quantum key agreement protocol with single particles

Recently, Sun et al. [Quant Inf Proc DOI: 10.1007/s11128-013-0569-x] presented an efficient multi-party quantum key agreement (QKA) protocol by employing single particles and unitary operations. The aim of this protocol is to fairly and securely negotiate a secret session key among $N$ parties with a high qubit efficiency. In addition, the authors claimed that no participant can learn anything more than his/her prescribed output in this protocol, i.e., the sub-secret keys of the participants can be kept secret during the protocol. However, here we points out that the sub-secret of a participant in Sun et al.'s protocol can be eavesdropped by the two participants next to him/her. In addition, a certain number of dishonest participants can fully determine the final shared key in this protocol. Finally, we discuss the factors that should be considered when designing a really fair and secure QKA protocol.

quant-ph↗

arXiv2013

Enhanced No-Go Theorem for Quantum Position Verification

Based on the instantaneous nonlocal quantum computation (INQC), Buhrman et al. proposed an excellent attack strategy to quantum position verification (QPV) protocols in 2011, and showed that, if the colluding adversaries are allowed to previously share unlimited entangled states, it is impossible to design an unconditionally secure QPV protocol in the previous model. Here, trying to overcome this no-go theorem, we find some assumptions in the INQC attack, which are implicit but essential for the success of this attack, and present three different QPV protocols where these assumptions are not satisfied. We show that for the general adversaries, who execute the attack operations at every common time slot or the time when they detect the arrival of the challenge signals from the verifiers, secure QPV is achievable. This implies practically secure QPV can be obtained even if the adversaries is allowed to share unlimited entanglement previously. Here by "practically" we mean that in a successful attack the adversaries need launch a new round of attack on the coming qubits with extremely high frequency so that none of the possible qubits, which may be sent at random time, will be missed. On the other side, using such Superdense INQC (SINQC) attack, the adversaries can still attack the proposed protocols successfully in theory. The particular attack strategies to our protocols are presented respectively. On this basis, we demonstrate the impossibility of secure QPV with looser assumptions, i.e. the enhanced no-go theorem for QPV.

quant-ph↗

arXiv2012

Semi-Loss-Tolerant Strong Coin Flipping Protocol Using EPR Pairs

In this paper, we present a quantum strong coin flipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. Therefore we call our protocol semi-loss-tolerant. We also show that the bias decreases with decreasing $p$. When $p$ approaches 0, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. What's more, experimental feasibility is discussed and demonstrated. Compared with previous qubit-based loss-tolerant SCF protocols, we introduce the EPR pair to keep our protocol loss-tolerant while trying to push down the bias. In addition, a quantum memory storage is used and the losses in it has been taken into account. We obtain the bias in the fair scenario as a function of $p$, where $p$ is the probability that the particle in Bob's quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. We also show that the bias decreases with decreasing $p$. When $p$ approaches 0, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties' optimal cheating strategies are also given and analyzed. Besides, experimental feasibility is discussed and demonstrated.

quant-ph↗

arXiv2011

Analysis and improvement of a strongly secure certificateless key exchange protocol without pairing

Recently, Yang and Tan proposed a certificateless key exchange protocol without pairing, and claimed their scheme satisfies forward secrecy, which means no adversary could derive an already-established session key unless the full user secret keys (including a private key and an ephemeral secret key) of both communication parties are compromised. However, in this paper, we point out their protocol is actually not secure as claimed by presenting an attack launched by an adversary who has learned the private key of one party and the ephemeral secret key of the other, but not the full user secret keys of both parties. Furthermore, to make up this flaw, we also provide an improved protocol in which the private key and the ephemeral secret key are closely intertwined with each other for generating the session key, thus above attack can be efficiently resisted.

cs.CR↗

arXiv2011

Flexible quantum private queries based on quantum key distribution

We present a flexible quantum-key-distribution-based protocol for quantum private queries. Similar to M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], it is loss tolerant, practical and robust against quantum memory attack. Furthermore, our protocol is more flexible and controllable. We show that, by adjusting the value of $θ$, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter $k$ is generally smaller (even $k=1$ can be achieved) when $θ<π/4$, which implies lower complexity of both quantum and classical communications. Furthermore, the users can choose a smaller $θ$ to get better database security, or a larger $θ$ to obtain a lower probability with which Bob can correctly guess the address of Alice's query.

quant-ph↗

arXiv2011

Cryptanalysis of the arbitrated quantum signature protocols

As a new model for signing quantum message, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver Bob can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender Alice can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics in future study on AQS protocols.

quant-ph↗