Quantum switching and quantum string matching

Abstract

Applications of quantum string matching can be found in quantum signature scheme and quantum fingerprinting. The major benefit of these applications is computation complexity. Quantum Boolean circuits can check the equivalence function: all in puts are quantum digital state. However, it is difficult to verify quantum strings if all input qubits are quantum superposition state. Quantum switching could be reversible circuits. These circuits have two major benefits: information lossless and energy saving. In this paper, we use quantum circuits to design the control module that can verify the equivalence of quantum strings and satisfy the following condition: all inputs qubits could be quantum superposition state. In the pro posed circuits, the control module can form a special correlation between input sequence and output sequence. This correlation can design the equivalence function of quantum strings to solve the problem: input strings with superposition. In regard to the performance, the scalability of the proposed circuits can be achieved.