arXiv subjects

Su-Juan Qin

Publications and source records attributed to Su-Juan Qin.

36 records · Page 2Linked to original sources

arXiv2021

Block-encoding based quantum algorithm for linear systems with displacement structures

Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient and memory-reduced quantum algorithms for solving linear systems with such structures by devising a new approach to implement the block-encodings of these structured matrices. More specifically, by decomposing $n\times n$ dense matrices into linear combinations of displacement matrices, we first deduce the parameterized representations of the matrices with displacement structures so that they can be treated similarly. With such representations, we then construct $ε$-approximate block-encodings of these structured matrices in two different data access models, i.e., the black-box model and the QRAM data structure model. It is shown the quantum linear system solvers based on the proposed block-encodings provide a quadratic speedup with respect to the dimension over classical algorithms in the black-box model and an exponential speedup in the QRAM data structure model. In particular, these linear system solvers subsume known results with significant improvements and also motivate new instances where there was no specialized quantum algorithm before. As an application, one of the quantum linear system solvers is applied to the linear prediction of time series, which justifies the claimed quantum speedup is achievable for problems of practical interest.

quant-ph↗

arXiv2021

Quantum algorithms for anomaly detection using amplitude estimation

Anomaly detection plays a critical role in fraud detection, health care, intrusion detection, military surveillance, etc. Anomaly detection algorithm based on density estimation (called ADDE algorithm) is one of widely used algorithms. Liang et al. proposed a quantum version of the ADDE algorithm [Phys. Rev. A 99, 052310 (2019)] and it is believed that the algorithm has exponential speedups on both the number and the dimension of training data point over the classical algorithm. In this paper, we find that Liang et al.'s algorithm doesn't actually execute. Then we propose a new quantum ADDE algorithm based on amplitude estimation. It is shown that our algorithm can achieves exponential speedup on the number $M$ of training data points compared with the classical counterpart. Besides, the idea of our algorithm can be applied to optimize the anomaly detection algorithm based on kernel principal component analysis (called ADKPCA algorithm). Different from the quantum ADKPCA proposed by Liu et al. [Phys. Rev. A 97, 042315 (2018)], compared with the classical counterpart, which offer exponential speedup on the dimension $d$ of data points, our algorithm achieves exponential speedup on $M$.

quant-ph↗

arXiv2020

Improved quantum algorithm for A-optimal projection

Dimensionality reduction (DR) algorithms, which reduce the dimensionality of a given data set while preserving the information of the original data set as well as possible, play an important role in machine learning and data mining. Duan \emph{et al}. proposed a quantum version of the A-optimal projection algorithm (AOP) for dimensionality reduction [Phys. Rev. A 99, 032311 (2019)] and claimed that the algorithm has exponential speedups on the dimensionality of the original feature space $n$ and the dimensionality of the reduced feature space $k$ over the classical algorithm. In this paper, we correct the time complexity of Duan \emph{et al}.'s algorithm to $O(\frac{κ^{4s}\sqrt{k^s}} {ε^{s}}\mathrm{polylog}^s (\frac{mn}ε))$, where $κ$ is the condition number of a matrix that related to the original data set, $s$ is the number of iterations, $m$ is the number of data points and $ε$ is the desired precision of the output state. Since the time complexity has an exponential dependence on $s$, the quantum algorithm can only be beneficial for high dimensional problems with a small number of iterations $s$. To get a further speedup, we propose an improved quantum AOP algorithm with time complexity $O(\frac{s κ^6 \sqrt{k}}ε\mathrm{polylog}(\frac{nm}ε) + \frac{s^2 κ^4}ε\mathrm{polylog}(\frac{κk}ε))$ and space complexity $O(\log_2(nk/ε)+s)$. With space complexity slightly worse, our algorithm achieves at least a polynomial speedup compared to Duan \emph{et al}.'s algorithm. Also, our algorithm shows exponential speedups in $n$ and $m$ compared with the classical algorithm when both $κ$, $k$ and $1/ε$ are $O(\mathrm{polylog}(nm))$.

quant-ph↗

arXiv2019

Quantum algorithm for logistic regression

Logistic regression (LR) is an important machine learning model for classification, with wide applications in text classification, image analysis and medicine diagnosis, etc. However, training LR generally entails an iterative gradient descent method, and is quite time consuming when processing big data sets. To solve this problem, we present a quantum algorithm for LR to implement the key task of the gradient descent method, obtaining the classical gradients in each iteration. It is shown that our algorithm achieves exponential speedup over its classical counterpart in each iteration when the dimension of each data point M grows polylogarithmically with the number of data points N, i.e.,M=O(polylog N). It is worth noting that the optimal model parameters are finally derived by performing simple calculations on the obtained gradients. So once the optimal model parameters are determined, one can use them to classify new data at little cost.

quant-ph↗

arXiv2018

Asymptotic Quantum Algorithm for the Toeplitz Systems

Solving the Toeplitz systems, which is to find the vector $x$ such that $T_nx = b$ given an $n\times n$ Toeplitz matrix $T_n$ and a vector $b$, has a variety of applications in mathematics and engineering. In this paper, we present a quantum algorithm for solving the linear equations of Toeplitz matrices, in which the Toeplitz matrices are generated by discretizing a continuous function. It is shown that our algorithm's complexity is nearly $O(κ\textrm{log}^2 n)$, where $κ$ and $n$ are the condition number and the dimension of $T_n$ respectively. This implies our algorithm is exponentially faster than the best classical algorithm for the same problem if $κ=O(\textrm{poly}(\textrm{log}\,n))$. Since no assumption on the sparseness of $T_n$ is demanded in our algorithm, it can serve as an example of quantum algorithms for solving non-sparse linear systems.

quant-ph↗

arXiv2017

Assisted coherence distillation of certain mixed states

In the task of assisted coherence distillation via the set of operations X, where X is either local incoherent operations and classical communication (LICC), local quantum-incoherent operations and classical communication (LQICC), separable incoherent operations (SI), or separable quantum incoherent operations (SQI), two parties, namely Alice and Bob, share many copies of a bipartite joint state. The aim of the process is to generate the maximal possible coherence on the subsystem of Bob. In this paper, we investigate the assisted coherence distillation of some special mixed states, the states with vanished basis-dependent discord and Werner states. We show that all the four sets of operations are equivalent for assisted coherence distillation, whenever Alice and Bob share one of those mixed quantum states. Moreover, we prove that the assisted coherence distillation of the former can reach the upper bound, namely QI relative entropy, while that of the latter can not. Meanwhile, we also present a sufficient condition such that the assistance of Alice via the set of operations X can not help Bob improve his distillable coherence, and this condition is that the state shared by Alice and Bob has vanished basis-dependent discord.

quant-ph↗

arXiv2017

Relating quantum coherence and correlations with entropy-based measures

Quantum coherence as an important quantum resource plays a key role in quantum theory. In this paper, using entropy-based measures, we investigate the relations between quantum correlated coherence, which is the coherence between subsystems [K. C. Tan, H. Kwon, C. Y. Park, and H. Jeong, Phys. Rev. A 94, 022329 (2016)], and two main kinds of quantum correlations as defined by quantum discord as well as quantum entanglement. In particular, we show that quantum discord and quantum entanglement can be well characterized by quantum correlated coherence. Moreover, we prove that the entanglement measure formulated by quantum correlated coherence is lower and upper bounded by the relative entropy of entanglement and the entanglement of formation, respectively, and equal to the relative entropy of entanglement for maximally correlated states.

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↗

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↗

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↗

arXiv2011

Dense-Coding Attack on Three-Party Quantum Key Distribution Protocols

Cryptanalysis is an important branch in the study of cryptography, including both the classical cryptography and the quantum one. In this paper we analyze the security of two three-party quantum key distribution protocols (QKDPs) proposed recently, and point out that they are susceptible to a simple and effective attack, i.e. the dense-coding attack. It is shown that the eavesdropper Eve can totally obtain the session key by sending entangled qubits as the fake signal to Alice and performing collective measurements after Alice's encoding. The attack process is just like a dense-coding communication between Eve and Alice, where a special measurement basis is employed. Furthermore, this attack does not introduce any errors to the transmitted information and consequently will not be discovered by Alice and Bob. The attack strategy is described in detail and a proof for its correctness is given. At last, the root of this insecurity and a possible way to improve these protocols are discussed.

quant-ph↗

arXiv2008

Quantum asymmetric cryptography with symmetric keys

Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use symmetric keys in such a scheme, which is quite different from that in conventional public-key cryptography. The security of our scheme is analyzed and some features are discussed. Furthermore, the state-estimation attack to a prior QPKC scheme is demonstrated.

quant-ph↗

arXiv2008

Cryptanalysis of the Hillery-Buzek-Berthiaume quantum secret-sharing protocol

The participant attack is the most serious threat for quantum secret-sharing protocols. We present a method to analyze the security of quantum secret-sharing protocols against this kind of attack taking the scheme of Hillery, Buzek, and Berthiaume (HBB) [Phys. Rev. A 59 1829 (1999)] as an example. By distinguishing between two mixed states, we derive the necessary and sufficient conditions under which a dishonest participant can attain all the information without introducing any error, which shows that the HBB protocol is insecure against dishonest participants. It is easy to verify that the attack scheme of Karlsson, Koashi, and Imoto [Phys. Rev. A 59, 162 (1999)] is a special example of our results. To demonstrate our results further, we construct an explicit attack scheme according to the necessary and sufficient conditions. Our work completes the security analysis of the HBB protocol, and the method presented may be useful for the analysis of other similar protocols.

quant-ph↗

arXiv2006

Fake one-time pad cannot be used to improve the efficiency of quantum communication

Two misuses of one-time pad in improving the efficiency of quantum communication are pointed out. One happens when using some message bits to encrypt others, the other exists because the key bits are not truly random. Both of them result in the decrease of security. Therefore, one-time pad should be used carefully in designing quantum communication protocols.

quant-ph↗

arXiv2006

Threshold quantum cryptograph based on Grover's algorithm

Grover's operator in the two-qubit case can transform a basis into its conjugated basis. A permutation operator can transform a state in the two conjugated bases into its orthogonal state. These properties are included in a threshold quantum protocol. The proposed threshold quantum protocol is secure based the proof that the legitimate participators can only eavesdrop 2 bits of 3 bits operation information on one two-qubit with error probability 3/8. We propose a scheme to detect the Trojan horse attack without destroying the legal qubit.

quant-ph↗

arXiv2006

Entanglement Split:Comment on ``Quantum secret sharing based on reusable Greenberger-Horne-Zeilinger states as secure carriers'' [Phys. Rev. A 67, 044302 (2003)]

In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this comment, it is shown that this protocol is insecure because a cheater can gain all the secret bits before sharing, while introducing one data bit error at most in the whole communication, which makes the cheater avoid the detection by the communication parities.

quant-ph↗