The search for structure in quantum computation

Authors:
Prakash Panangaden
Affiliations:
School of Computer Science, McGill University and Computing Laboratory, University of Oxford
Venue:
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 11
Cited 0

Quantum Complexity Theory

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A Lambda Calculus for Quantum Computation

SIAM Journal on Computing
Towards a quantum programming language

Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
The measurement calculus

Journal of the ACM (JACM)
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Interacting Quantum Observables

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Parallelizing quantum circuits

Theoretical Computer Science
The compositional structure of multipartite quantum entanglement

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The computational power of the W And GHZ States

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

I give a non-comprehensive survey of the categorical quantum mechanics program and how it guides the search for structure in quantum computation. I discuss the example of measurement-based computing which is one of the successes of such an enterprise and briefly mention topological quantum computing which is an inviting target for future research in this area.