No abstract

No abstract

Functional verification is an important design method for verifying functional equivalence between a simplified quantum Boolean circuit and original one. During the design process, checking the equivalence of two quantum Boolean circuits is necessary. In this paper, we present an algorithm that can eficiently and easily verify two quantum Boolean circuits by using the hack propagation method. For a set of input vectors, the idea of the algorithm is to find the checking vectors that output vectors are different from input vectors by a backward tracking process.

No abstract

In this paper, we propose a quantum secure direct communication (QSDC) protocol based on Einstein–Podolsky–Rosen (EPR) pairs. Previous QSDC protocols usually consume one EPR pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when a dense coding scheme is used. In our protocol, if both Alice and Bob preshare 2c + 1 EPR pairs with the trusted server, where c is a constant, Alice can transmit an arbitrary number of qubits to Bob. The 2c EPR pairs are used by Alice and Bob to authenticate each other and the remaining EPR pair is used to encode and decode the message qubit. Thus the total number of EPR pairs used for one communication is a constant no matter how many bits will be transmitted. It is not necessary to transmit EPR pairs before transmitting the secret message except for the preshared constant number of EPR pairs. This reduces both the utilization of the quantum channel and the risk. In addition, after the authentication, the server is not involved in the message transmission. Thus we can prevent the server from knowing the message.