3 papers
quant-ph2024
The exact lower bound of CNOT-complexity for fault-tolerant quantum Fourier transform
Qiqing Xia, Huiqin Xie, Li Yang
The quantum Fourier transform (QFT) is a crucial subroutine in many quantum algorithms. In this paper, we study the exact lower bound problem of CNOT gate complexity for fault-tole…
quant-ph2024
A Quantum Automatic Tool for Finding Impossible Differentials
Huiqin Xie, Qiqing Xia, Ke Wang +2
Due to the superiority of quantum computing, traditional cryptography is facing severe threat. This makes the security evaluation of cryptographic systems in quantum attack models…
quant-ph2024
The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications
Qiqing Xia, Qianru Zhu, Huiqin Xie +1
Many quantum algorithms for attacking symmetric cryptography involve the rank problem of quantum linear equations. In this paper, we first propose two quantum algorithms for solvin…