×

Analyzing the reliability of quantum amplitude amplification techniques in the presence of noise. (English) Zbl 1438.81010

Summary: This paper studies three different amplitude amplification techniques; solution marking via phase shift, solution marking via entanglement and solution marking via conditional global phase shift; when the extra qubit is in different states. The ability of the three techniques to amplify the probability of solution items is analyzed against the bit-flip error problem on the auxiliary qubit which is used for oracle evaluation. It is found that the solution marking via conditional global phase shift is more robust against the bit-flip error than the other two techniques.

MSC:

81P68 Quantum computation
PDFBibTeX XMLCite
Full Text: Link

References:

[1] P. R. Giri and V. E. Korepin, “A review on quantum search algorithms,” Quantum Information Processing, vol. 16, no. 12, p. 315, 2017. · Zbl 1382.81056
[2] L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 212-219, ACM, 1996. · Zbl 0922.68044
[3] Y. Tang and S. Su, “Application of grover’s quantum search algorithm to solve the transcendental logarithm problem,” in Computational In-26 telligence and Security (CIS), 2014 Tenth International Conference on, pp. 445-449, IEEE, 2014.
[4] G. Brassard, P. Hoyer, and A. Tapp, “Quantum algorithm for the collision problem,” arXiv preprint quant-ph/9705002, 1997. · Zbl 1508.68118
[5] V. SHIVAKUMAR, “Applying quantum algorithm to speed up the solution of hamiltonian cycle problems,” in Intelligent Information Processing III: IFIP TC12 International Conference on Intelligent Information Processing (IIP 2006), September 20-23, Adelaide, Australia, vol. 228, p. 53, Springer Science & Business Media, 2006.
[6] G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics, vol. 305, pp. 53-74, 2002. · Zbl 1063.81024
[7] A. Younes, “Towards more reliable fixed phase quantum search algorithm,” Applied Mathematics & Information Sciences, vol. 1, pp. 93-98, 2013.
[8] G. L. Long, Y. S. Li, W. L. Zhang, and L. Niu, “Phase matching in quantum searching,” Physics Letters A, vol. 262, no. 1, pp. 27-34, 1999. EJMAA-2020/8(1)ANALYZING THE RELIABILITY OF QUANTUM181 · Zbl 1059.81518
[9] L. Tan, B. Wan-Su, L. Wen-Qian, Z. Hou, and F. Xiang-Qun, “Quantum search algorithm based on multi-phase,” Chinese Physics Letters, vol. 31, no. 5, p. 050301, 2014.
[10] Y. Guo, W. Shi, Y. Wang, and J. Hu, “Q-learning-based adjustable fixed-phase quantum grover search algorithm,” Journal of the Physical Society of Japan, vol. 86, no. 2, p. 024006, 2017.
[11] D. Biron, O. Biham, E. Biham, M. Grassl, and D. A. Lidar, “Generalized grover search algorithm for arbitrary initial amplitude distribution,” in Quantum Computing and Quantum Communications, pp. 140-147, Springer, 1999. · Zbl 0945.68037
[12] Y. Liu, “An exact quantum search algorithm with arbitrary database,” International Journal of Theoretical Physics, vol. 53, no. 8, pp. 2571- 2578, 2014. · Zbl 1308.81062
[13] S. Imre and F. Balazs, “Generalized grover database search operator with arbitrary initial state,” 2003.
[14] E. Biham and D. Kenigsberg, “Grover’s quantum search algorithm for an arbitrary initial mixed state,” Physical Review A, vol. 66, no. 6, p. 062301, 2002.
[15] G.-L. Long, X. Li, and Y. Sun, “Phase matching condition for quantum search with a generalized initial state,” Physics Letters A, vol. 294, no. 3- 4, pp. 143-152, 2002. · Zbl 0985.81012
[16] A. Younes, J. Rowe, and J. Miller, “Enhanced quantum searching via entanglement and partial diffusion,” Physica D: Nonlinear Phenomena, vol. 237, no. 8, pp. 1074-1078, 2008. · Zbl 1139.81333
[17] T. J. Yoder, G. H. Low, and I. L. Chuang, “Fixed-point quantum search with an optimal number of queries,” Physical review letters, vol. 113, no. 21, p. 210501, 2014.
[18] P. J. Salas, “Noise effect on grover algorithm,” The European Physical Journal D, vol. 46, no. 2, pp. 365-373, 2008.
[19] I. Cohn, A. L. F. De Oliveira, E. Buksman, and J. G. L. De Lacalle, “Grover’s search with local and total depolarizing channel errors: Complexity analysis,” International Journal of Quantum Information, vol. 14, no. 02, p. 1650009, 2016. · Zbl 1344.81060
[20] G. L. Long, Y. S. Li, W. L. Zhang, and C. C. Tu, “Dominant gate imperfection in grover’s quantum search algorithm,” Physical Review A, vol. 61, no. 4, p. 042305, 2000.
[21] J. Chen, D. Kaszlikowski, L. Kwek, and C. Oh, “Searching a database under decoherence,” Physics Letters A, vol. 306, no. 5-6, pp. 296-305, 2003. · Zbl 1006.81007
[22] D. Ellinas and C. Konstadakis, “Noisy grover’s search algorithm,” arXiv preprint quantph/0110010, 2001.
[23] H. Azuma, “Decoherence in grover’s quantum algorithm: Perturbative approach,” Physical Review A, vol. 65, no. 4, p. 042311, 2002.
[24] D. Shapira, S. Mozes, and O. Biham, “Effect of unitary noise on grover’s quantum search algorithm,” Physical Review A, vol. 67, no. 4, p. 042301, 2003.
[25] A. M. Dalzell, T. J. Yoder, and I. L. Chuang, “Fixed-point adiabatic quantum search,” Physical Review A, vol. 95, no. 1, p. 012311, 2017.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.