We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.We briefly introduced some of our recent work related to the phase matching condition in quantum searching algorithms and the improved Grover algorithm. When one replaces the two phase inversions in the Grover algorithm with arbitrary phase rotations, the modified algorithm usually fails in searching the marked state unless a phase matching condition is satisfied between the two phases. The Grover algorithm is not 100% in success rate, an improved Grover algorithm with zero-failure rate is given by replacing the phase inversions with angles that depends on the size of the database. Other aspects of the Grover algorithm such as the SO(3) picture of quantum searching, the dominant gate imperfections in the Grover algorithm are also mentioned.

Yuanzihe wuli pinglunJan 1, 20047 citations

Grover Algorithm

Ray LaPierre

The Materials Research Society seriesJan 1, 20212 citations

Signal Detection of Communication Systems Based on Grover Algorithm

Li Fei

An investigation of the signal detection scheme with Grover algorithm in MIMO-OFDM system is developed,and Grover algorithm is applied to find the minimum value in order to decide the sending sequence.In order to test the efficiency and reliability of this algorithm,the analysis and comparison between Grover algorithm,improved Grover algorithm and other traditional algorithms are made by Matlab simulation.Experimental results show that it can reduce the complexity,while achieving the same performance of the traditional optimum detection algorithms.An investigation of the signal detection scheme with Grover algorithm in MIMO-OFDM system is developed,and Grover algorithm is applied to find the minimum value in order to decide the sending sequence.In order to test the efficiency and reliability of this algorithm,the analysis and comparison between Grover algorithm,improved Grover algorithm and other traditional algorithms are made by Matlab simulation.Experimental results show that it can reduce the complexity,while achieving the same performance of the traditional optimum detection algorithms.

Jisuanji gongchengJan 1, 20101 citation

Grover's Algorithm

Daniel M. Greenberger, Klaus Hentschel, Friedel Weinert

Compendium of Quantum PhysicsJan 1, 20090 citations

Grover’s Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooksJan 1, 20232 citations

Grover's algorithm on two-way quantum computer

Grzegorz Czelusta, Verma, Dev Rishi, Wanjalkar, Govind

Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\mathcal{O}(1)$ . In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm.Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm.

arXiv:2406.09450Jun 12, 20240 citations

\mathcal{O}(1)

. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm.