Threshold quantum cryptograph based on Grover's algorithm

Abstract

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.

Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights

“…Although the speedup of quantum search is modest, the application areas of the quantum search are significantly wider. For this reason, many studies have investigated the properties of quantum search [3][4][5][6][7][8][9] or extended it to other areas [10][11][12][13][14][15][16][17][18]. Our work here provides one such extension.…”

Optimality proofs of quantum weight decision algorithms

“…Because of this reason, there have been lots of studies to know the properties of quantum search or to extend it into other areas [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18].…”