Computer Science and Electrical Engineering
Quantum Computing Seminar
Shor’s Algorithm Part 2
Samuel Lomonaco, CSEE, UMBC
2:30-3:00 Tuesday, 3 December 2013, ITE 325b
As requested in the last seminar, we will devote this seminar to stepping through the complete Shor algorithm (from beginning to end) to factor the “enormous” integer 21. This talk will based on the example found at the beginning of the following paper.
Quantum hidden subgroup algorithms: A mathematical perspective, AMS CONM, vol. 305, (2002), 139 – 202.
Samuel J. Lomonaco is a professor at the Department of Computer Science and Electrical Engineering of the University of Maryland Baltimore County. He is internationally known for his many contributions in mathematics and in computer science. His research interests span a wide range of subjects from knot theory, algebraic and differential topology to algebraic coding theory, quantum computation, and symbolic computation. In quantum cryptography, he has shown how quantum information theory can be used to gain a better understanding of eavesdropping with quantum entanglement. In quantum computation, he has shown how Lie groups can be used to solve problems arising in the study of quantum entanglement. In 2000 Professor Lomonoco organized the first American Mathematical Society short course on quantum computation.
Organizer: Prof. Samuel Lomonaco,