Quantum partial search algorithm with smaller oracles for multiple target items (original) (raw)

References

  1. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC ’96: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (1996)
  2. Grover, L.K.: Quantum Mechanics Helps in Searching for a Needle in a Haystack 1997PRL 79,2. Phys. Rev. Lett. 79, 325 (1997)
    Article ADS Google Scholar
  3. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Stat. Comput. 26, 1484 (1997)
    Article MathSciNet Google Scholar
  4. Yu, C.H., Gao, F., Liu, C.H., Huynh, D., Reynolds, M., Wang, J.B.: Quantum algorithm for visual tracking. Phys. Rev. A. 99(2), 022301 (2019)
    Article ADS Google Scholar
  5. Yu, C.H., Gao, F., Lin, S., Wang, J.B.: Quantum data compression by principal component analysis. Phys. Rev. A 99(2), 022301 (2019)
    Article ADS Google Scholar
  6. Yu, C.H., Gao, F., Wen, Q.Y.: An improved quantum algorithm for ridge regression. IEEE Trans. Knowl. Data Eng. 33, 858–866 (2021)
    Google Scholar
  7. Xu, G.B., Jiang, D.H.: Novel methods to construct nonlocal sets of orthogonal product states in an arbitrary bipartite high dimensional system. Quantum Inf. Process. 20, 128 (2021)
    Article ADS MathSciNet Google Scholar
  8. Li, D., Yang, Y.G., Bi, J.L., Yuan, J.B., Xu, J.: Controlled alternate quantum walks based quantum hash function. Sci. Rep. 8, 225 (2018)
    Article ADS Google Scholar
  9. Li, D., Liu, Y., Yang, Y.G., Xu, J., Yuan, J.B.: Szegedy quantum walks with memory on regular graphs. Quantum Inf. Process. 19, 32 (2020)
    Article ADS MathSciNet Google Scholar
  10. Pellet-Mary, A., Stehle, D.: On the Hardness of the NTRU Problem. In: Tibouchi M., Wang H. (eds) Advances in Cryptology, ASIACRYPT 2021. Lecture Notes in Computer Science, vol. 13090. Springer, Cham. (2021)
  11. Buchmann, J., Dahmen, E., Hulsing, A.: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions. In: Yang BY. (eds) Post-Quantum Cryptography. PQCrypto 2011. Lecture Notes in Computer Science, vol. 7071. Springer, Berlin (2011)
  12. Chen, L., Jordan, S., Liu, Y., Moody, D., Peralta, R., Perlner, R., Smith-Tone, D.: Report on Post-Quantum Cryptography. MD, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg (2016)
  13. Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17, 339 (2018)
    Article ADS MathSciNet Google Scholar
  14. Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC arXiv:1910.01700 [quant-ph] (2019)
  15. Korepin, V.E., Grover, L.K.: Simple algorithm for partial quantum search 2005. Quantum Inf. Process. 5, 5–10 (2006)
    Article MathSciNet Google Scholar
  16. Grover, L.K., Radhakrishnan, J.: Is partial quantum search of a database any easier. arXiv:quant-ph/0407122 (2004)
  17. Choi, B.S., Korepin, V.E.: Quantum partial search of a database with several target items 2007. Quantum Inf. Process. 6, 243 (2007)
    Article ADS MathSciNet Google Scholar
  18. Zhang, K., Korepin, V.: Quantum partial search for uneven distribution of multiple target items2018. Quantum Inf. Process. 17, 143 (2018)
    Article ADS Google Scholar
  19. Zhang, K., Korepin, V.E.: Depth optimization of quantum search algorithms beyond Grover’ algorithm. Phys. Rev. A 101, 032346 (2020)
    Article ADS MathSciNet Google Scholar
  20. Farhi, E., Gutmann, S.: Quantum Mechanical Square Root Speedup in a Structured Search Problem. arXiv:9771.1035 [quant-ph] (1997)
  21. Wong, T.G., Wunscher, K., Lockhart, J., Severini, S.: Quantum walk search on Kronecker graphs. Phys. Rev. A 98, 012338 (2018)
    Article ADS MathSciNet Google Scholar
  22. Wang, Y.K., Wu, S.J., Wang, W.: Controlled quantum search on structured databases. Phys. Rev. Res. 1, 033016 (2019)
    Article Google Scholar
  23. Xue, X.L., Ruan, Y., Liu, Z.H.: Discrete-time quantum walk search on Johnson graphs. Quantum Inf. Process. 18, 50 (2019)
    Article ADS MathSciNet Google Scholar
  24. Rhodes, M.L., Wong, T.G.: Quantum walk search on the complete Bipartite graph. Phys. Rev. A 99, 032301 (2019)
    Article ADS Google Scholar
  25. Figgatt, C., Maslov, D., Landsman, K., Linke, N.M., Debnath, S., Monroe, C.: Complete 3-Qubit Grover search on a programmable quantum computer. Nat. Commun. 8, 1918 (2017)
    Article ADS Google Scholar
  26. Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik Progress Phys. 46(493), 032301, (1998)
  27. Gingrich, R.M., Williams, C.P., Cerf, N.J.: Generalized quantum search with parallelism. Phys. Rev. A 61, 052313 (2000)
    Article ADS Google Scholar

Download references