University of Cambridge > > Computer Laboratory Wednesday Seminars > Quantum computing -- theoretical prospects and relations to classical computation

Quantum computing -- theoretical prospects and relations to classical computation

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

If you have a question about this talk, please contact Stephen Clark.

Note change of lecture theatre

Quantum computing is based on a novel model of computation in which the elementary steps are quantum processes, in contrast to the familiar Boolean operations on bit strings that underlie classical models. As such it is meant to be realistically implementable, and it is known to have dramatic implications for some complexity issues (most famously providing an efficient algorithm for integer factorisation).

In this talk we will introduce the quantum model in a way that emphasises its computational ingredients, generalising some familiar classical notions and providing some intuition for its algorithmic possibilities and limitations. Then we will consider the question of the relationship between quantum and classical computing power. A definitive tool for exploring this issue is the notion of efficient classical simulation of quantum computations. We will outline a variety of recent surprising simulation results, suggesting that the quantum-classical relationship is richly complex and in fact very little understood.

This talk is part of the Computer Laboratory Wednesday Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity