Measurement-based classical computation: Classifying the computational power of entangled states

Add to your list(s) Download to your calendar using vCal

• Dan Browne - UCL
• Wednesday 23 April 2008, 16:15-17:15
• Centre for Mathematical Sciences, Wilberforce Road, Lecture room MR14 (Pavilion F).

If you have a question about this talk, please contact Berry Groisman.

Joint work with Janet Anders (UCL)

Measurement-based quantum computation has shown us that entangled states can in some sense be considered to have “computational power”. In classical computer science, the notion of computational power has been successfully formalised in the field of computational complexity theory. In this talk, I will describe an approach to the classification of the computational power of families of entangled states in measurement-based quantum computation. This will lead naturally to the notion of measurement based “classical computation”, in our analysis of which, familiar states and constructions will arise.

In our analysis, we will draw on concepts and techniques from computational complexity theory and quantum foundations (such as non-signalling non-locality) and illustrate some unexpected connections between them.

The talk will be accessible to all with a general background in quantum information.

Reference: J. Anders and D.E. Browne – Measurement-based classical computation – on the arXiv next week or soon afterwards…

This talk is part of the bg268's list series.

This talk is included in these lists:

• Centre for Mathematical Sciences, Wilberforce Road, Lecture room MR14 (Pavilion F)

Note that ex-directory lists are not shown.