To search for a target n-product Boolean of fixed weight d, we propose an important method involving the notion of a fixed-weight vector accompanied with a label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically O ((Cdn+1)~(1/2)) , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.To search for a target n-product Boolean of fixed weight d, we propose an important method involving the notion of a fixed-weight vector accompanied with a label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically O ((Cdn+1)~(1/2)) , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.

Chinese Science BulletinJan 1, 20110 citations

Quantum private comparison based on quantum dense coding

Feng Wang, Ming‐Xing Luo, Hui-Ran Li +2 more

Science China Information SciencesSep 28, 201616 citations

A quantum algorithm for searching a target solution of fixed weight

Xiang Wang, Wan‐Su Bao, Xiang-Qun Fu

To search for a target n-product Boolean vector of fixed weight d, we propose an important method involving the notion of a fixed-weight “vector label” accompanied with a vector label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically $O\left( {\sqrt {C_{n + 1}^d } } \right)$ , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.To search for a target n-product Boolean vector of fixed weight d, we propose an important method involving the notion of a fixed-weight “vector label” accompanied with a vector label restoration algorithm. Based on these, we present a new quantum algorithm designed to search for a fixed-weight target whose computation complexity, specifically $$ O\left( {\sqrt {C_{n + 1}^d } } \right) $$ , is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.

Chinese Science BulletinFeb 1, 201112 citations

Quantum Gate-Based Quantum Private Comparison

Yan‐Feng Lang

International Journal of Theoretical PhysicsJan 6, 202032 citations

Quantum Private Comparison Based on Delegating Quantum Computation

Haibin Wang, Daomeng Pan, Wenjie Liu

Lecture notes in computer scienceJan 1, 20180 citations

Quantum Private Membership Aggregation

Alptug Aytekin, Mohamed W. Nomeir, Şennur Ulukuş

We consider the problem of private set membership aggregation of $N$ parties by using an entangled quantum state. In this setting, the $N$ parties, which share an entangled state, aim to privately know the number of times each element (message) is repeated among the $N$ parties, with respect to a universal set $\mathcal{K}$ . This problem has applications in private comparison, ranking, voting, etc. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states. The proposed scheme can also be used to calculate the $N$ party private summation modulo $P$ .We consider the problem of private set membership aggregation of$N$parties by using an entangled quantum state. In this setting, the$N$parties, which share an entangled state, aim to privately know the number of times each element (message) is repeated among the$N$parties, with respect to a universal set$\mathcal{K}$. This problem has applications in private comparison, ranking, voting, etc. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states. The proposed scheme can also be used to calculate the$N$party private summation modulo$P$.

arXiv:2401.16390IEEE International Symposium on Information Theory (ISIT)Jul 7, 20242 citations

O\left( {\sqrt {C_{n + 1}^d } } \right)

, is better than that for a classical algorithm. Finally, we use the procedure to search for the NTRU private key as an example to verify the efficiency of the new algorithm in searching for fixed-weight target solutions.

We consider the problem of private set membership aggregation of

N

parties by using an entangled quantum state. In this setting, the

N

parties, which share an entangled state, aim to privately know the number of times each element (message) is repeated among the

N

parties, with respect to a universal set

\mathcal{K}

. This problem has applications in private comparison, ranking, voting, etc. We propose an encoding algorithm that maps the classical information into distinguishable quantum states, along with a decoding algorithm that exploits the distinguishability of the mapped states. The proposed scheme can also be used to calculate the

N

party private summation modulo

P