메뉴 건너뛰기




Volumn 3566, Issue , 2005, Pages 1-16

From quantum physics to programming languages: A process algebraic approach

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA PROCESSING; ELEMENTARY PARTICLES; SEMANTICS;

EID: 26444434843     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527800_1     Document Type: Conference Paper
Times cited : (16)

References (30)
  • 1
    • 8344220258 scopus 로고    scopus 로고
    • Physical traces: Quantum vs. Classical information processing
    • Blute, R., Selinger, P. (eds.): Category Therory and Computer Science (CTCS'02) Elsevier
    • Abramsky, S., Coecke, B.: Physical traces: Quantum vs. Classical Information Processing. In: Blute, R., Selinger, P. (eds.): Category Therory and Computer Science (CTCS'02). Electronic Notes in Theoretical Computer Science 69, Elsevier (2003)
    • (2003) Electronic Notes in Theoretical Computer Science , vol.69
    • Abramsky, S.1    Coecke, B.2
  • 2
    • 4544315795 scopus 로고    scopus 로고
    • A categorical semantics of quantum protocols
    • Ganzinger, H. (ed.), IEEE Proceedings
    • Abramsky, S., Coecke, B.: A Categorical Semantics of Quantum Protocols. In: Ganzinger, H. (ed.): Logic in Computer Science (LICS 2004). IEEE Proceedings 415-425 (2004)
    • (2004) Logic in Computer Science (LICS 2004) , pp. 415-425
    • Abramsky, S.1    Coecke, B.2
  • 8
    • 0022421379 scopus 로고
    • Quantum theory, the church-turing principle and the universal quantum computer
    • Deutsch, D.: Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. In: Proceedings Royal Society London A, 400:97 (1985)
    • (1985) Proceedings Royal Society London A , vol.400 , pp. 97
    • Deutsch, D.1
  • 9
    • 35048828923 scopus 로고    scopus 로고
    • Quantum query complexity of some graph problems
    • Diaz, J. (ed): International Colloquium on Automata, Languages and Programming (ICALP'04), Springer-Verlag
    • Durr, C., Heiligman, M., Hoyer, P., Mhalla, M.: Quantum Query Complexity of some Graph Problems. In: Diaz, J. (ed): International Colloquium on Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science, Vol. 3142, Springer-Verlag, 481-493 (2004)
    • (2004) Lecture Notes in Computer Science , vol.3142 , pp. 481-493
    • Durr, C.1    Heiligman, M.2    Hoyer, P.3    Mhalla, M.4
  • 22
    • 0007986394 scopus 로고    scopus 로고
    • Master's Thesis, Institute of Information Systems, Technical University of Vienna
    • Ömer, B.: Quantum Programming in QCL. Master's Thesis, Institute of Information Systems, Technical University of Vienna (2000)
    • (2000) Quantum Programming in QCL
    • Ömer, B.1
  • 26
    • 68749116097 scopus 로고    scopus 로고
    • Towards a quantum programming language
    • Cambridge University Press
    • Selinger, P.: Towards a Quantum Programming Language. Mathematical Structures in Computer Science. Cambridge University Press, 14(4):525-586 (2004)
    • (2004) Mathematical Structures in Computer Science , vol.14 , Issue.4 , pp. 525-586
    • Selinger, P.1
  • 30
    • 1542385160 scopus 로고    scopus 로고
    • PhD Thesis, St. Cross College, Oxford University
    • Zuliani, P.: Quantum Programming. PhD Thesis, St. Cross College, Oxford University (2001)
    • (2001) Quantum Programming
    • Zuliani, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.