Even though a method to perfectly sign quantum messages has not been known, the arbitrated quantum signature scheme has been considered as one of good candidates. However, its forgery problem has been an obstacle to the scheme being a successful meth
od. In this paper, we consider one situation, which is slightly different from the forgery problem, that we check whether at least one quantum message with signature can be forged in a given scheme, although all the messages cannot be forged. If there exist only a finite number of forgeable quantum messages in the scheme then the scheme can be secure against the forgery attack by not sending the forgeable quantum messages, and so our situation does not directly imply that we check whether the scheme is secure against the attack. But, if users run a given scheme without any consideration of forgeable quantum messages then a sender might transmit such forgeable messages to a receiver, and an attacker can forge the messages if the attacker knows them in such a case. Thus it is important and necessary to look into forgeable quantum messages. We here show that there always exists such a forgeable quantum message-signature pair for every known scheme with quantum encryption and rotation, and numerically show that any forgeable quantum message-signature pairs do not exist in an arbitrated quantum signature scheme.
We characterize the algebraic structure of semi-direct product of cyclic groups, $Z_{N}rtimesZ_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum computational alg
orithm solving hidden symmetry subgroup problem of the groups.
It was shown that two distant particles can be entangled by sending a third particle never entangled with the other two [T. S. Cubitt et al., Phys. Rev. Lett. 91, 037902 (2003)]. In this paper, we investigate a class of three-qubit separable states t
o distribute entanglement by the same way, and calculate the maximal amount of entanglement which two particles of separable states in the class can have after applying the way.
The monogamy inequality in terms of the concurrence, called the Coffman-Kundu-Wootters inequality [Phys. Rev. A {bf 61}, 052306 (2000)], and its generalization [T.J. Osborne and F. Verstraete, Phys. Rev. Lett. {bf 96}, 220503 (2006)] hold on general
$n$-qubit states including mixed ones. In this paper, we consider the monogamy inequalities in terms of the fully entangled fraction and the teleportation fidelity. We show that the monogamy inequalities do not hold on general mixed states, while the inequalities hold on $n$-qubit pure states.
We study the explicit relation between violation of Bell inequalities and bipartite distillability of multi-qubit states. It has been shown that even though for $Nge 8$ there exist $N$-qubit bound entangled states which violates a Bell inequality [Ph
ys. Rev. Lett. {bf 87}, 230402 (2001)], for all the states violating the inequality there exists at least one splitting of the parties into two groups such that pure-state entanglement can be distilled [Phys. Rev. Lett. {bf 88}, 027901 (2002)]. We here prove that for all $N$-qubit states violating the inequality the number of distillable bipartite splits increases exponentially with $N$, and hence the probability that a randomly chosen bipartite split is distillable approaches one exponentially with $N$, as $N$ tends to infinity. We also show that there exists at least one $N$-qubit bound entangled state violating the inequality if and only if $Nge 6$.
In this work, we investigate what kinds of quantum states are feasible to perform perfectly secure secret sharing, and present its necessary and sufficient conditions. We also show that the states are bipartite distillable for all bipartite splits, a
nd hence the states could be distillable into the Greenberger-Horne-Zeilinger state. We finally exhibit a class of secret-sharing states, which have an arbitrarily small amount of bipartite distillable entanglement for a certain split.
