Classically controlled quantum computation

Mathematical Structures in Computer Science

Volumn 16, Issue 4, 2006, Pages 601-620

  Perdrix, Simon ^a   Jorrand, Philippe ^a  

^a UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750737430     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012950600538X     Document Type: Conference Paper

References (23)

1. Aharonov, D. (1998) Quantum Computation, Annual Reviews of Computational Physics, vol VI.
2. Bennett, C., Brassard, G., Crepeau, C., Jozsa, R., Peres, A. and Wootters, W. (1993) Teleporting an unknown quantum state via dual classical and EPR channels. Phys Rev Lett 1895-1899.
3. Bettelli, S., Serafini, L. and Calarco, T. (2003) Toward an architecture for quantum programming. European Pkysical Journal D 25 (2) 181-200.
4. Bernstein, E. and Vazirani, U. (1997) Quantum complexity theory. SIAM J. Comput. 26 1411-1473.
5. Deutsch, D. (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A 400 97-117.
6. Danos, V., Kashefi, E. and Panangaden, P. (2004) The Measurement Calculus. arXiv:quant-ph/0412135.
7. Iriyama, S., Ohya, M. and Volovich, I. (2004) Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm. arXiv:quant-ph/0405191.
8. Jorrand, Ph. and Lalire, M. (2004) Toward a quantum process algebra. In: Proceedings of the 1st ACM Conference on Computing Frontiers, ACM Press. (Also available as arXiv:quant-ph/0312067.)
9. Kitaev, A. Y., Shen, A. H. and Vyalyi, M. N. (2002) Classical and Quantum Computation, American Mathematical Society.
10. Knill, E.H. (1996) Conventions for Quantum Pseudocode. LANL report LAUR-96-2724.
11. Leung, D. W. (2004) Quantum computation by measurements. International Journal of Quantum Information 2 (1) 33-43
12. Miyadera, T. and Ohya, M. (2005) On Halting Process of Quantum Turing Machine. Open Systems and Information Dynamics 12 (3) 261-264.
13. Muthukrishnan, A. and Stroud, C. R. (2000) Multi-valued logic gates for quantum computation. Phys. Rev. A 62 052309.
14. Nielsen, M. A. and Chuang, I. L. (2000) Quantum Computation and Quantum Information, Cambridge University Press.
15. Nielsen, M. A. (2003) Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Phys. Lett. A. 308.
16. Nishimura, H. and Ozawa, M. (2002) Computational Complexity of Uniform Quantum Circuit Families and Quantum Turing Machines. Theoretical Computer Science 276 147-181.
17. Papadimitriou, C. M. (1994) Computational Complexity, Addison-Wesley.
18. Perdrix, S. (2005) State Transfer instead of Teleportation in Measurement-based Quantum Computation. International Journal of Quantum Information 3 (1).
19. Raussendorf, R. and Briegel, H. J. (2003) Measurement-based quantum computation with cluster states. Phys. Rev. A 68 022312.
20. Selinger, P. (2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14 (4) 527-586.
21. Selinger, P. and Valiron, B. (2005) A lambda calculus for quantum computation with classical control. In: Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA). Springer-Verlag Lecture Notes in Computer Science 3461. (Also available as arXiv:cs.LO/0404056.)
22. Watrous, J. (2000) Succinct quantum proofs for properties of finite groups. In: Proc. 41st Annual Symposium on Foundation of Computer Science 537-546.
23. Yao, A.C. (1993) Quantum circuit complexity. In: Proc. 34th IEEE Symposium on Foundation of Computer Science 352-361.