Fast quantum algorithms for handling probabilistic and interval uncertainty

Mathematical Logic Quarterly

Volumn 50, Issue 4-5, 2004, Pages 405-416

  Kreinovich, Vladik ^a   Longpré, Luc ^a  

^a 500 W University Avenue   (United States)

Author keywords

Data processing; Interval computations; NP hard; Partial information about probabilities; Quantum computing

Indexed keywords

EID: 10844277417     PISSN: 09425616     EISSN: None     Source Type: Journal    
DOI: 10.1002/malq.200310116     Document Type: Article

References (46)

1. M. J. Beeson, Foundations of Constructive Mathematics (Springer-Verlag, New York 1985).
2. A with probability 1. SIAM J. Computer Science 10, 96-113 (1981).
3. G. Brassard, P. Hoyer, and A. Tapp, Quantum counting. In: Proc. 25th ICALP; Lecture Notes in Computer Science 1443, pp. 820-831 (Springer-Verlag, Berlin et al. 1998).
4. C. Dürr and P. Hoyer, A quantum algorithm for finding the minimum. LANL arXiv:quant-ph/9607014.
5. S. Ferson, L. Ginzburg, V. Kreinovich, L. Longpré, and M. Aviles, Computing variance for interval data is NP-hard. ACM SIGACT News 33, 108-118 (2002).
6. S. Ferson, L. Ginzburg, V. Kreinovich, and J. Lopez, Absolute bounds on the mean of sum, product, etc.: A probabilistic extension of interval arithmetic. Extended Abstracts of the 2002 SIAM Workshop on Validated Computing, Toronto, Canada, May 23-25, pp. 70-72.
7. R. P. Feynman, The theory of positrons. Physical Review 76, 749-759 (1949).
8. R. Gandy, Church's thesis and principles for mechanisms. In: The Kleene Symposium (J. Barwise, H. J. Keisler, and K. Kunen, eds.), pp. 123-148 (North-Holland Publ. Comp., Amsterdam 1980).
9. R. Gandy, The confluence of ideas in 1936. In: The Universal Turing Machine: A Half-century Survey (R. Herken, ed.) (Kammerer & Unverzagt, Hamburg 1988).
10. M. Gell-Mann, The Quark and the Jaguar (Freeman, New York 1994).
11. A. A. Grib and W. A. Rodriguez Jr., Nonlocality in Quantum Physics (Plenum, New York 1999).
12. L. Grover, A fast quantum mechanical algorithm for database search. Proc. 28th ACM Symp. on Theory of Computing, 212-219 (1996).
13. L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325-328 (1997).
14. L. Grover, A framework for fast quantum mechanical algorithms. Phys. Rev. Lett. 80, 4329-4332 (1998).
15. F. Harary, V. Kreinovich, and L. Longpré, A new graph characteristic and its application to numerical computability. Information Processing Letters 77, 277-282 (2001).
16. S. Heinrich, Quantum summation with an application to integration. J. Complexity 18, 1-50 (2002).
17. F. Herrmann and M. Margenstern, A universal cellular automaton in the hyperbolic plane. Theoret. Comp. Sci. 296, 327-364 (2003).
18. L. Jaulin, M. Keiffer, O. Didrit, and E. Walter, Applied Interval Analysis (Springer-Verlag, Berlin et al. 2001).
19. R. B. Kearfott, Rigorous Global Search: Continuous Problems (Kluwer, Dordrecht 1996).
20. R. B. Kearfott and V. Kreinovich (eds.), Applications of interval computations. In: P. M. Pardalos and D. Hearn, Applied Optimization, Vol. 3 (Kluwer, Dordrecht 1996).
21. M. Koshelev, Maximum entropy and acausal processes: Astrophysical applications and challenges. In: Maximum Entropy and Bayesian Methods (G. J. Erickson et al., eds.), pp. 253-262 (Kluwer, Dordrecht 1998).
22. O. M. Kosheleva and V. Kreinovich, What can physics give to constructive mathematics (in Russian). In: Mathematical Logic and Mathematical Linguistics, pp. 117-128 (Kalinin, Russia 1981).
23. V. Kreinovich, On the possibility of using physical processes when solving hard problems (in Russian). Leningrad Center for New Information Technology "Informatika", Technical Report, Leningrad 1989.
24. V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl, Computational complexity and feasibility of data processing and interval computations In: P. M. Pardalos and D. Hearn, Applied Optimization, Vol. 10 (Kluwer, Dordrecht 1997).
25. V. Kreinovich and L. Longpré, Why Kolmogorov complexity in physical equations. Internat. J. Theor. Physics 37, 2791-2801 (1998).
26. G. Kreisel, A notion of mechanistic theory. Synthese 29, 11-26 (1974).
27. G. Kreisel, Review of [38] and [39]. J. Symbolic Logic 47, 900-902 (1982).
28. M. Li and P. M. B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications (Springer-Verlag, New York 1997).
29. L. Longpré and V. Kreinovich, Can quantum computers be useful when there are not yet enough qubits ? Bull. European Association for Theoretical Computer Science (EATCS) 79, 164-169 (2003).
30. M. Martinez, L. Longpré, V. Kreinovich, S. A. Starks, and H. T. Nguyen, Fast quantum algorithms for handling probabilistic, interval, and fuzzy uncertainty. Proceedings of the 22nd International Conference of the North American Fuzzy Information Processing Society NAFIPS'2003, Chicago, Illinois, July 24-26, 2003.
31. S. Yu. Maslov, Theory of Deductive Systems and its Applications (MIT Press, Cambridge, MA, 1987).
32. R. E. Moore, Methods and Applications of Interval Analysis (SIAM, Philadelphia 1979).
33. H. Moravec, Time travel and computing. Carnegie-Mellon Univ., CS Dept. Preprint 1991.
34. D. Morgenstein and V. Kreinovich, Which algorithms are feasible and which are not depends on the geometry of space-time. Geombinatorics 4, 80-97 (1995).
35. A. Nayak and F. Wu, The quantum query complexity of approximating the median and related statistics. Proc. Symp. Theory of Computing STOC'99, 384-393 (1999).
36. M. A. Nielsen, and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, U. K., 2000).
37. E. Novak, Quantum complexity of integration. J. Complexity 17, 2-16 (2001).
38. M. B. Pour-El and I. Richards, A computable ordinary differential equation which possesses no computable solutions. Annals Math. Logic 17, 61-90 (1979).
39. M. B. Pour-El and I. Richards, The wave equation with computable initial data such that its unique solution is not computable. Advances in Mathematics 39, 215-239 (1981).
40. M. B. Pour-El and I. Richards, Computability in Analysis and Physics (Springer-Verlag, New York 1989).
41. S. Rabinovich, Measurement Errors: Theory and Practice (American Institute of Physics, New York 1993).
42. K. S. Thorne, From Black Holes to Time Warps (W. W. Norton, New York 1994).
43. R. Trejo and V. Kreinovich, Error estimations for indirect measurements: Randomized vs. deterministic algorithms. In: Handbook on Randomized Computing (S. Rajasekaran et al., eds.), pp. 673-729 (2001).
44. S. A. Vavasis, Nonlinear Optimization: Complexity Issues (Oxford University Press, New York 1991).
45. H. M. Wadsworth Jr. (ed.), Handbook of Statistical Methods for Engineers and Scientists (McGraw-Hill Publishing Co., New York 1990).
46. K. Weihrauch and N. Zhong, Is wave propagation computable or can wave computers beat the Turing machine ? Proceedings of the London Mathematical Society 85, 312-332 (2002).