Abstract
AbstractQuantum abstract detecting systems (QADS) provide a common framework to address detection problems in quantum computers. A particular QADS family, that of combinatorial QADS, has been proved to be useful for decision problems on eigenvalues or phase estimation methods. In this paper, we consider functional QADS, which not only have interesting theoretical properties (intrinsic detection ability, relation to the QFT), but also yield improved decision and phase estimation methods, as compared to combinatorial QADS. A first insight into the comparison with other phase estimation methods also shows promising results.
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, ACM, NY, USA (1996), pp. 212–219
2. Combarro, E.F., Ranilla, J., Rúa, I.F.: Quantum abstract detecting systems. Quantum Inf. Process. 19(8), 258 (2020)
3. Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A Math. Phys. Eng. Sci. 439(1907), 553–558 (1992)
4. Ambainis, A., Kempe, J, Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’05, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2005), pp. 1099–1108
5. Portugal, R.: Quantum Walks and Search Algorithms. Springer, New York (2013)