Lower bound for quantum phase estimation

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 71, Issue 4, 2005, Pages

  Bessen, Arvid J ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; FREQUENCY DOMAIN ANALYSIS; PROBLEM SOLVING; QUANTUM THEORY;

FREQUENCY ANALYSIS; LOWER-BOUND APPROACHES; QUANTUM ALGORITHMS; QUANTUM PHASE ESTIMATION;

PHASE MEASUREMENT;

EID: 26944446616     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.71.042313     Document Type: Article

References (26)

1. P. W. Shor, in Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, edited by, S. Goldwasser, (IEEE Computer Society, Los Alamitos, CA, 1994), pp. 124-134.
2. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, England, 2000).
3. G. Brassard, P. Høyer, and A. Tapp, in 25th International Colloqium, ICALP'98, edited by, K. Larsen, Vol. 1443 of Lecture Notes in Computer Science, (Springer-Verlag, Berlin, 1998), pp. 820-831.
4. G. Brassard, P. Høyer, M. Mosca, and A. Tapp, in Quantum Computation and Quantum Information: A Millennium Volume, edited by, S. L. Lomonaco, and, H. E. Brandt, Vol. 305 of Contemporary Mathematics (AMS, Providence, 2002).
5. D. S. Abrams and S. Lloyd, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.83.5162 83, 5162 (1999).
6. P. Jaksch and A. Papageorgiou, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.91.257902 91, 257902 (2003).
7. A. Papageorgiou and H. Woniakowski (unpublished).
8. L. K. Grover, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (ACM, New York, 1996), pp. 212-219.
9. M. Boyer, P. Brassard, P. Høyer, and A. Tapp, Fortschr. Phys. FPYKA6 0015-8208 10.1002/1521-3978(199806)46:4/5<493::AID-PROP493>3.3. CO;2-G 46, 493 (1998).
10. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, SIAM J. Comput. SMJCAT 0097-5397 10.1137/S0097539796300933 26, 1510 (1997).
11. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, in Proceedings of the 39th IEEE Conference on Foundations of Computer Science (IEEE, New York, 1998), pp. 352-361.
12. A. Nayak and F. Wu, in Proceedings of the 31th Annual ACM Symposium on Theory of Computing (ACM, New York, 1999), pp. 384-393.
13. S. Aaronson, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2001).
14. Y. Shi, in Proceedings of the 43rd Symposium on Foundations of Computer Science (IEEE Computer Society, New York, 2002), pp. 513-519.
15. A. Ambainis, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (ACM, New York, 2000), pp. 636-643.
16. S. Laplante and F. Magniez, in Proceedings of the 19th IEEE Annual Conference on Computational Complexity (IEEE Computer Society, New York, 2004), pp. 294-304.
17. H. Barnum, M. Saks, and M. Szegedy, in Proceedings of the 18th IEEE Conference on Computational Complexity (IEEE Computer Society, New York, 2003), pp. 179-193.
18. S. Heinrich, J. Complex. JOCOEH 0885-064X 18, 1 (2002).
19. A. J. Bessen, J. Complex. JOCOEH 0885-064X 20, 699 (2004).
20. E. Novak, J. Complex. JOCOEH 0885-064X 10.1006/jcom.2000.0566 17, 2 (2001).
21. S. Heinrich, J. Complex. JOCOEH 0885-064X 19, 19 (2003).
22. S. Heinrich, M. Kwas, and H. Wozniakowski, in Monte Carlo and Quasi-Monte Carlo Methods 2002, edited by, H. Niederreiter, (Springer Verlag, Berlin, 2003), pp. 243-258.
23. J. F. Traub and H. Wozniakowski, Quantum Inf. Process. QIPUAT 1570-0755 10.1023/A:1023417813916 1, 365 (2002).
24. E. Novak, I. H. Sloan, and H. Woniakowski, Found Comput. Math. 1615-3375 4, 121 (2004).
25. S. Heinrich, J. Complex. JOCOEH 0885-064X 20, 5 (2004).
26. S. Heinrich, J. Complex. JOCOEH 0885-064X 20, 27 (2004).