Xiangfu Zou

Characterizations of one-way general quantum finite automata

Generally, unitary transformations limit the computational power of quantum finite automata (QFA). In this paper, we study a generalized model named one-way general quantum finite automata (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general quantum finite automata (MO-1gQFA) where a measurement deciding to accept or reject is performed at the end of a computation, and measure-many one-way general quantum finite automata (MM-1gQFA) where a similar measurement is performed after each trace-preserving quantum operation on reading each input symbol. We characterize the measure-once model from three aspects: the closure property, the language recognition power, and the equivalence problem. We prove that MO-1gQFA recognize, with bounded error, precisely the set of all regular languages. Our results imply that some models of quantum finite automata proposed in the literature, which were expected to be more powerful, still cannot recognize non-regular languages. We prove that MM-1gQFA also recognize only regular languages with bounded error. Thus, MM-1gQFA and MO-1gQFA have the same language recognition power, in sharp contrast with traditional MO-1QFA and MM-1QFA, the former being strictly less powerful than the latter. Finally, we present a necessary and sufficient condition for two MM-1gQFA to be equivalent.

On mathematical theory of the duality computers

Recently, Long proposed a new type of quantum computers called duality computers or duality quantum computers. The duality computers based on the general quantum interference principle are much more powerful than an ordinary quantum computer. A mathematical theory for the duality computers has been presented by Gudder. However, he pointed out that a paradoxical situation of the mathematical theory occurs between the mixed state formalism and the pure state formalism. This paper argues for Gudder’s mathematical theory of the duality computers for the mixed state formalism. First, we point out two problems existing in the pure state description of the duality computers. Then, we present a new mathematical theory of the duality computers for the pure state formalism according with Gudder’s mixed state description, generalize the new mathematical theory of the duality computers in the density matrix formalism, and discuss some basic properties of the divider operators and combiner operators of the duality computers. The new mathematical theory can conquer the two problems mentioned above. Finally, we find that the nonunitary operations can be performed on every path of a quantum wave divider of the duality computers. Especially, we discuss in detail that the subwaves interact with environment by a CNOT gate.

Attack and improvements of fair quantum blind signature schemes

Blind signature schemes allow users to obtain the signature of a message while the signer learns neither the message nor the resulting signature. Therefore, blind signatures have been used to realize cryptographic protocols providing the anonymity of some participants, such as: secure electronic payment systems and electronic voting systems. A fair blind signature is a form of blind signature which the anonymity could be removed with the help of a trusted entity, when this is required for legal reasons. Recently, a fair quantum blind signature scheme was proposed and thought to be safe. In this paper, we first point out that there exists a new attack on fair quantum blind signature schemes. The attack shows that, if any sender has intercepted any valid signature, he (she) can counterfeit a valid signature for any message and can not be traced by the counterfeited blind signature. Then, we construct a fair quantum blind signature scheme by improved the existed one. The proposed fair quantum blind signature scheme can resist the preceding attack. Furthermore, we demonstrate the security of the proposed fair quantum blind signature scheme and compare it with the other one.

Improvement of a quantum broadcasting multiple blind signature scheme based on quantum teleportation

Recently, a broadcasting multiple blind signature scheme based on quantum teleportation has been proposed for the first time. It is claimed to have unconditional security and properties of quantum multiple signature and quantum blind signature. In this paper, we analyze the security of the protocol and show that each signatory can learn the signed message by a single-particle measurement and the signed message can be modified at random by any attacker according to the scheme. Furthermore, there are some participant attacks and external attacks existing in the scheme. Finally, we present an improved scheme and show that it can resist all of the mentioned attacks. Additionally, the secret keys can be used again and again, making it more efficient and practical.

Probabilistic broadcasting of mixed states

It is well known that the non-broadcasting theorem proved by Barnum et al is a fundamental principle of quantum communication. As we are aware, optimal broadcasting (OB) is the only method to broadcast noncommuting mixed states approximately. In this paper, motivated by the probabilistic cloning of quantum states proposed by Duan and Guo, we propose a new way for broadcasting noncommuting mixed states—probabilistic broadcasting (PB), and we present a sufficient condition for PB of mixed states. To a certain extent, we generalize the probabilistic cloning theorem from pure states to mixed states, and in particular, we generalize the non-broadcasting theorem, since the case that commuting mixed states can be exactly broadcast can be thought of as a special instance of PB where the success ratio is 1. Moreover, we discuss probabilistic local broadcasting (PLB) of separable bipartite states.

Analyses and improvement of a broadcasting multiple blind signature scheme based on quantum GHZ entanglement

A broadcasting multiple blind signature scheme based on quantum GHZ entanglement has been presented recently. It is said that the scheme’s unconditional security is guaranteed by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. In this paper, we prove that each signatory can get the signed message just by an intercept–resend attack. Then, we show there still exist some participant attacks and external attacks. Specifically, we verify the message sender Alice can impersonate each signatory to sign the message at will, and so is the signature collector Charlie. Also, we demonstrate that the receiver Bob can forge the signature successfully, and with respect to the external attacks, the eavesdropper Eve can modify the signature at random. Besides, we discover Eve can change the signed message at random, and Eve can impersonate Alice as the message sender without being discovered. In particular, we propose an improved scheme based on the original one and show that it is secure against not only the attacks mentioned above but also some collusion attacks.

Quantum network dialogue protocol based on continuous-variable GHZ states

Quantum dialogue network, as a considerable topic, promotes high efficiency and instantaneousness in quantum communication through simultaneously deducing the secret information over the quantum channel. A new quantum network dialogue protocol is proposed based on continuous-variable GHZ states. In the protocol, the quantum dialogue could be conducted simultaneously among multiple legitimate communication parties. The security of the proposed protocol is ensured by the correlation of continuous-variable GHZ entangled states and the decoy states inserted into the GHZ states in the randomly selected time slots. In addition, the proposed quantum network dialogue protocol with continuous-variable quantum states improves the communication efficiency with the perfect utilization of quantum bits greatly.