AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS   Info

MPI Audience

English

75 Minutes

Saarbrücken

I present Shor's algorithm, which factors integers in polynomial time on a quantum computer and explain how it fits into the general quantum complexity theory. I show how it can be interpreted as a special case of the hidden subgroup problem, which is the third algorithm class in which quantum computing is superior to classical computing.

math-vl

Uni-2230

--email hidden

passcode not visible

logged in users only

The talk is the continuation of last week's talk. Although the first talk was self-contained, this talk is not. You will need the first talk (or at least the notion of an abstract quantum computer) to understand this talk.