<!doctype html public "-//W3C//DTD W3 HTML//EN">
<html><head><style type="text/css"><!--
blockquote, dl, ul, ol, li { padding-top: 0 ; padding-bottom: 0 }
--></style><title>MIT Quantum Information Processing Special Seminar
TODAY</title></head><body>
<div>The following seminar will take place TODAY (October 14) at 16:00
hours in room 3-270:</div>
<div><br></div>
<hr>
<div align="center"><font size="+2"><b>Fast Quantum Modular
Exponentiation</b></font></div>
<div align="center"><br></div>
<div align="center"><font size="+1">by Rodney Van Meter (Keio
University)</font></div>
<div align="center"><br></div>
<div align="center"><u>ABSTRACT</u></div>
<div
> <span
></span
> <span
></span
> <span
></span
> <span
></span
> <span
></span
> <span
></span
>
</div>
<blockquote>Shor's algorithm for factoring large numbers runs in
polynomial time on a quantum computer. The most expensive
portion of Shor's algorithm is the modular exponentiation performed
before the more well-known quantum Fourier transform. The exact
details of the polynomial, its degree and constant factors, determine
the running time and consequently the practicality of the algorithm on
a particular quantum computer. In this talk, we will show our
circuits for performing the modular exponentiation. We show that
the running time depends on the combination of algorithm and
architecture, as well as clock speed.</blockquote>
<blockquote><br></blockquote>
<blockquote>Following the main talk will be a brief demonstration and
discussion of the quantum circuit compilation, optimization, and
visualization tools I am currently developing, for those who are
interested.</blockquote>
</body>
</html>