A common algebraic description for probabilistic and quantum computations

Theoretical Computer Science

Volumn 345, Issue 2-3, 2005, Pages 206-234

  Beaudry, Martin ^a   Fernandez, José M ^b   Holzer, Markus ^c  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; PROBABILISTIC LOGICS; PROBLEM SOLVING; TENSORS;

DESTRUCTIVE INTERFERENCE; GATE ARRAYS; QUANTUM COMPUTATIONS; TENSOR FORMULAS;

COMPUTATION THEORY;

EID: 27644474196     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.008     Document Type: Conference Paper

References (36)

1. L.M. Adleman, H. DeMarrais, and M.-D.A. Huang Quantum computability SIAM J. Comput. 26 5 1997 1524 1540
2. J.L. Balcázar, J. Díaz, and J. Gabarró Structural Complexity I, EATCS Monographs on Theoretical Computer Science Vol. 11 1988 Springer Berlin
3. A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, and H. Weinfurter Elementary gates for quantum computation Phys. Rev. A 52 1995 3457 3467
4. M. Beaudry, J.M. Fernandez, M. Holzer, Deterministic and probabilistic computations from a quantum perspective, 2003, in preparation.
5. M. Beaudry, J.M. Fernandez, M. Holzer, A common algebraic description for probabilistic and quantum computation, in: J. Fiala, V. Koubek, J. Kratochvil (Eds.), Proc. of the 29th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, Prague, Czech Republic, August 2004, pp. 851-862.
6. M. Beaudry, M. Holzer, The complexity of tensor circuit evaluation, in: J. Sgall, A. Pultr, P. Kolman (Eds.), Proc. of the 26th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer, Berlin, Mariánské Lázně, Czech Republic, August 2001, pp. 173-185.
7. C.H. Bennett Time/space trade-offs for reversible computation SIAM J. Comput. 18 4 1989 766 776
8. A. Blass, and Y. Gurevich On the unique satisfiability problem Inform. and Control 82 1-3 1982 80 88
9. C. Damm, M. Holzer, and P. McKenzie The complexity of tensor calculus Comput. Complexity 11 1/2 2003 54 89
10. D. Deutsch Quantum theory, the Church-Turing principle and the universal quantum computer Proc. Roy. Soc. London Ser. A 400 1985 97 117
11. D.P. DiVincenzo Two-bit gates are universal for quantum computation Phys. Rev. A 51 1995 1015 1022
12. S. Even, A.L. Selman, and Y. Yacobi The complexity of promise problems with applications to public-key cryptography Inform. and Control 61 1984 159 173
13. S.A. Fenner, L. Fortnow, and S.A. Kurtz Gap-definable counting classes J. Comput. System Sci. 48 1 1994 116 148
14. S. Fenner, F. Green, S. Homer, and R. Pruim Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy Proc. Roy. Soc. London Ser. A 455 1999 3953 3966
15. L. Fortnow One complexity theorist's view of quantum computing Theoret. Comput. Sci. 292 3 2003 597 610
16. J.S. Golan The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Pitman Monographs Surveys in Pure and Applied Mathematics 1992 Longman Scientific & Technical
17. G.H. Golub, and C.F. Van Loan Matrix Computations, Mathematical Sciences 1996 Johns Hopkins University Press Baltimore, MD
18. A. Graham Kronecker Products and Matrix Calculus With Applications, Mathematics and its Applications 1981 Ellis Horwood Chichester, UK
19. J. Gruska Quantum Computing, Advanced Topics in Computer Science 1999 McGraw-Hill New York, NY
20. Th. Gundermann, N.A. Nasser, G. Wechsung, A survey on counting classes, in: Proc. of the fifth Annual Structure in Complexity Theory Conference, Barcelona, Spain, July 1990, IEEE, New York, pp. 140-153.
21. H.V. Henderson, F. Pukelsheim, and S.R. Searle On the history of the Kronecker product Linear and Multilinear Algebra 14 1983 113 120
22. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proc. of the eighth Annual Structure in Complexity Theory Conference, San Diego, California, May 1993, IEEE Computer Society Press, Silver Spring, MD, pp. 200-207.
23. W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Vol. 5, Springer, Berlin, 1986.
24. W. Ledermann On singular pencils of Zehfuss, compound, Schäflian matrices Proc. Roy. Soc. Edinburgh LVI 1936 50 89
25. S. Lloyd Almost any quantum logic gate is universal Phys. Rev. Lett. 75 1995 346 349
26. 1 J. ACM 35 4 1998 941 952
27. A. Muthukrishnan, and C.R. Stroud Jr. Multi-valued logic gates for quantum computation Phys. Rev. Ser. A 62 2000 052309-1-8
28. M. Ogiwara, and L. Hemachandra A complexity theory of closure properties J. Comput. Sys. Sci. 46 3 1993 295 325
29. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading, MA
30. C.H. Papadimitriou, S. Zachos, Two remarks on the power of counting, in: A.B. Cremers, H.-P. Kriegel (Eds.), Proc. of the sixth GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 145, Springer, Berlin, Dortmund, Germany, January 1983, pp. 269-275.
31. A.L. Selman Promise problems complete for complexity classes Inform. Comput. 78 1988 87 98
32. T. Sleator, and H. Weinfurter Realizable universal quantum logic gates Phys. Rev. Lett. 74 1995 4087 4090
33. R. Tolimieri, M. An, and Ch. Lu Algorithms for Discrete Fourier Transform and Convolution 1997 Springer Berlin
34. L.G. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 1979 189 201
35. K.W. Wagner Some observations on the connection between counting and recursion Theoret. Comput. Sci. 47 1986 131 147
36. A.C.-C. Yao, Quantum circuit complexity, in: Proc. of the 34th Symposium on Foundations of Computer Science, Palo Alto, California, November 1993, IEEE, New York, pp. 352-361.