A common algebraic description for probabilistic and quantum computations (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 851-862

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

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS; QUANTUM ELECTRONICS;

ALGEBRAIC DESCRIPTION; COMPLETE PROBLEMS; GATE ARRAYS; PROBLEM PROPERTIES; QUANTUM GATES; SEMI-RING; TENSOR FORMULAS; UNIFIED FRAMEWORK;

C (PROGRAMMING LANGUAGE);

EID: 27644596743     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_67     Document Type: Article

References (15)

1. L. M. Adleman, H. DeMarrais, and M,-D. A. Huang. Quantum computability. SIAM Journal on Computing, 26(5):1524-1540, October 1997.
2. 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. Physical Review A, 52:3457-3467, 1995.
3. M. Beaudry and M. Holzer. The complexity of tensor circuit evaluation. In J. Sgall, A. Pultr, and P. Kolman, editors, Proceedings of the 26th Conference on Mathematical Foundations of Computer Science, number 2136 in LNCS, pages 173-185, Mariánské Lázně, Czech Republic, August 2001. Springer.
4. C. H. Bennett. Time/space trade-offs for reversible computation. SIAM Journal on Computing, 18(4):766-776, August 1989.
5. C. Damm, M. Holzer, and P. McKenzie. The complexity of tensor calculus. Computational Complexity, 11(1/2):54-89, 2003.
6. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society London, Series A, 400:97-117, 1985.
7. D. P. DiVincenzo. Two-bit gates are universal for quantum computation. Physical Review A, 51:1015-1022, 1995.
8. S. A. Fenner, L. Fortnow, and S. A. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48(1): 116-148, February 1994.
9. J. M. Fernandez and W. A. Schneeberger. Quaternionic computing. Technical Report quant-ph/0307017, Los Alamos Preprint Archiv, July 2003.
10. L. Fortnow. One complexity theorist's view of quantum computing. Theoretical Computer Science, 292(3):597-610, January 2003.
11. J. Gruska. Quantum Computing. Advanced Topics in Computer Science. McGraw Hill, 1999.
12. L. A. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. EATCS Monographs in Theoretical Computer Science. Springer, 2002.
13. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5 of EATCS Monographs on Theoretical Computer Science. Springer, 1986.
14. A. L. Selman. Promise problems complete for complexity classes. Information and Computation, 78:87-98, 1988.
15. A. C.-C. Yao. Quantum circuit complexity. In Proceedings of the 34th Symposium on Foundations of Computer Science, pages 352-361, Palo Alto, California, November 1993. IEEE Computer Society Press.